1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590
|
;;; coq-syntax.el --- Font lock expressions for Coq -*- lexical-binding:t -*-
;; This file is part of Proof General.
;; Portions © Copyright 1994-2012 David Aspinall and University of Edinburgh
;; Portions © Copyright 2003-2021 Free Software Foundation, Inc.
;; Portions © Copyright 2001-2017 Pierre Courtieu
;; Portions © Copyright 2010, 2016 Erik Martin-Dorel
;; Portions © Copyright 2011-2013, 2016-2017 Hendrik Tews
;; Portions © Copyright 2015-2017 Clément Pit-Claudel
;; Authors: Thomas Kleymann, Healfdene Goguen, Pierre Courtieu
;; Maintainer: Pierre Courtieu <Pierre.Courtieu@cnam.fr>
;; SPDX-License-Identifier: GPL-3.0-or-later
;;; Commentary:
;;
;;; Code:
(eval-when-compile (require 'cl-lib))
(require 'coq-db)
;;; keyword databases
(defcustom coq-user-tactics-db nil
"User defined tactic information. See `coq-syntax-db' for syntax.
It is not necessary to add your own tactics here (it is not
needed by the synchronizing/backtracking system). You may however do
so for the following reasons:
1 your tactics will be colorized by font-lock
2 your tactics will be added to the menu and to completion when
calling \\[coq-insert-tactic]
3 you may define an abbreviation for your tactic."
:type '(repeat sexp)
:group 'coq)
(defcustom coq-user-commands-db nil
"User defined command information. See `coq-syntax-db' for syntax.
It is not necessary to add your own commands here (it is not
needed by the synchronizing/backtracking system). You may however do
so for the following reasons:
1 your commands will be colorized by font-lock
2 your commands will be added to the menu and to completion when
calling \\[coq-insert-command]
3 you may define an abbreviation for your command."
:type '(repeat sexp)
:group 'coq)
(defcustom coq-user-tacticals-db nil
"User defined tactical information. See `coq-syntax-db' for syntax.
It is not necessary to add your own commands here (it is not
needed by the synchronizing/backtracking system). You may however do
so for the following reasons:
1 your commands will be colorized by font-lock
2 your commands will be added to the menu and to completion when
calling \\[coq-insert-command]
3 you may define an abbreviation for your command."
:type '(repeat sexp)
:group 'coq)
(defcustom coq-user-solve-tactics-db nil
"User defined closing tactics. See `coq-syntax-db' for syntax.
It is not necessary to add your own commands here (it is not
needed by the synchronizing/backtracking system). You may however do
so for the following reasons:
1 your commands will be colorized by font-lock
2 your commands will be added to the menu and to completion when
calling \\[coq-insert-command]
3 you may define an abbreviation for your command."
:type '(repeat sexp)
:group 'coq)
(defcustom coq-user-cheat-tactics-db nil
"User defined closing tactics BY CHEATING (ex: admit).
See `coq-syntax-db' for syntax. It is not necessary to add your
own commands here (it is not needed by the
synchronizing/backtracking system). You may however do so for
the following reasons:
1 your commands will be colorized by font-lock
2 your commands will be added to the menu and to completion when
calling \\[coq-insert-command]
3 you may define an abbreviation for your command."
:type '(repeat sexp)
:group 'coq)
(defcustom coq-user-reserved-db nil
"User defined reserved keywords information. See `coq-syntax-db' for syntax.
It is not necessary to add your own commands here (it is not
needed by the synchronizing/backtracking system). You may however do
so for the following reasons:
1 your commands will be colorized by font-lock
2 your commands will be added to the menu and to completion when
calling \\[coq-insert-command]
3 you may define an abbreviation for your command."
:type '(repeat sexp)
:group 'coq)
;; user shortcuts are prioritized by being put at the end
(defvar coq-tactics-db
(append
'(
("absurd " "abs" "absurd " t "absurd")
("apply" "ap" "apply " t "apply")
("assert by" "assb" "assert ( # : # ) by #" t "assert")
("assert" "ass" "assert ( # : # )" t)
;; ("assumption" "as" "assumption" t "assumption")
("auto with arith" "awa" "auto with arith" t)
("auto with" "aw" "auto with @{db}" t)
("auto" "a" "auto" t "auto")
("autorewrite with in using" "arwiu" "autorewrite with @{db,db...} in @{hyp} using @{tac}" t)
("autorewrite with in" "arwi" "autorewrite with @{db,db...} in @{hyp}" t)
("autorewrite with using" "arwu" "autorewrite with @{db,db...} using @{tac}" t)
("autorewrite with" "ar" "autorewrite with @{db,db...}" t "autorewrite")
("case" nil "case " t "case")
("case_eq" "ceq" "case_eq " t "case_eq")
("case_type" "cty" "case_type " t "case_type")
("cbn" "c" "cbn" t "cbn")
("cbn (with flags)" "cbn" "cbn beta delta [#] iota zeta" t "cbn")
("cbv" "cbv" "cbv beta delta [#] iota zeta" t "cbv")
("change in" "chi" "change # in #" t)
("change with in" "chwi" "change # with # in #" t)
("change with" "chw" "change # with" t)
("change" "ch" "change " t "change")
("clear" "cl" "clear" t "clear")
("clear dependent" "cldep" "clear dependent" t "clear\\s-+dependent")
("clearbody" "cl" "clearbody" t "clearbody")
("cofix" "cof" "cofix" t "cofix")
("coinduction" "coind" "coinduction" t "coinduction")
("compare" "cmpa" "compare # #" t "compare")
("compute" "cmpu" "compute" t "compute")
;; ("congruence" "cong" "congruence" t "congruence")
("constructor" "cons" "constructor" t "constructor")
;; ("contradiction" "contr" "contradiction" t "contradiction")
("cut" "cut" "cut" t "cut")
("cutrewrite" "cutr" "cutrewrite -> # = #" t "cutrewrite")
;; ("decide equality" "deg" "decide equality" t "decide\\s-+equality")
("decide_right" "decr" "decide_right" t "decide\\s-+right")
("decide_left" "decl" "decide_left" t "decide\\s-+left")
("decide" nil "decide" t "decide")
("decompose record" "decr" "decompose record #" t "decompose\\s-+record")
("decompose sum" "decs" "decompose sum #" t "decompose\\s-+sum")
("decompose" "dec" "decompose [#] #" t "decompose")
("dependent inversion" "depinv" "dependent inversion" t "dependent\\s-+inversion")
("dependent inversion with" "depinvw" "dependent inversion # with #" t)
("dependent inversion_clear" "depinvc" "dependent inversion_clear" t "dependent\\s-+inversion_clear")
("dependent inversion_clear with" "depinvw" "dependent inversion_clear # with #" t)
("dependent rewrite ->" "depr" "dependent rewrite -> @{id}" t "dependent\\s-+rewrite")
("dependent rewrite <-" "depr<" "dependent rewrite <- @{id}" t)
("destr_eq" "deseq" "destr_eq " t "destr_eq")
("destruct as" "desa" "destruct # as #" t)
("destruct using" "desu" "destruct # using #" t)
("destruct" "des" "destruct " t "destruct")
("destruct_with_eqn" "deswe" "destruct_with_eqn " t "destruct_with_eqn")
("destruct_all" "desall" "destruct_all " t "destruct_all")
;; ("discriminate" "dis" "discriminate" t "discriminate")
("discrR" "discrR" "discrR" t "discrR")
("double induction" "dind" "double induction # #" t "double\\s-+induction")
("eapply" "eap" "eapply #" t "eapply")
("eauto with arith" "eawa" "eauto with arith" t)
("eauto with" "eaw" "eauto with @{db}" t)
("eauto" "ea" "eauto" t "eauto")
("econstructor" "econs" "econstructor" t "econstructor")
("edestruct" "edes" "edestruct " t "edestruct")
("eexists" "eex" "eexists" t "eexists")
("eleft" "eleft" "eleft" t "eleft")
("elim using" "elu" "elim # using #" t)
("elim" "e" "elim #" t "elim")
("elimtype" "elt" "elimtype" t "elimtype")
("enough" "eng" "enough (#: #).\n{ #\n}" t "enough")
("erewrite" "er" "erewrite #" t "erewrite")
("eright" "erig" "eright" "eright")
("esplit" "esp" "esplit" t "esplit")
("etransitivity" "etr" "etransitivity" t "etransitivity")
;; ("exact" "exa" "exact" t "exact")
("exfalso" "exf" "exfalso" t "exfalso")
("exists" "ex" "exists #" t "exists")
;; ("fail" "fa" "fail" nil)
("field" "field" "field" t "field")
("false_hyp" nil "false_hyp @{H} @{G}" t "false_hyp")
("firstorder" "fsto" "firstorder" t "firstorder")
("firstorder with" "fsto" "firstorder with #" t)
("firstorder with using" "fsto" "firstorder # with #" t)
("fold" "fold" "fold #" t "fold")
;; ("fourier" "four" "fourier" t "fourier")
("functional induction" "fi" "functional induction @{f} @{args}" t "functional\\s-+induction")
("functional inversion" "finv" "functional inversion @{H}" t "functional\\s-+inversion")
("generalize dependent" "gd" "generalize dependent #" t "generalize\\s-+dependent")
("generalize" "g" "generalize #" t "generalize")
("hnf" "hnf" "hnf" t "hnf")
("idtac" "id" "idtac" nil "idtac") ; also in tacticals with abbrev id
("idtac \"" "id\"" "idtac \"#\"") ; also in tacticals
("induction" "ind" "induction #" t "induction")
("induction using" "indu" "induction # using #" t)
("injection" "inj" "injection #" t "injection")
("instantiate" "inst" "instantiate" t "instantiate")
("intro" "i" "intro" t "intro")
("intro after" "ia" "intro # after #" t)
("intros" "is" "intros #" t "intros")
("intros! (guess names)" nil "intros #" nil nil coq-insert-intros)
("intros until" "isu" "intros until #" t)
("intuition" "intu" "intuition #" t "intuition")
("inversion" "inv" "inversion #" t "inversion")
("inversion in" "invi" "inversion # in #" t)
("inversion using" "invu" "inversion # using #" t)
("inversion using in" "invui" "inversion # using # in #" t)
("inversion_clear" "invcl" "inversion_clear" t "inversion_clear")
("lapply" "lap" "lapply" t "lapply")
("lazy" "lazy" "lazy beta delta [#] iota zeta" t "lazy")
("lazymatch with" "lazym" "lazymatch # with\n| # => #\nend")
("lazy_match! with" "lazy_m" "lazy_match! # with\n| # => #\nend")
("left" "left" "left" t "left")
("lia" nil "lia" t "lia")
("linear" "lin" "linear" t "linear")
("load" "load" "load" t "load")
("lra" nil "lra" t "lra")
("move after" "mov" "move # after #" t "move")
("multimatch with" "mm" "multimatch # with\n| # => #\nend")
("multi_match! with" "multi_m" "multi_match! # with\n| # => #\nend")
("nia" nil "nia" t "nia")
("now_show" nil "now_show" t "now_show")
("nra" nil "nra" t "nra")
("nsatz" nil "nsatz" t "nsatz")
("omega" "o" "omega" t "omega")
("pattern" "pat" "pattern" t "pattern")
("pattern(s)" "pats" "pattern # , #" t)
("pattern at" "pata" "pattern # at #" t)
("pose" "po" "pose ( # := # )" t "pose")
("prolog" "prol" "prolog" t "prolog")
("psatz" nil "psatz" t "psatz")
("quote" "quote" "quote" t "quote")
("quote []" "quote2" "quote # [#]" t)
("red" "red" "red" t "red")
("rapply" "rap" "rapply #" t "rapply")
("refine" "ref" "refine" t "refine")
;; ("reflexivity" "refl" "reflexivity #" t "reflexivity")
("remember" "rem" "remember # as #" t "remember")
("rename into" "ren" "rename # into #" t "rename")
("replace with" "rep" "replace # with #" t "replace")
("replace with in" "repi" "replace # with # in #" t)
("revert dependent" "r" "revert dependent" t "revert\\s-+dependent")
("revert" "r" "revert" t "revert")
("rewrite_all" nil "rewrite_all" t "rewrite_all")
("rewrite_all <-" nil "rewrite_all" t "rewrite_all")
("rewrite <- in" "ri<" "rewrite <- # in #" t)
("rewrite <-" "r<" "rewrite <- #" t)
("rewrite in" "ri" "rewrite # in #" t)
("rewrite" "r" "rewrite #" t "rewrite")
("right" "rig" "right" t "right")
;; ("ring" "ring" "ring #" t "ring")
("romega" nil "romega" t "romega")
("set in * |-" "seth" "set ( # := #) in * |-" t)
("set in *" "set*" "set ( # := #) in *" t)
("set in |- *" "setg" "set ( # := #) in |- *" t)
("set in" "seti" "set ( # := #) in #" t)
("set" "set" "set ( # := #)" t "set")
("setoid_replace with" "strep2" "setoid_replace # with #" t "setoid_replace")
("setoid replace with" "strep" "setoid replace # with #" t "setoid\\s-+replace")
("setoid_rewrite" "strew" "setoid_rewrite #" t "setoid_rewrite")
("setoid rewrite" "strew" "setoid rewrite #" t "setoid\\s-+rewrite")
("simpl" "s" "simpl" t "simpl")
("simpl at" "sa" "simpl # at #" t)
("simpl (all flags)" "simpl" "simpl beta delta [#] iota zeta" t)
("simple destruct" "sdes" "simple destruct" t "simple\\s-+destruct")
("simple inversion" "sinv" "simple inversion" t "simple\\s-+inversion")
("simple induction" "sind" "simple induction" t "simple\\s-+induction")
("simplify_eq" "simeq" "simplify_eq @{hyp}" t "simplify_eq")
("specialize" "spec" "specialize" t "specialize")
("split" "sp" "split" t "split")
("split_Rabs" "spra" "splitRabs" t "split_Rabs")
("split_Rmult" "sprm" "splitRmult" t "split_Rmult")
("stepl" "stl" "stepl #" t "stepl")
("stepl by" "stlb" "stepl # by #" t)
("stepr" "str" "stepr #" t "stepr")
("stepr by" "strb" "stepr # by #" t)
("subst" "su" "subst #" t "subst")
("symmetry" "sy" "symmetry" t "symmetry")
("symmetry in" "syi" "symmetry in #" t)
;; ("tauto" "ta" "tauto" t "tauto")
("transitivity" "trans" "transitivity #" t "transitivity")
("trivial" "t" "trivial" t "trivial")
("trivial with" "tw" "trivial with @{db}" t)
("unfold" "u" "unfold #" t "unfold")
("unfold(s)" "us" "unfold # , #" t)
("unfold in" "unfi" "unfold # in #" t)
("unfold at" "unfa" "unfold # at #" t)
("vm_compute" "vmc" "vm_compute." t "vm_compute")
;; SSReflect tactics.
("nat_congr" "ncongr" "nat_congr" t "nat_congr")
("nat_norm" "nnorm" "nat_norm" t "nat_norm")
("bool_congr" "bcongr" "bool_congr" t "bool_congr")
("prop_congr" "prcongr" "prop_congr" t "prop_congr")
("move" "m" "move" t "move")
("pose" "po" "pose # := #" t "pose")
("set" "set" "set # := #" t "set")
("have" "hv" "have # : #" t "have")
("congr" "con" "congr #" t "congr")
("wlog" "wlog" "wlog : / #" t "wlog")
("without loss" "wilog" "without loss #" t "without loss")
("unlock" "unlock" "unlock #" t "unlock")
("suffices" "suffices" "suffices # : #" t "suffices")
("suff" "suff" "suff # : #" t "suff")
("zify" nil "zify" t "zify")
)
coq-user-tactics-db)
"Coq tactics information list. See `coq-syntax-db' for syntax."
)
;; user shortcuts are prioritized by being put at the end
(defvar coq-solve-tactics-db
(append
'(
("assumption" "as" "assumption" t "assumption")
("eassumption" "eas" "eassumption" t "eassumption")
("easy" nil "easy" t "easy")
("now" nil "now" t "now")
("by" "by" "by #" t "by")
("congruence" "cong" "congruence" t "congruence")
("contradict" "contr" "contradict" t "contradict")
("contradiction" "contr" "contradiction" t "contradiction")
("decide equality" "deg" "decide equality" t "decide\\s-+equality")
("discriminate" "dis" "discriminate" t "discriminate")
("exact" "exa" "exact" t "exact")
("fourier" "four" "fourier" t "fourier")
("fail" "fa" "fail" nil)
("gfail" "gfa" "gfail" nil "gfail")
("lia" nil "lia" t "lia")
("lra" nil "lra" t "lra")
("nia" nil "nia" t "nia")
("nra" nil "nra" t "nra")
("nsatz" nil "nsatz" t "nsatz")
("omega" "o" "omega" t "omega")
("romega" nil "romega" t "romega")
("psatz" nil "psatz" t "psatz")
("reflexivity" "refl" "reflexivity #" t "reflexivity")
("ring" "ring" "ring #" t "ring")
("solve" nil "solve [ # | # ]" nil "solve")
("tauto" "ta" "tauto" t "tauto")
;; SSReflect solving tactics.
("done" nil "done" nil "done")
)
coq-user-solve-tactics-db)
"Coq tactic(al)s that solve a subgoal."
)
(defvar coq-solve-cheat-tactics-db
(append
'(("admit" nil "admit" t "admit")
("Admitted" nil "Admitted" t "Admitted")
("Abort" nil "Abort" t "Abort"))
coq-user-cheat-tactics-db)
"Coq tactic(al)s that solve a subgoal."
)
;; FIXME is this needed?
(defvar develock-coq-font-lock-keywords
'((develock-find-long-lines
(1 'develock-long-line-1 t)
(2 'develock-long-line-2 t))
("[^ \n ]\\([ ]+\\)$"
(1 'develock-whitespace-1 t))
("^[ ]+$"
(0 'develock-whitespace-2 append))
("\\.[{}]" 0 'develock-whitespace-2 nil nil)))
(defvar coq-tacticals-db
(append
'(
("info" nil "info #" nil "info")
("first" nil "first [ # | # ]" nil "first")
("abstract" nil "abstract @{tac} using @{name}." nil "abstract")
("do" nil "do @{num} @{tac}" nil "do")
("idtac" nil "idtac") ; also in tactics
; ("idtac \"" nil "idtac \"#\"") ; also in tactics
("fail" "fa" "fail" nil "fail")
; ("fail \"" "fa\"" "fail" nil) ;
; ("orelse" nil "orelse #" t "orelse")
("repeat" nil "repeat #" nil "repeat")
("try" nil "try #" nil "try")
("tryif" "tryif" "tryif # then # else #" nil "tryif")
("progress" nil "progress #" nil "progress")
("|" nil "[ # | # ]" nil)
("||" nil "# || #" nil)
;; SSReflect tacticals.
("last" "lst" nil t "last")
)
coq-user-tacticals-db)
"Coq tacticals information list. See `coq-syntax-db' for syntax.")
(defvar coq-decl-db
'(
("Local Axiom" nil "Local Axiom # : #" t "Local\\s-+Axiom")
("Local Axioms" nil "Local Axioms # , #: #" t "Local\\s-+Axioms")
("Axiom" "ax" "Axiom # : #" t "Axiom")
("Axioms" "axs" "Axioms # , #: #" t "Axioms")
("Global Variable" "gv" "Global Variable #: #." t "Global\\s-+Variable")
("Global Variables" "gvs" "Global Variables # , #: #." t "Global\\s-+Variables")
("Hint Constructors" "hc" "Hint Constructors # : #." t "Hint\\s-+Constructors")
("Hint Extern" "he" "Hint Extern @{cost} @{pat} => @{tac} : @{db}." t "Hint\\s-+Extern")
("Hint Mode" "hm" "Hint Mode # @{mode...} : @{db}." t "Hint\\s-+Mode")
("Hint Immediate" "hi" "Hint Immediate # : @{db}." t "Hint\\s-+Immediate")
("Hint Resolve" "hr" "Hint Resolve # : @{db}." t "Hint\\s-+Resolve")
("Hint Rewrite ->" "hrw" "Hint Rewrite -> @{t1,t2...} using @{tac} : @{db}." t "Hint\\s-+Rewrite")
("Hint Rewrite <-" "hrw" "Hint Rewrite <- @{t1,t2...} using @{tac} : @{db}." t )
("Hint Unfold" "hu" "Hint Unfold # : #." t "Hint\\s-+Unfold")
("Existing Class" nil "Existing Class " t "Existing\\s-+Class")
("Existing Instance" nil "Existing Instance " t "Existing\\s-+Instance")
("Existing Instances" nil "Existing Instances " t "Existing\\s-+Instances")
("Hypothesis" "hyp" "Hypothesis #: #" t "Hypothesis")
("Hypotheses" "hyp" "Hypotheses #: #" t "Hypotheses")
("Parameter" "par" "Parameter #: #" t "Parameter")
("Parameters" "par" "Parameters #: #" t "Parameters")
("Conjecture" "conj" "Conjecture #: #." t "Conjecture")
("Variable" "v" "Variable #: #." t "Variable")
("Variables" "vs" "Variables # , #: #." t "Variables")
("Context" nil "Context #, (# : #)." t "Context")
("Local Coercion" nil "Local Coercion @{id} : @{typ1} >-> @{typ2}." t "Local\\s-+Coercion")
("Coercion" "coerc" "Coercion @{id} : @{typ1} >-> @{typ2}." t "Coercion")
)
"Coq declaration keywords information list. See `coq-syntax-db' for syntax."
)
(defvar coq-defn-db
'(
("Canonical Structure" nil "Canonical Structure #." t "Canonical\\s-+Structure")
("CoFixpoint" "cfix" "CoFixpoint # (#:#) : # :=\n#." t "CoFixpoint")
("CoInductive" "coindv" "CoInductive # : # :=\n|# : #." t "CoInductive")
("Class" "class" "Class [ # ] := \n# : #;\n# : #." t "Class")
("Declare Module : :=" "dm" "Declare Module # : # := #." t "Declare\\s-+Module")
("Declare Module <: :=" "dm2" "Declare Module # <: # := #." t);; careful
("Declare Module Import : :=" "dmi" "Declare Module # : # := #." t)
("Declare Module Import <: :=" "dmi2" "Declare Module # <: # := #." t);; careful
("Declare Module Export : :=" "dme" "Declare Module # : # := #." t)
("Declare Module Export <: :=" "dme2" "Declare Module # <: # := #." t);; careful
("Local Definition" nil "Local Definition #:# := #." t "Local\\s-+Definition");; careful
("Definition" "def" "Definition #:# := #." t "Definition");; careful
("Definition (2 args)" "def2" "Definition # (# : #) (# : #):# := #." t)
("Definition (3 args)" "def3" "Definition # (# : #) (# : #) (# : #):# := #." t)
("Definition (4 args)" "def4" "Definition # (# : #) (# : #) (# : #) (# : #):# := #." t)
("Program Definition" "pdef" "Program Definition #:# := #." t "Program\\s-+Definition");; careful ?
("Program Definition (2 args)" "pdef2" "Program Definition # (# : #) (# : #):# := #." t)
("Program Definition (3 args)" "pdef3" "Program Definition # (# : #) (# : #) (# : #):# := #." t)
("Program Definition (4 args)" "pdef4" "Program Definition # (# : #) (# : #) (# : #) (# : #):# := #." t)
("Derive Inversion" nil "Derive Inversion @{id} with # Sort #." t "Derive\\s-+Inversion")
("Derive Dependent Inversion" nil "Derive Dependent Inversion @{id} with # Sort #." t "Derive\\s-+Dependent\\s-+Inversion")
("Derive Inversion_clear" nil "Derive Inversion_clear @{id} with # Sort #." t)
("Derive SuchThat" nil "Derive @[id] SuchThat # As @{id}." t "Derive")
("Example" "ex" "Example #:# := #." t "Example");; careful
("Equations" "eqs" "Equations #:# := #." t "Equations")
("Fixpoint" "fix" "Fixpoint # (#:#) {struct @{arg}} : # :=\n#." t "Fixpoint")
("Program Fixpoint" "pfix" "Program Fixpoint # (#:#) {struct @{arg}} : # :=\n#." t "Program\\s-+Fixpoint")
("Program Fixpoint measure" "pfixm" "Program Fixpoint # (#:#) {measure @{arg} @{f}} : # :=\n#." t)
("Program Fixpoint wf" "pfixwf" "Program Fixpoint # (#:#) {wf @{arg} @{f}} : # :=\n#." t)
("Function" "func" "Function # (#:#) {struct @{arg}} : # :=\n#." t "Function")
("Function measure" "funcm" "Function # (#:#) {measure @{f} @{arg}} : # :=\n#." t)
("Function wf" "func wf" "Function # (#:#) {wf @{R} @{arg}} : # :=\n#." t)
("Functional Scheme with" "fsw" "Functional Scheme @{name} := Induction for @{fun} with @{mutfuns}." t )
("Functional Scheme" "fs" "Functional Scheme @{name} := Induction for @{fun}." t "Functional\\s-+Scheme")
("Inductive" "indv" "Inductive # : # := # : #." t "Inductive")
("Inductive (2 args)" "indv2" "Inductive # : # :=\n| # : #\n| # : #." t )
("Inductive (3 args)" "indv3" "Inductive # : # :=\n| # : #\n| # : #\n| # : #." t )
("Inductive (4 args)" "indv4" "Inductive # : # :=\n| # : #\n| # : #\n| # : #\n| # : #." t )
("Inductive (5 args)" "indv5" "Inductive # : # :=\n| # : #\n| # : #\n| # : #\n| # : #\n| # : #." t )
("Instance" nil "Instance #:#.\nProof.\n#Defined." t "Instance")
("Program Instance" "pinstance" "Program Instance [ # ] => # where \n# := #;\n# := #." t "Program\\s-+Instance")
("Let" "Let" "Let # : # := #." t "Let")
("Local Ltac2" nil "Local Ltac2 # := #." t "Local\\s-+Ltac2")
("Ltac2 Type" "lt2rty" "Ltac2 Type rec # := #." t "Ltac2 Type rec")
("Ltac2 Type" "lt2ty" "Ltac2 Type # := #." t "Ltac2 Type")
("Ltac2 Type" "lt2oty" "Ltac2 Type # ::= #." t "Ltac2 Type")
("Ltac2 Type" "lt2wty" "Ltac2 Type #." t "Ltac2 Type")
("Ltac2" "lt2mr" "Ltac2 mutable rec # := #." t "Ltac2 mutable rec")
("Ltac2" "lt2m" "Ltac2 mutable # := #." t "Ltac2 mutable")
("Ltac2" "lt2r" "Ltac2 rec # := #." t "Ltac2 rec")
("Ltac2" "lt2s" "Ltac2 Set # := #." t "Ltac2 Set")
("Ltac2" "lt2" "Ltac2 # := #." t "Ltac2")
("Local Ltac" nil "Local Ltac # := #." t "Local\\s-+Ltac")
("Ltac" "ltac" "Ltac # := #." t "Ltac")
("Module :=" "mo" "Module # : # := #." t ) ; careful
("Module <: :=" "mo2" "Module # <: # := #." t ) ; careful
("Module Import :=" "moi" "Module Import # : # := #." t ) ; careful
("Module Import <: :=" "moi2" "Module Import # <: # := #." t ) ; careful
("Module Export :=" "moe" "Module Export # : # := #." t ) ; careful
("Module Export <: :=" "moe2" "Module Export# <: # := #." t ) ; careful
("Record" "rec" "Record # : # := {\n# : #;\n# : # }" t "Record")
("Scheme" "sc" "Scheme @{name} := #." t "Scheme")
("Scheme Induction" "sci" "Scheme @{name} := Induction for # Sort #." t)
("Scheme Minimality" "scm" "Scheme @{name} := Minimality for # Sort #." t)
("Structure" "str" "Structure # : # := {\n# : #;\n# : # }" t "Structure")
("Typeclasses eauto" nil "Typeclasses eauto := #." t "Typeclasses\\s-+eauto")
("Variant" "varv" "Variant # : # := # : #." t "Variant")
)
"Coq definition keywords information list. See `coq-syntax-db' for syntax."
)
;; modules and section are indented like goal starters
;; PC TODO: this category is used only for indentation, because
;; scripting uses information from coq to decide if a goal is
;; started. Since it is impossible for some commands to know
;; syntactically if they start something (ex: Instance), the
;; right thing to do would be to indent only on "Proof." and forget
;; about this category for indentation.
(defvar coq-goal-starters-db
'(
("Add Morphism" "addmor" "Add Morphism @{f} : @{id}" t "Add\\s-+Morphism")
("Add Parametric Morphism" nil "Add Parametric Morphism : " t "Add\\s-+Parametric\\s-+Morphism")
("Chapter" "chp" "Chapter # : #." t "Chapter")
("Corollary" "cor" "Corollary # : #.\nProof.\n#\nQed." t "Corollary")
("Declare Module :" "dmi" "Declare Module # : #.\n#\nEnd #." t)
("Declare Module <:" "dmi2" "Declare Module # <: #.\n#\nEnd #." t)
("Definition goal" "defg" "Definition #:#.\n#\nDefined." t);; careful
("Fact" "fct" "Fact # : #." t "Fact")
("Goal" nil "Goal #." t "Goal")
("Instance goal" "instg" "Instance #:#.\n#\nDefined." t);; careful
("Lemma" "l" "Lemma # : #.\nProof.\n#\nQed." t "Lemma")
("Program Lemma" "pl" "Program Lemma # : #.\nProof.\n#\nQed." t "Program\\s-+Lemma")
("Proposition" "pr" "Proposition # : #.\nProof.\n#\nQed." t "Proposition")
("Module! (interactive)" nil "Module # : #.\n#\nEnd #." nil nil coq-insert-section-or-module)
("Module Type" "mti" "Module Type #.\n#\nEnd #." t "Module\\s-+Type") ; careful
("Module :" "moi" "Module # : #.\n#\nEnd #." t "Module") ; careful
("Module <:" "moi2" "Module # <: #.\n#\nEnd #." t ) ; careful
("Remark" "rk" "Remark # : #.\n#\nQed." t "Remark")
("Section" "sec" "Section #." t "Section")
("Theorem" "th" "Theorem # : #.\n#\nQed." t "Theorem")
("Program Theorem" "pth" "Program Theorem # : #.\nProof.\n#\nQed." t "Program\\s-+Theorem")
("Obligation" "obl" "Obligation #.\n#\nQed." t "Obligation")
("Obligations" "obls" "Obligations #.\n#\nQed." nil "Obligations")
("Next Obligation" "nobl" "Next Obligation.\n#\nQed." t "Next Obligation")
)
"Coq goal starters keywords information list. See `coq-syntax-db' for syntax."
)
;; TODO: dig other queries from the refman.
;; Extraction command may go here
;; all Print, Show and Test stuff
;; Some of the Set/Unset (like Set Printing All, Set Extraction Inline etc)
(defvar coq-queries-commands-db
'(
("About" nil "About #." nil "About")
("Check" nil "Check" nil "Check")
("Compute" nil "Compute" nil "Compute")
("Fail" nil "Fail" nil "fail")
("Inspect" nil "Inspect #." nil "Inspect")
("Locate File" nil "Locate File \"#\"." nil "Locate\\s-+File")
("Locate Library" nil "Locate Library #." nil "Locate\\s-+Library")
("Locate Notation" nil "Locate Notation (#) #" nil "Locate\\s-+Notation")
("Locate" nil "Locate" nil "Locate")
("Print Coercions" nil "Print Coercions." nil "Print\\s-+Coercions")
("Print Hint" nil "Print Hint." nil "Print\\s-+Hint" coq-PrintHint)
("Print Ltac2" "lt2p" "Print Ltac2 #." nil "Print Ltac2")
("Print" "p" "Print #." nil "Print")
("Pwd" nil "Pwd." nil "Pwd")
("Search" nil "Search #" nil "Search")
("SearchPattern" nil "SearchPattern (#)" nil "SearchPattern")
("SearchRewrite" nil "SearchRewrite #" nil "SearchRewrite")
("Show" nil "Show #." nil "Show")
("Test" nil "Test" nil "Test" nil t) ; let us not highlight all possible options for Test
("Timeout" nil "Timeout" nil "Timeout")
)
"Coq queries command.
They deserve a separate menu for sending them to Coq without insertion.")
;; command that are not declarations, definition or goal starters
(defvar coq-other-commands-db
'(
("Add Parametric Relation" nil "Add Parametric Relation : " t "Add\\s-+Parametric\\s-+Relation")
;; ("Abort" nil "Abort." t "Abort" nil nil);don't appear in menu
;; ("Add" nil "Add #." nil "Add" nil t)
("Add Abstract Ring" nil "Add Abstract Ring #." t "Add\\s-+Abstract\\s-+Ring")
("Add Abstract Semi Ring" nil "Add Abstract Semi Ring #." t "Add\\s-+Abstract\\s-+Semi\\s-+Ring")
("Add Field" nil "Add Field #." t "Add\\s-+Field")
("Add LoadPath" nil "Add LoadPath #." nil "Add\\s-+LoadPath")
("Add ML Path" nil "Add ML Path #." nil "Add\\s-+ML\\s-+Path")
("Add Printing" nil "Add Printing #." t "Add\\s-+Printing")
("Add Printing If" nil "Add Printing If #." t "Add\\s-+Printing\\s-+If")
("Add Printing Let" nil "Add Printing Let #." t "Add\\s-+Printing\\s-+Let")
("Add Rec LoadPath" nil "Add Rec LoadPath #." nil "Add\\s-+Rec\\s-+LoadPath")
("Add Rec ML Path" nil "Add Rec ML Path #." nil "Add\\s-+Rec\\s-+ML\\s-+Path")
("Add Ring" nil "Add Ring #." t "Add\\s-+Ring")
("Add Semi Ring" nil "Add Semi Ring #." t "Add\\s-+Semi\\s-+Ring")
("Add Setoid" nil "Add Setoid #." t "Add\\s-+Setoid")
("Admit Obligations" "oblsadmit" "Admit Obligations." nil "Admit\\s-+Obligations")
("Arguments Scope" "argsc" "Arguments Scope @{id} [ @{_} ]" t "Arguments\\s-+Scope")
("Local Arguments" nil "Local Arguments @{id} : @{rule}" t "Local\\s-+Arguments")
("Arguments" "args" "Arguments @{id} : @{rule}" t "Arguments")
("Bind Scope" "bndsc" "Bind Scope @{scope} with @{type}" t "Bind\\s-+Scope")
("Canonical" nil "Canonical #." t "Canonical")
("Cd" nil "Cd #." nil "Cd")
("Local Close Scope" "lclsc" "Local Close Scope #" t "Local\\s-+Close\\s-+Scope")
("Close Scope" "clsc" "Close Scope #" t "Close\\s-+Scope")
("Comments" nil "Comments #." nil "Comments")
("Declare" nil "Declare #." nil "Declare")
("Delimit Scope" "delsc" "Delimit Scope @{scope} with @{id}." t "Delimit\\s-+Scope" )
("Eval" nil "Eval #." nil "Eval")
("Export" nil "Export #." t "Export")
("Extract Constant" "extrc" "Extract Constant @{id} => \"@{id}\"." nil "Extract\\s-+Constant")
("Extract Inlined Constant" "extric" "Extract Inlined Constant @{id} => \"@{id}\"." nil "Extract\\s-+Inlined\\s-+Constant")
("Extract Inductive" "extri" "Extract Inductive @{id} => \"@{id}\" [\"@{id}\" \"@{id...}\"]." nil "Extract")
("Extraction (in a file)" "extrf" "Extraction \"@{file}\" @{id}." nil)
("Extraction Inline" nil "Extraction Inline #." t "Extraction\\s-+Inline")
("Extraction NoInline" nil "Extraction NoInline #." t "Extraction\\s-+NoInline")
("Extraction Language" "extrlang" "Extraction Language #." t "Extraction\\s-+Language")
("Extraction Library" "extrl" "Extraction Library @{id}." nil "Extraction\\s-+Library")
("Extraction" "extr" "Extraction @{id}." nil "Extraction")
("Focus" nil "Focus #." nil "Focus")
("From" nil "From #." nil "From")
("Generalizable Variables" nil "Generalizable Variables #." t "Generalizable\\s-+Variables")
("Generalizable All Variables" nil "Generalizable All Variables." t "Generalizable\\s-+All\\s-+Variables")
("Identity Coercion" nil "Identity Coercion #." t "Identity\\s-+Coercion")
("Implicit Arguments Off" nil "Implicit Arguments Off." t "Implicit\\s-+Arguments\\s-+Off")
("Implicit Arguments On" nil "Implicit Arguments On." t "Implicit\\s-+Arguments\\s-+On")
("Implicit Arguments" nil "Implicit Arguments # [#]." t "Implicit\\s-+Arguments")
("Implicit Types" nil "Implicit Types # : #." t "Implicit\\s-+Types")
("Implicit Type" nil "Implicit Type # : #." t "Implicit\\s-+Type")
("Import" nil "Import #." t "Import")
("Include" nil "Include #." t "Include")
("Infix" "inf" "Infix \"#\" := # (at level #) : @{scope}." t "Infix")
("Ltac2 Notation" "lt2n" "Ltac2 Notation # := #." t "Ltac2 Notation")
("Ltac2 Eval" "lt2e" "Ltac2 Eval #." nil "Ltac2 Eval")
("Notation (assoc)" "notas" "Notation \"#\" := # (at level #, # associativity)." t)
("Notation (at assoc)" "notassc" "Notation \"#\" := # (at level #, # associativity) : @{scope}." t)
("Notation (at at scope)" "notasc" "Notation \"#\" := # (at level #, # at level #) : @{scope}." t)
("Notation (at at)" "nota" "Notation \"#\" := # (at level #, # at level #)." t)
("Notation (only parsing)" "notsp" "Notation # := # (only parsing)." t)
("Local Notation" "lnots" "Local Notation # := #." t "Local\\s-+Notation")
("Local Notation (only parsing)" "lnotsp" "Local Notation # := # (only parsing)." t)
("Notation (simple)" "nots" "Notation # := #." t "Notation")
("Typeclasses Opaque" nil "Typeclasses Opaque #." nil "Typeclasses\\s-+Opaque")
("Opaque" nil "Opaque #." nil "Opaque")
("Obligation Tactic" nil "Obligation Tactic := #." t "Obligation\\s-+Tactic")
("Local Open Scope" nil "Local Open Scope #" t "Local\\s-+Open\\s-+Scope")
("Open Local Scope" nil "Open Local Scope #" t "Open\\s-+Local\\s-+Scope")
("Open Scope" "opsc" "Open Scope #" t "Open\\s-+Scope")
("Preterm" nil "Preterm." nil "Preterm")
("Qed" nil "Qed." nil "Qed")
("Recursive Extraction" "recextr" "Recursive Extraction @{id}." nil "Recursive\\s-+Extraction")
("Recursive Extraction Library" "recextrl" "Recursive Extraction Library @{id}." nil "Recursive\\s-+Extraction\\s-+Library")
("Recursive Extraction Module" "recextrm" "Recursive Extraction Module @{id}." nil "Recursive\\s-+Extraction\\s-+Module")
("Remove Hints" nil "Remove Hints #: #." nil "Remove\\s-+Hints")
("Remove LoadPath" nil "Remove LoadPath" nil "Remove\\s-+LoadPath")
("Remove LoadPath" nil "Remove LoadPath" nil "Remove\\s-+LoadPath")
("Remove Printing If" nil "Remove Printing If #." t "Remove\\s-+Printing\\s-+If")
("Remove Printing Let" nil "Remove Printing Let #." t "Remove\\s-+Printing\\s-+Let")
("Require Export" nil "Require Export #." t "Require\\s-+Export")
("Require Import" nil "Require Import #." t "Require\\s-+Import")
("Require" nil "Require #." t "Require")
("Reserved Infix" nil "Reserved Infix" nil "Reserved\\s-+Infix")
("Reserved Notation" nil "Reserved Notation" nil "Reserved\\s-+Notation")
("Reset Extraction Inline" nil "Reset Extraction Inline." t "Reset\\s-+Extraction\\s-+Inline")
("Save" nil "Save." t "Save")
("Set Asymmetric Patterns" nil "Set Asymmetric Patterns" t "Set Asymmetric\\s-+Patterns")
("Set Atomic Load" nil "Set Atomic Load" t "Set Atomic\\s-+Load")
("Set Automatic Coercions Import" nil "Set Automatic Coercions Import" t "Set Automatic\\s-+Coercions\\s-+Import")
("Set Automatic Introduction" nil "Set Automatic Introduction" t "Set Automatic\\s-+Introduction")
("Set Boolean Equality Schemes" nil "Set Boolean Equality Schemes" t "Set Boolean\\s-+Equality\\s-+Schemes")
("Set Bracketing Last Introduction Pattern" nil "Set Bracketing Last Introduction Pattern" t "Set Bracketing\\s-+Last\\s-+Introduction\\s-+Pattern")
("Set Bullet Behavior" nil "Set Bullet Behavior" t "Set Bullet\\s-+Behavior")
("Set Case Analysis Schemes" nil "Set Case Analysis Schemes" t "Set Case\\s-+Analysis\\s-+Schemes")
("Set Compat Notations" nil "Set Compat Notations" t "Set Compat\\s-+Notations")
("Set Congruence Depth" nil "Set Congruence Depth" t "Set Congruence\\s-+Depth")
("Set Congruence Verbose" nil "Set Congruence Verbose" t "Set Congruence\\s-+Verbose")
("Set Contextual Implicit" nil "Set Contextual Implicit" t "Set Contextual\\s-+Implicit")
("Set Debug Auto" nil "Set Debug Auto" t "Set Debug\\s-+Auto")
("Set Debug Eauto" nil "Set Debug Eauto" t "Set Debug\\s-+Eauto")
("Set Debug RAKAM" nil "Set Debug RAKAM" t "Set Debug\\s-+RAKAM")
("Set Debug Tactic Unification" nil "Set Debug Tactic Unification" t "Set Debug\\s-+Tactic\\s-+Unification")
("Set Debug Trivial" nil "Set Debug Trivial" t "Set Debug\\s-+Trivial")
("Set Debug Unification" nil "Set Debug Unification" t "Set Debug\\s-+Unification")
("Set Decidable Equality Schemes" nil "Set Decidable Equality Schemes" t "Set Decidable\\s-+Equality\\s-+Schemes")
("Set Default Clearing Used Hypotheses" nil "Set Default Clearing Used Hypotheses" t "Set Default\\s-+Clearing\\s-+Used\\s-+Hypotheses")
("Set Default Goal Selector" nil "Set Default Goal Selector" t "Set Default\\s-+Goal\\s-+Selector")
("Set Default Proof Mode" nil "Set Default Proof Mode" t "Set Default\\s-+Proof\\s-+Mode")
("Set Default Proof Using" nil "Set Default Proof Using" t "Set Default\\s-+Proof\\s-+Using")
("Set Default Timeout" nil "Set Default Timeout" t "Set Default\\s-+Timeout")
("Set Dependent Propositions Elimination" nil "Set Dependent Propositions Elimination" t "Set Dependent\\s-+Propositions\\s-+Elimination")
("Set Discriminate Introduction" nil "Set Discriminate Introduction" t "Set Discriminate\\s-+Introduction")
("Set Dump Bytecode" nil "Set Dump Bytecode" t "Set Dump\\s-+Bytecode")
("Set Elimination Schemes" nil "Set Elimination Schemes" t "Set Elimination\\s-+Schemes")
("Set Equality Scheme" nil "Set Equality Scheme" t "Set Equality\\s-+Scheme")
("Set Extraction AccessOpaque" nil "Set Extraction AccessOpaque" t "Set Extraction\\s-+AccessOpaque")
("Set Extraction AutoInline" nil "Set Extraction AutoInline" t "Set Extraction\\s-+AutoInline")
("Set Extraction Conservative Types" nil "Set Extraction Conservative Types" t "Set Extraction\\s-+Conservative\\s-+Types")
("Set Extraction File Comment" nil "Set Extraction File Comment" t "Set Extraction\\s-+File\\s-+Comment")
("Set Extraction Flag" nil "Set Extraction Flag" t "Set Extraction\\s-+Flag")
("Set Extraction KeepSingleton" nil "Set Extraction KeepSingleton" t "Set Extraction\\s-+KeepSingleton")
("Set Extraction Optimize" nil "Set Extraction Optimize" t "Set Extraction\\s-+Optimize")
("Set Extraction SafeImplicits" nil "Set Extraction SafeImplicits" t "Set Extraction\\s-+SafeImplicits")
("Set Extraction TypeExpand" nil "Set Extraction TypeExpand" t "Set Extraction\\s-+TypeExpand")
("Set Firstorder Depth" nil "Set Firstorder Depth" t "Set Firstorder\\s-+Depth")
("Set Hide Obligations" nil "Set Hide Obligations" t "Set Hide\\s-+Obligations")
("Set Implicit Arguments" nil "Set Implicit Arguments" t "Set Implicit\\s-+Arguments")
("Set Info Auto" nil "Set Info Auto" t "Set Info\\s-+Auto")
("Set Info Eauto" nil "Set Info Eauto" t "Set Info\\s-+Eauto")
("Set Info Level" nil "Set Info Level" t "Set Info\\s-+Level")
("Set Info Trivial" nil "Set Info Trivial" t "Set Info\\s-+Trivial")
("Set Injection L2R Pattern Order" nil "Set Injection L2R Pattern Order" t "Set Injection\\s-+L2R\\s-+Pattern\\s-+Order")
("Set Injection On Proofs" nil "Set Injection On Proofs" t "Set Injection\\s-+On\\s-+Proofs")
("Set Inline Level" nil "Set Inline Level" t "Set Inline\\s-+Level")
("Set Intuition Iff Unfolding" nil "Set Intuition Iff Unfolding" t "Set Intuition\\s-+Iff\\s-+Unfolding")
("Set Intuition Negation Unfolding" nil "Set Intuition Negation Unfolding" t "Set Intuition\\s-+Negation\\s-+Unfolding")
("Set Kernel Term Sharing" nil "Set Kernel Term Sharing" t "Set Kernel\\s-+Term\\s-+Sharing")
("Set Keyed Unification" nil "Set Keyed Unification" t "Set Keyed\\s-+Unification")
("Set Loose Hint Behavior" nil "Set Loose Hint Behavior" t "Set Loose\\s-+Hint\\s-+Behavior")
("Set Maximal Implicit Insertion" nil "Set Maximal Implicit Insertion" t "Set Maximal\\s-+Implicit\\s-+Insertion")
("Set Nonrecursive Elimination Schemes" nil "Set Nonrecursive Elimination Schemes" t "Set Nonrecursive\\s-+Elimination\\s-+Schemes")
("Set Parsing Explicit" nil "Set Parsing Explicit" t "Set Parsing\\s-+Explicit")
("Set Primitive Projections" nil "Set Primitive Projections" t "Set Primitive\\s-+Projections")
("Set Printing All" nil "Set Printing All" t "Set\\s-+Printing\\s-+All")
("Set Printing Coercions" nil "Set Printing Coercions" t "Set\\s-+Printing\\s-+Coercions")
("Set Printing Compact Contexts" nil "set Printing Compact Contexts" t "set\\s-+Printing\\s-+Compact\\s-+Contexts")
("Set Printing Depth" nil "Set Printing Depth" t "Set\\s-+Printing\\s-+Depth")
("Set Printing Existential Instances" nil "Set Printing Existential Instances" t "Set\\s-+Printing\\s-+Existential\\s-+Instances")
("Set Printing Goal Tags" nil "Set Printing Goal Tags" t "Set\\s-+Printing\\s-+Goal\\s-+Tags")
("Set Printing Goal Names" nil "Set Printing Goal Names" t "Set\\s-+Printing\\s-+Goal\\s-+Names")
("Set Printing Implicit" nil "Set Printing Implicit" t "Set\\s-+Printing\\s-+Implicit")
("Set Printing Implicit Defensive" nil "Set Printing Implicit Defensive" t "Set\\s-+Printing\\s-+Implicit\\s-+Defensive")
("Set Printing Matching" nil "Set Printing Matching" t "Set\\s-+Printing\\s-+Matching")
("Set Printing Notations" nil "Set Printing Notations" t "Set\\s-+Printing\\s-+Notations")
("Set Printing Primitive Projection Compatibility" nil "Set Printing Primitive Projection Compatibility" t "Set\\s-+Printing\\s-+Primitive\\s-+Projection\\s-+Compatibility")
("Set Printing Primitive Projection Parameters" nil "Set Printing Primitive Projection Parameters" t "Set\\s-+Printing\\s-+Primitive\\s-+Projection\\s-+Parameters")
("Set Printing Projections" nil "Set Printing Projections" t "Set\\s-+Printing\\s-+Projections")
("Set Printing Records" nil "Set Printing Records" t "Set\\s-+Printing\\s-+Records")
("Set Printing Synth" nil "Set Printing Synth" t "Set\\s-+Printing\\s-+Synth")
("Set Printing Unfocused" nil "Set Printing Unfocused" t "Set\\s-+Printing\\s-+Unfocused")
("Set Printing Universes" nil "Set Printing Universes" t "Set\\s-+Printing\\s-+Universes")
("Set Printing Width" nil "Set Printing Width" t "Set\\s-+Printing\\s-+Width")
("Set Printing Wildcard" nil "Set Printing Wildcard" t "Set\\s-+Printing\\s-+Wildcard")
("Set Program Mode" nil "Set Program Mode" t "Set Program\\s-+Mode")
("Set Proof Using Clear Unused" nil "Set Proof Using Clear Unused" t "Set Proof\\s-+Using\\s-+Clear\\s-+Unused")
("Set Record Elimination Schemes" nil "Set Record Elimination Schemes" t "Set Record\\s-+Elimination\\s-+Schemes")
("Set Refine Instance Mode" nil "Set Refine Instance Mode" t "Set Refine\\s-+Instance\\s-+Mode")
("Set Regular Subst Tactic" nil "Set Regular Subst Tactic" t "Set Regular\\s-+Subst\\s-+Tactic")
("Set Reversible Pattern Implicit" nil "Set Reversible Pattern Implicit" t "Set Reversible\\s-+Pattern\\s-+Implicit")
("Set Rewriting Schemes" nil "Set Rewriting Schemes" t "Set Rewriting\\s-+Schemes")
("Set Short Module Printing" nil "Set Short Module Printing" t "Set Short\\s-+Module\\s-+Printing")
("Set Shrink Obligations" nil "Set Shrink Obligations" t "Set Shrink\\s-+Obligations")
("Set SimplIsCbn" nil "Set SimplIsCbn" t "Set SimplIsCbn")
("Set Standard Proposition Elimination Names" nil "Set Standard Proposition Elimination Names" t "Set Standard\\s-+Proposition\\s-+Elimination\\s-+Names")
("Set Strict Proofs" nil "Set Strict Proofs" t "Set Strict\\s-+Proofs")
("Set Strict Universe Declaration" nil "Set Strict Universe Declaration" t "Set Strict\\s-+Universe\\s-+Declaration")
("Set Strongly Strict Implicit" nil "Set Strongly Strict Implicit" t "Set Strongly\\s-+Strict\\s-+Implicit")
("Set Suggest Proof Using" nil "Set Suggest Proof Using" t "Set Suggest\\s-+Proof\\s-+Using")
("Set Tactic Compat Context" nil "Set Tactic Compat Context" t "Set Tactic\\s-+Compat\\s-+Context")
("Set Tactic Evars Pattern Unification" nil "Set Tactic Evars Pattern Unification" t "Set Tactic\\s-+Evars\\s-+Pattern\\s-+Unification")
("Set Tactic Pattern Unification" nil "Set Tactic Pattern Unification" t "Set Tactic\\s-+Pattern\\s-+Unification")
("Set Transparent Obligations" nil "Set Transparent Obligations" t "Set Transparent\\s-+Obligations")
("Set Typeclass Resolution After Apply" nil "Set Typeclass Resolution After Apply" t "Set Typeclass\\s-+Resolution\\s-+After\\s-+Apply")
("Set Typeclass Resolution For Conversion" nil "Set Typeclass Resolution For Conversion" t "Set Typeclass\\s-+Resolution\\s-+For\\s-+Conversion")
("Set Typeclasses Debug" nil "Set Typeclasses Debug" t "Set Typeclasses\\s-+Debug")
("Set Typeclasses Dependency Order" nil "Set Typeclasses Dependency Order" t "Set Typeclasses\\s-+Dependency\\s-+Order")
("Set Typeclasses Depth" nil "Set Typeclasses Depth" t "Set Typeclasses\\s-+Depth")
("Set Typeclasses Modulo Eta" nil "Set Typeclasses Modulo Eta" t "Set Typeclasses\\s-+Modulo\\s-+Eta")
("Set Typeclasses Strict Resolution" nil "Set Typeclasses Strict Resolution" t "Set Typeclasses\\s-+Strict\\s-+Resolution")
("Set Typeclasses Unique Instances" nil "Set Typeclasses Unique Instances" t "Set Typeclasses\\s-+Unique\\s-+Instances")
("Set Typeclasses Unique Solutions" nil "Set Typeclasses Unique Solutions" t "Set Typeclasses\\s-+Unique\\s-+Solutions")
("Set Universal Lemma Under Conjunction" nil "Set Universal Lemma Under Conjunction" t "Set Universal\\s-+Lemma\\s-+Under\\s-+Conjunction")
("Set Universe Minimization ToSet" nil "Set Universe Minimization ToSet" t "Set Universe\\s-+Minimization\\s-+ToSet")
("Set Universe Polymorphism" nil "Set Universe Polymorphism" t "Set Universe\\s-+Polymorphism")
("Set Verbose Compat Notations" nil "Set Verbose Compat Notations" t "Set Verbose\\s-+Compat\\s-+Notations")
("Set Function_debug" nil "Set Function_debug" t "Set Function_debug")
("Set Function_raw_tcc" nil "Set Function_raw_tcc" t "Set Function_raw_tcc")
("Set Functional Induction Rewrite Dependent" nil "Set Functional Induction Rewrite Dependent" t "Set Functional\\s-+Induction\\s-+Rewrite\\s-+Dependent")
("Set Hyps Limit" nil "Set Hyps Limit" t "Set Hyps\\s-+Limit")
("Set Ltac Debug" nil "Set Ltac Debug" t "Set Ltac\\s-+Debug")
("Set Silent" nil "Set Silent" t "Set Silent")
("Set Undo" nil "Set Undo" t "Set Undo")
("Set Search Blacklist" nil "Set Search Blacklist" t "Set Search\\s-+Blacklist")
("Set Printing Coercion" nil "Set Printing Coercion" t "Set\\s-+Printing\\s-+Coercion")
("Set Printing If" nil "Set Printing If" t "Set\\s-+Printing\\s-+If")
("Set Printing Let" nil "Set Printing Let" t "Set\\s-+Printing\\s-+Let")
("Set Printing Record" nil "Set Printing Record" t "Set\\s-+Printing\\s-+Record")
("Set Printing Constructor" nil "Set Printing Constructor" t "Set\\s-+Printing\\s-+Constructor")
("Solve Obligations" "oblssolve" "Solve Obligations using #." t "Solve\\s-+Obligations")
("Local Strategy" nil "Local Strategy # [#]." t "Local\\s-+Strategy")
("Strategy" nil "Strategy # [#]." t "Strategy")
("Tactic Notation" nil "Tactic Notation # := #." t "Tactic\\s-+Notation")
("Transparent" nil "Transparent #." nil "Transparent")
("Unfocus" nil "Unfocus." nil "Unfocus")
("Unset Asymmetric Patterns" nil "Unset Asymmetric Patterns" t "Unset Asymmetric\\s-+Patterns")
("Unset Atomic Load" nil "Unset Atomic Load" t "Unset Atomic\\s-+Load")
("Unset Automatic Coercions Import" nil "Unset Automatic Coercions Import" t "Unset Automatic\\s-+Coercions\\s-+Import")
("Unset Automatic Introduction" nil "Unset Automatic Introduction" t "Unset Automatic\\s-+Introduction")
("Unset Boolean Equality Schemes" nil "Unset Boolean Equality Schemes" t "Unset Boolean\\s-+Equality\\s-+Schemes")
("Unset Bracketing Last Introduction Pattern" nil "Unset Bracketing Last Introduction Pattern" t "Unset Bracketing\\s-+Last\\s-+Introduction\\s-+Pattern")
("Unset Bullet Behavior" nil "Unset Bullet Behavior" t "Unset Bullet\\s-+Behavior")
("Unset Case Analysis Schemes" nil "Unset Case Analysis Schemes" t "Unset Case\\s-+Analysis\\s-+Schemes")
("Unset Compat Notations" nil "Unset Compat Notations" t "Unset Compat\\s-+Notations")
("Unset Congruence Depth" nil "Unset Congruence Depth" t "Unset Congruence\\s-+Depth")
("Unset Congruence Verbose" nil "Unset Congruence Verbose" t "Unset Congruence\\s-+Verbose")
("Unset Contextual Implicit" nil "Unset Contextual Implicit" t "Unset Contextual\\s-+Implicit")
("Unset Debug Auto" nil "Unset Debug Auto" t "Unset Debug\\s-+Auto")
("Unset Debug Eauto" nil "Unset Debug Eauto" t "Unset Debug\\s-+Eauto")
("Unset Debug RAKAM" nil "Unset Debug RAKAM" t "Unset Debug\\s-+RAKAM")
("Unset Debug Tactic Unification" nil "Unset Debug Tactic Unification" t "Unset Debug\\s-+Tactic\\s-+Unification")
("Unset Debug Trivial" nil "Unset Debug Trivial" t "Unset Debug\\s-+Trivial")
("Unset Debug Unification" nil "Unset Debug Unification" t "Unset Debug\\s-+Unification")
("Unset Decidable Equality Schemes" nil "Unset Decidable Equality Schemes" t "Unset Decidable\\s-+Equality\\s-+Schemes")
("Unset Default Clearing Used Hypotheses" nil "Unset Default Clearing Used Hypotheses" t "Unset Default\\s-+Clearing\\s-+Used\\s-+Hypotheses")
("Unset Default Goal Selector" nil "Unset Default Goal Selector" t "Unset Default\\s-+Goal\\s-+Selector")
("Unset Default Proof Mode" nil "Unset Default Proof Mode" t "Unset Default\\s-+Proof\\s-+Mode")
("Unset Default Proof Using" nil "Unset Default Proof Using" t "Unset Default\\s-+Proof\\s-+Using")
("Unset Default Timeout" nil "Unset Default Timeout" t "Unset Default\\s-+Timeout")
("Unset Dependent Propositions Elimination" nil "Unset Dependent Propositions Elimination" t "Unset Dependent\\s-+Propositions\\s-+Elimination")
("Unset Discriminate Introduction" nil "Unset Discriminate Introduction" t "Unset Discriminate\\s-+Introduction")
("Unset Dump Bytecode" nil "Unset Dump Bytecode" t "Unset Dump\\s-+Bytecode")
("Unset Elimination Schemes" nil "Unset Elimination Schemes" t "Unset Elimination\\s-+Schemes")
("Unset Equality Scheme" nil "Unset Equality Scheme" t "Unset Equality\\s-+Scheme")
("Unset Extraction AccessOpaque" nil "Unset Extraction AccessOpaque" t "Unset Extraction\\s-+AccessOpaque")
("Unset Extraction AutoInline" nil "Unset Extraction AutoInline" t "Unset Extraction\\s-+AutoInline")
("Unset Extraction Conservative Types" nil "Unset Extraction Conservative Types" t "Unset Extraction\\s-+Conservative\\s-+Types")
("Unset Extraction File Comment" nil "Unset Extraction File Comment" t "Unset Extraction\\s-+File\\s-+Comment")
("Unset Extraction Flag" nil "Unset Extraction Flag" t "Unset Extraction\\s-+Flag")
("Unset Extraction KeepSingleton" nil "Unset Extraction KeepSingleton" t "Unset Extraction\\s-+KeepSingleton")
("Unset Extraction Optimize" nil "Unset Extraction Optimize" t "Unset Extraction\\s-+Optimize")
("Unset Extraction SafeImplicits" nil "Unset Extraction SafeImplicits" t "Unset Extraction\\s-+SafeImplicits")
("Unset Extraction TypeExpand" nil "Unset Extraction TypeExpand" t "Unset Extraction\\s-+TypeExpand")
("Unset Firstorder Depth" nil "Unset Firstorder Depth" t "Unset Firstorder\\s-+Depth")
("Unset Hide Obligations" nil "Unset Hide Obligations" t "Unset Hide\\s-+Obligations")
("Unset Implicit Arguments" nil "Unset Implicit Arguments" t "Unset Implicit\\s-+Arguments")
("Unset Info Auto" nil "Unset Info Auto" t "Unset Info\\s-+Auto")
("Unset Info Eauto" nil "Unset Info Eauto" t "Unset Info\\s-+Eauto")
("Unset Info Level" nil "Unset Info Level" t "Unset Info\\s-+Level")
("Unset Info Trivial" nil "Unset Info Trivial" t "Unset Info\\s-+Trivial")
("Unset Injection L2R Pattern Order" nil "Unset Injection L2R Pattern Order" t "Unset Injection\\s-+L2R\\s-+Pattern\\s-+Order")
("Unset Injection On Proofs" nil "Unset Injection On Proofs" t "Unset Injection\\s-+On\\s-+Proofs")
("Unset Inline Level" nil "Unset Inline Level" t "Unset Inline\\s-+Level")
("Unset Intuition Iff Unfolding" nil "Unset Intuition Iff Unfolding" t "Unset Intuition\\s-+Iff\\s-+Unfolding")
("Unset Intuition Negation Unfolding" nil "Unset Intuition Negation Unfolding" t "Unset Intuition\\s-+Negation\\s-+Unfolding")
("Unset Kernel Term Sharing" nil "Unset Kernel Term Sharing" t "Unset Kernel\\s-+Term\\s-+Sharing")
("Unset Keyed Unification" nil "Unset Keyed Unification" t "Unset Keyed\\s-+Unification")
("Unset Loose Hint Behavior" nil "Unset Loose Hint Behavior" t "Unset Loose\\s-+Hint\\s-+Behavior")
("Unset Maximal Implicit Insertion" nil "Unset Maximal Implicit Insertion" t "Unset Maximal\\s-+Implicit\\s-+Insertion")
("Unset Nonrecursive Elimination Schemes" nil "Unset Nonrecursive Elimination Schemes" t "Unset Nonrecursive\\s-+Elimination\\s-+Schemes")
("Unset Parsing Explicit" nil "Unset Parsing Explicit" t "Unset Parsing\\s-+Explicit")
("Unset Primitive Projections" nil "Unset Primitive Projections" t "Unset Primitive\\s-+Projections")
("Unset Printing All" nil "Unset Printing All" t "Unset Printing\\s-+All")
("Unset Printing Coercions" nil "Unset Printing Coercions" t "Unset\\s-+Printing\\s-+Coercions")
("Unset Printing Compact Contexts" nil "Unset Printing Compact Contexts" t "Unset\\s-+Printing\\s-+Compact\\s-+Contexts")
("Unset Printing Depth" nil "Unset Printing Depth" t "Unset Printing\\s-+Depth")
("Unset Printing Existential Instances" nil "Unset Printing Existential Instances" t "Unset Printing\\s-+Existential\\s-+Instances")
("Unset Printing Implicit" nil "Unset Printing Implicit" t "Unset Printing\\s-+Implicit")
("Unset Printing Implicit Defensive" nil "Unset Printing Implicit Defensive" t "Unset Printing\\s-+Implicit\\s-+Defensive")
("Unset Printing Matching" nil "Unset Printing Matching" t "Unset Printing\\s-+Matching")
("Unset Printing Notations" nil "Unset Printing Notations" t "Unset Printing\\s-+Notations")
("Unset Printing Primitive Projection Compatibility" nil "Unset Printing Primitive Projection Compatibility" t "Unset Printing\\s-+Primitive\\s-+Projection\\s-+Compatibility")
("Unset Printing Primitive Projection Parameters" nil "Unset Printing Primitive Projection Parameters" t "Unset Printing\\s-+Primitive\\s-+Projection\\s-+Parameters")
("Unset Printing Projections" nil "Unset Printing Projections" t "Unset Printing\\s-+Projections")
("Unset Printing Records" nil "Unset Printing Records" t "Unset Printing\\s-+Records")
("Unset Printing Synth" nil "Unset Printing Synth" t "Unset Printing\\s-+Synth")
("Unset Printing Universes" nil "Unset Printing Universes" t "Unset Printing\\s-+Universes")
("Unset Printing Width" nil "Unset Printing Width" t "Unset Printing\\s-+Width")
("Unset Printing Wildcard" nil "Unset Printing Wildcard" t "Unset Printing\\s-+Wildcard")
("Unset Program Mode" nil "Unset Program Mode" t "Unset Program\\s-+Mode")
("Unset Proof Using Clear Unused" nil "Unset Proof Using Clear Unused" t "Unset Proof\\s-+Using\\s-+Clear\\s-+Unused")
("Unset Record Elimination Schemes" nil "Unset Record Elimination Schemes" t "Unset Record\\s-+Elimination\\s-+Schemes")
("Unset Refine Instance Mode" nil "Unset Refine Instance Mode" t "Unset Refine\\s-+Instance\\s-+Mode")
("Unset Regular Subst Tactic" nil "Unset Regular Subst Tactic" t "Unset Regular\\s-+Subst\\s-+Tactic")
("Unset Reversible Pattern Implicit" nil "Unset Reversible Pattern Implicit" t "Unset Reversible\\s-+Pattern\\s-+Implicit")
("Unset Rewriting Schemes" nil "Unset Rewriting Schemes" t "Unset Rewriting\\s-+Schemes")
("Unset Short Module Printing" nil "Unset Short Module Printing" t "Unset Short\\s-+Module\\s-+Printing")
("Unset Shrink Obligations" nil "Unset Shrink Obligations" t "Unset Shrink\\s-+Obligations")
("Unset SimplIsCbn" nil "Unset SimplIsCbn" t "Unset SimplIsCbn")
("Unset Standard Proposition Elimination Names" nil "Unset Standard Proposition Elimination Names" t "Unset Standard\\s-+Proposition\\s-+Elimination\\s-+Names")
("Unset Strict Proofs" nil "Unset Strict Proofs" t "Unset Strict\\s-+Proofs")
("Unset Strict Universe Declaration" nil "Unset Strict Universe Declaration" t "Unset Strict\\s-+Universe\\s-+Declaration")
("Unset Strongly Strict Implicit" nil "Unset Strongly Strict Implicit" t "Unset Strongly\\s-+Strict\\s-+Implicit")
("Unset Suggest Proof Using" nil "Unset Suggest Proof Using" t "Unset Suggest\\s-+Proof\\s-+Using")
("Unset Tactic Compat Context" nil "Unset Tactic Compat Context" t "Unset Tactic\\s-+Compat\\s-+Context")
("Unset Tactic Evars Pattern Unification" nil "Unset Tactic Evars Pattern Unification" t "Unset Tactic\\s-+Evars\\s-+Pattern\\s-+Unification")
("Unset Tactic Pattern Unification" nil "Unset Tactic Pattern Unification" t "Unset Tactic\\s-+Pattern\\s-+Unification")
("Unset Transparent Obligations" nil "Unset Transparent Obligations" t "Unset Transparent\\s-+Obligations")
("Unset Typeclass Resolution After Apply" nil "Unset Typeclass Resolution After Apply" t "Unset Typeclass\\s-+Resolution\\s-+After\\s-+Apply")
("Unset Typeclass Resolution For Conversion" nil "Unset Typeclass Resolution For Conversion" t "Unset Typeclass\\s-+Resolution\\s-+For\\s-+Conversion")
("Unset Typeclasses Debug" nil "Unset Typeclasses Debug" t "Unset Typeclasses\\s-+Debug")
("Unset Typeclasses Dependency Order" nil "Unset Typeclasses Dependency Order" t "Unset Typeclasses\\s-+Dependency\\s-+Order")
("Unset Typeclasses Depth" nil "Unset Typeclasses Depth" t "Unset Typeclasses\\s-+Depth")
("Unset Typeclasses Modulo Eta" nil "Unset Typeclasses Modulo Eta" t "Unset Typeclasses\\s-+Modulo\\s-+Eta")
("Unset Typeclasses Strict Resolution" nil "Unset Typeclasses Strict Resolution" t "Unset Typeclasses\\s-+Strict\\s-+Resolution")
("Unset Typeclasses Unique Instances" nil "Unset Typeclasses Unique Instances" t "Unset Typeclasses\\s-+Unique\\s-+Instances")
("Unset Typeclasses Unique Solutions" nil "Unset Typeclasses Unique Solutions" t "Unset Typeclasses\\s-+Unique\\s-+Solutions")
("Unset Universal Lemma Under Conjunction" nil "Unset Universal Lemma Under Conjunction" t "Unset Universal\\s-+Lemma\\s-+Under\\s-+Conjunction")
("Unset Universe Minimization ToUnset" nil "Unset Universe Minimization ToUnset" t "Unset Universe\\s-+Minimization\\s-+ToUnset")
("Unset Universe Polymorphism" nil "Unset Universe Polymorphism" t "Unset Universe\\s-+Polymorphism")
("Unset Verbose Compat Notations" nil "Unset Verbose Compat Notations" t "Unset Verbose\\s-+Compat\\s-+Notations")
("Unset Function_debug" nil "Unset Function_debug" t "Unset Function_debug")
("Unset Function_raw_tcc" nil "Unset Function_raw_tcc" t "Unset Function_raw_tcc")
("Unset Functional Induction Rewrite Dependent" nil "Unset Functional Induction Rewrite Dependent" t "Unset Functional\\s-+Induction\\s-+Rewrite\\s-+Dependent")
("Unset Hyps Limit" nil "Unset Hyps Limit" t "Unset Hyps\\s-+Limit")
("Unset Ltac Debug" nil "Unset Ltac Debug" t "Unset Ltac\\s-+Debug")
("Unset Silent" nil "Unset Silent" t "Unset Silent")
("Unset Undo" nil "Unset Undo" t "Unset Undo")
("Unset Search Blacklist" nil "Unset Search Blacklist" t "Unset Search\\s-+Blacklist")
("Unset Printing Coercion" nil "Unset Printing Coercion" t "Unset Printing\\s-+Coercion")
("Unset Printing If" nil "Unset Printing If" t "Unset Printing\\s-+If")
("Unset Printing Let" nil "Unset Printing Let" t "Unset Printing\\s-+Let")
("Unset Printing Record" nil "Unset Printing Record" t "Unset Printing\\s-+Record")
("Unset Printing Constructor" nil "Unset Printing Constructor" t "Unset Printing\\s-+Constructor")
; ("print" "pr" "print #" "print")
)
"Command that are not declarations, definition or goal starters."
)
(defvar coq-ssreflect-commands-db
'(("Unset Strict Implicit" "unsti" nil t "Strict\\s-+Implicit")
("Prenex Implicits" "pi" "Prenex Implicits #" t "Prenex\\s-+Implicits")
("Hint View for" "hv" "Hint View for #" t "Hint\\s-+View\\s-+for")))
(defvar coq-commands-db
(append coq-decl-db coq-defn-db coq-goal-starters-db
coq-queries-commands-db
coq-other-commands-db coq-ssreflect-commands-db coq-user-commands-db)
"Coq all commands keywords information list. See `coq-syntax-db' for syntax."
)
(defvar coq-terms-db
'(
("fun (1 args)" "f" "fun #:# => #" nil "fun")
("fun (2 args)" "f2" "fun (#:#) (#:#) => #")
("fun (3 args)" "f3" "fun (#:#) (#:#) (#:#) => #")
("fun (4 args)" "f4" "fun (#:#) (#:#) (#:#) (#:#) => #")
("forall" "fo" "forall #:#,#" nil "forall")
("forall (2 args)" "fo2" "forall (#:#) (#:#), #")
("forall (3 args)" "fo3" "forall (#:#) (#:#) (#:#), #")
("forall (4 args)" "fo4" "forall (#:#) (#:#) (#:#) (#:#), #")
("if" "if" "if # then # else #" nil "if")
("let in" "li" "let # := # in #" nil "let")
("match?" nil "" nil "match" coq-insert-match)
("match with" "m" "match # with\n| # => #\nend")
("match with 2" "m2" "match # with\n| # => #\n| # => #\nend")
("match with 3" "m3" "match # with\n| # => #\n| # => #\n| # => #\nend")
("match with 4" "m4" "match # with\n| # => #\n| # => #\n| # => #\n| # => #\nend")
("match with 5" "m5" "match # with\n| # => #\n| # => #\n| # => #\n| # => #\n| # => #\nend")
)
"Coq terms keywords information list. See `coq-syntax-db' for syntax."
)
;;; Goals (and module/sections) starters detection
;; FIXME da: this one function breaks the nice configuration of Proof General:
;; would like to have proof-goal-regexp instead.
;; Unfortunately Coq allows "Definition" and friends to perhaps have a goal,
;; so it appears more difficult than just a proof-goal-regexp setting.
;; Future improvement may simply to be allow a function value for
;; proof-goal-regexp.
;; FIXME Pierre: the right way IMHO here would be to set a span
;; property 'goalcommand when coq prompt says it (if the name of
;; current proof has changed).
;; excerpt of Jacek Chrzaszcz, implementer of the module system: sorry
;; for the french:
;;*) suivant les suggestions de Chritine, pas de mode preuve dans un type de
;; module (donc pas de Definition truc:machin. Lemma, Theorem ... )
;;
;; *) la commande Module M [ ( : | <: ) MTYP ] [ := MEXPR ] est valable
;; uniquement hors d'un MT
;; - si :=MEXPR est absent, elle demarre un nouveau module interactif
;; - si :=MEXPR est present, elle definit un module
;; (la fonction vernac_define_module dans toplevel/vernacentries)
;;
;; *) la nouvelle commande Declare Module M [ ( : | <: ) MTYP ] [ := MEXPR ]
;; est valable uniquement dans un MT
;; - si :=MEXPR absent, :MTYP absent, elle demarre un nouveau module
;; interactif
;; - si (:=MEXPR absent, :MTYP present)
;; ou (:=MEXPR present, :MTYP absent)
;; elle declare un module.
;; (la fonction vernac_declare_module dans toplevel/vernacentries)
(defun coq-count-match (regexp str)
"Count the number of max. non-overlapping substring of STR matching REGEXP.
Empty matches are counted once."
(let ((nbmatch 0) (pos 0) (end (length str))
(case-fold-search nil))
(while (and (< pos end)
(string-match regexp str pos))
(cl-incf nbmatch)
(setq pos (max (match-end 0) (1+ pos))))
nbmatch))
;; Module and or section openings are detected syntactically. Module
;; *openings* are difficult to detect because there can be Module
;; ...with X := ... . So we need to count :='s to detect real openings.
;; TODO: have opened section/chapter in the prompt too, and get rid of
;; syntactical tests everywhere
(defun coq-module-opening-p (str)
"Decide whether STR is a module or section opening or not.
Used by `coq-goal-command-p'"
(let* ((match (coq-count-match "\\_<match\\_>" str))
(with (coq-count-match "\\_<with\\_>" str))
(letwith (+ (coq-count-match "\\_<let\\_>" str) (- with match)))
(affect (coq-count-match ":=" str))
(case-fold-search nil))
(and (string-match "\\`\\(Module\\)\\_>" str)
(= letwith affect))))
(defun coq-section-command-p (str)
(let ((case-fold-search nil))
(string-match "\\`\\(Section\\|Chapter\\)\\_>" str)))
(defvar coq-goal-command-regexp)
;; unused anymore (for good)
(defun coq-goal-command-str-p (str)
"Decide syntactically whether STR is a goal start or not.
Use ‘coq-goal-command-p’ on a span instead if possible."
(let* ((match (coq-count-match "\\_<match\\_>" str))
(with (- (coq-count-match "\\_<with\\_>" str) (coq-count-match "\\_<with\\s-+signature\\_>" str)))
(letwith (+ (coq-count-match "\\_<let\\_>" str) (- with match)))
(affect (coq-count-match ":=" str))
(case-fold-search nil))
(and (string-match coq-goal-command-regexp str)
(not
(and
(string-match
(concat "\\`\\(Local\\|Definition\\|Lemma\\|Theorem\\|Fact\\|Add\\|Let\\|Program\\|Module\\|Class\\|Instance\\)\\_>")
str)
(not (= letwith affect))))
(not (string-match "\\`Declare\\s-+Module\\(\\w\\|\\s-\\|<\\)*:"
str)))))
;; This is the function that tests if a SPAN is a goal start. All it
;; has to do is look at the 'goalcmd attribute of the span.
;; It also looks if this is not a module start.
;; TODO: have also attributes 'modulecmd and 'sectioncmd. This needs
;; something in the coq prompt telling the name of all opened modules
;; (like for open goals), and use it to set goalcmd --> no more need
;; to look at Modules and section (actually indentation will still
;; need it)
(defun coq-goal-command-p (span)
(or (overlay-get span 'goalcmd)
;; module and section starts are detected here
(let ((str (or (overlay-get span 'cmd) "")))
(or (coq-section-command-p str)
(coq-module-opening-p str)))))
;; TODO: rely on coq response nistead for span grouping Or better have
;; coq change its syntax for something better.
(defvar coq-keywords-save-strict
'("Defined" "Save" "Qed" "End" "Admitted" "Abort" )
"This regexp must match *exactly* commands that close a goal/Module.
It is used:
1) for grouping spans into one when scripting
2) for indentation.")
(defvar coq-keywords-save
(append coq-keywords-save-strict '("Proof"))
)
;; According to Coq, "Definition" is both a declaration and a goal.
;; It is understood here as being a goal. This is important for
;; recognizing global identifiers, see coq-global-p.
(defconst coq-save-command-regexp-strict
(concat "\\`\\(?:Time\\s-+\\|Timeout\\s-+[[:digit:]]+\\s-+\\)*\\("
"\\_<"
(regexp-opt coq-keywords-save-strict)
"\\_>"
"\\)"))
(defun coq-save-command-p (_span str)
"Decide whether argument is a Save command or not."
(let ((case-fold-search nil))
(or (string-match coq-save-command-regexp-strict str)
(and (string-match "\\`Proof\\_>" str)
(not (string-match "\\`Proof\\s-*\\(\\.\\|\\_<with\\_>\\|\\_<using\\_>\\)" str))))))
;; ----- regular expressions for the proof omit feature
;; see `proof-omit-proofs-configured' in generic/proof-config
(defcustom coq-proof-start-regexp "^Proof\\(\\.\\| \\)"
"Value for `proof-script-proof-start-regexp'."
:type 'regexp
:group 'coq)
(defcustom coq-proof-end-regexp "^\\(Qed\\|Admitted\\)\\."
"Value for `proof-script-proof-end-regexp'.
This is similar to `coq-save-command-regexp-strict' but slightly
different."
:type 'regexp
:group 'coq)
(defcustom coq-definition-end-regexp "^\\(Defined\\|Abort\\)\\(\\.\\| \\)"
"Value for `proof-script-definition-end-regexp'."
:type 'regexp
:group 'coq)
(defcustom coq-omit-proof-admit-command "Admitted."
"Value for `proof-script-proof-admit-command'."
:type 'string
:group 'coq)
;; ----- keywords for font-lock.
(defvar coq-keywords-kill-goal
'("Abort"))
;; Following regexps are all state changing
(defvar coq-keywords-state-changing-misc-commands
(coq-build-regexp-list-from-db coq-commands-db 'filter-state-changing))
(defvar coq-keywords-goal
(coq-build-regexp-list-from-db coq-goal-starters-db))
(defvar coq-keywords-decl
(coq-build-regexp-list-from-db coq-decl-db))
(defvar coq-keywords-defn
(coq-build-regexp-list-from-db coq-defn-db))
(defvar coq-keywords-state-changing-commands
(append
coq-keywords-state-changing-misc-commands
coq-keywords-decl ; all state changing
coq-keywords-defn ; idem
coq-keywords-goal)) ; idem
;;
(defvar coq-keywords-state-preserving-commands
(coq-build-regexp-list-from-db coq-commands-db 'filter-state-preserving))
;; concat this is faster that redoing coq-build-regexp-list-from-db on
;; whole commands-db
(defvar coq-keywords-commands
(append coq-keywords-state-changing-commands
coq-keywords-state-preserving-commands)
"All commands keyword.")
(defvar coq-solve-tactics
(coq-build-regexp-list-from-db coq-solve-tactics-db)
"Keywords for closing tactic(al)s.")
(defvar coq-solve-tactics-regexp
(coq-build-opt-regexp-from-db coq-solve-tactics-db)
"Keywords regexp for closing tactic(al)s.")
(defvar coq-solve-cheat-tactics
(coq-build-regexp-list-from-db coq-solve-cheat-tactics-db)
"Keywords for closing by cheating tactic(al)s.")
(defvar coq-solve-cheat-tactics-regexp
(coq-build-opt-regexp-from-db coq-solve-cheat-tactics-db)
"Keywords regexp for closing by cheating tactic(al)s.")
(defvar coq-tacticals
(coq-build-regexp-list-from-db coq-tacticals-db)
"Keywords for tacticals in a Coq script.")
(defvar coq-symbol-binders "∀\\|∃\\|λ")
;; From JF Monin:
(defvar coq-reserved
(append
'(
"False" "True" "after" "as" "cofix" "fix" "forall" "fun" "match"
"lazymatch" "multimatch" "lazy_match" "multi_match"
"return" "struct" "else" "end" "if" "in" "into" "let" "then"
"using" "with" "beta" "delta" "iota" "zeta" "after" "until"
"at" "Sort" "Time" "dest" "where"
;; SSReflect user reserved.
"is" "nosimpl" "of"
;; Derive reserved
"SuchThat" "As" ;; I don't like these two: they start with
;; capitals but they are not at beginning of a
;; sentence
)
coq-user-reserved-db)
"Reserved keywords of Coq.")
;; FIXME: ∀ and ∃ should be followed by a space in coq syntax.
;; FIXME: actually these are not exactly reserved keywords, find
;; another classification of keywords.
(defvar coq-reserved-regexp
(concat "\\_<"
"\\(?:with\\s-+signature\\|"
(regexp-opt coq-reserved) "\\)"
"\\_>"))
(defvar coq-state-changing-tactics
(coq-build-regexp-list-from-db coq-tactics-db 'filter-state-changing))
(defvar coq-state-preserving-tactics
(coq-build-regexp-list-from-db coq-tactics-db 'filter-state-preserving))
(defvar coq-tactics
(append coq-state-changing-tactics coq-state-preserving-tactics))
(defvar coq-tactics-regexp (coq-build-opt-regexp-from-db coq-tactics-db))
;(defvar coq-tactics-regexp-symb (coq-build-opt-regexp-from-db coq-tactics-db))
(defvar coq-retractable-instruct
(append coq-state-changing-tactics coq-keywords-state-changing-commands))
(defvar coq-non-retractable-instruct
(append coq-state-preserving-tactics
coq-keywords-state-preserving-commands))
(defvar coq-keywords
(append coq-keywords-goal coq-keywords-save coq-keywords-decl
coq-keywords-defn coq-keywords-commands)
"All keywords in a Coq script.")
;; coq-build-opt-regexp-from-db already adds "\\_<" "\\_>"
(defun coq--regexp-alt-list-symb (args)
(concat "\\_<\\(?:" (mapconcat #'identity args "\\|") "\\)\\_>"))
(defun coq--regexp-alt-list (args)
(concat "\\(?:" (mapconcat #'identity args "\\|") "\\)"))
(defvar coq-keywords-regexp (coq--regexp-alt-list-symb coq-keywords))
(defvar coq-symbols
'("|"
"||"
":"
";"
","
"("
")"
"["
"]"
"{"
"}"
":="
"=>"
"==>"
"++>"
"@"
"->"
"."
"∧"
"∨"
"→"
"\\/"
"/\\"
"->")
"Punctuation Symbols used by Coq.")
(defvar coq-symbols-regexp (regexp-opt coq-symbols))
;; HACKISH: This string matches standard error regexp UNLESS there is
;; the standard header of the "Fail" command (which is "The command
;; blah has indeed failed with message:\n"). The case where the error
;; header has nothing before it is treated using "empty string at
;; start" regexp. BUT coq-error-regexp (and hence
;; proof-shell-error-regexp) must be correct either when searching in
;; a string or when searching in the proof-shell-buffer when point is
;; at the start of the last output. Hence when we use \\` (empty
;; string at start of the string) we should also accept \\= (empty
;; string at point).
(defvar coq--prefix-not-regexp "\\(\\(\\`\\|\\=\\)\n?\\)\\|\\(?:\\(?:[^:]\\|[^e]:\\|[^g]e:\\|[^a]ge:\\|[^s]age:\\|[^s]sage:\\|[^e]ssage:\\|[^m]essage:\\)\n\\)"
"A regexp matching allowed text before coq error.")
(defvar coq--error-header-re-list
'("In nested Ltac call"
"Discarding pattern"
"Syntax error:"
"System Error:"
"User Error:"
"User error:"
"Anomaly[:.]"
"Toplevel input"
"\\<Error:")
"A list of regexps matching coq error headers.")
(defvar coq--raw-error-regexp (coq--regexp-alt-list coq--error-header-re-list))
;; ----- regular expressions
;; ignore "Error:" if preceded by \n[ ^]+\n
(defvar coq-error-regexp
(concat "\\(?:" coq--prefix-not-regexp "\\)" coq--raw-error-regexp)
"A regexp indicating that the Coq process has identified an error.")
;; april2017: coq-8.7 removes special chars definitely and puts
;; <infomsg> and <warning> around all messages except errors.
;; We let our legacy regexp for some years and remove them, say, in 2020.
(defvar coq-shell-eager-annotation-start
"\376\\|\\[Reinterning\\|Warning:\\|TcDebug \\|<infomsg>\\|<warning>")
(defvar coq-shell-eager-annotation-end
"\377\\|done\\]\\|</infomsg>\\|</warning>\\|\\*\\*\\*\\*\\*\\*\\|) >")
(defvar coq-id "\\(@\\|_\\|\\w\\)\\(\\w\\|\\s_\\)*") ;; Coq ca start an id with @ or _
(defvar coq-id-shy "\\(?:@\\|_\\|\\w\\)\\(?:\\w\\|\\s_\\)*")
; do not use proof-ids with a space separator!
(defvar coq-ids (concat coq-id "\\(" "\\s-+" coq-id "\\)*"))
(defun coq-first-abstr-regexp (paren end)
(concat paren "\\s-*\\(" coq-ids "\\)\\s-*" end))
(defun coq-first-abstr-without-space-regexp (paren end)
"Variant of `coq-first-abstr-regexp' without space between PAREN & `coq-ids'."
(concat paren "\\(" coq-ids "\\)\\s-*" end))
(defcustom coq-variable-highlight-enable t
"Activates partial bound variable highlighting."
:type 'boolean
:group 'coq)
(defcustom coq-symbol-highlight-enable nil
"Activates symbol highlighting."
:type 'boolean
:group 'coq)
(defconst coq-lambda-regexp "\\(?:\\_<fun\\_>\\|λ\\)")
(defconst coq-forall-regexp "\\(?:\\_<forall\\_>\\|∀\\)")
(defconst coq-exists-regexp "\\(?:\\_<exists\\_>\\|∃\\)")
(defvar coq-font-lock-terms
(append
(list ;; flattened by append above
(cons coq-symbol-binders 'coq-symbol-binder-face))
(when coq-symbol-highlight-enable
(list (cons coq-symbols-regexp 'coq-symbol-face)))
(when coq-variable-highlight-enable
(list
;; lambda binders
(list (coq-first-abstr-regexp coq-lambda-regexp "\\(?:=>\\|:\\|,\\)") 1 'font-lock-variable-name-face)
;; forall binder
(list (coq-first-abstr-regexp coq-forall-regexp "\\(?:,\\|:\\)") 1 'font-lock-variable-name-face)
(list (coq-first-abstr-regexp coq-exists-regexp "\\(?:,\\|:\\)") 1 'font-lock-variable-name-face)
;; (list "\\<forall\\>"
;; (list 0 font-lock-type-face)
;; (list (concat "[^ :]\\s-*\\(" coq-ids "\\)\\s-*") nil nil
;; (list 0 font-lock-variable-name-face)))
;; parenthesized binders
(list (coq-first-abstr-regexp "(" ":[ a-zA-Z]") 1 'font-lock-variable-name-face)
;; Don't use coq-first-abstr-regexp here, see ProofGeneral/PG#581:
(list (coq-first-abstr-without-space-regexp "{" ":[ a-zA-Z]") 1 'font-lock-variable-name-face)
;; Likewise, for https://coq.github.io/doc/V8.12.0/refman/language/extensions/implicit-arguments.html#implicit-argument-binders :
(list (coq-first-abstr-without-space-regexp "\\[" ":[ a-zA-Z]") 1 'font-lock-variable-name-face)
)))
"*Font-lock table for Coq terms.")
(defconst coq-show-proof-diffs-regexp
"\\`Show Proof\\(?: Diffs\\| Diffs removed\\)?\\.\\'")
(defconst coq-save-command-regexp
;; FIXME: The surrounding grouping parens are probably not needed.
(concat "\\`\\(\\(?:Time\\s-+\\|Timeout\\s-+[[:digit:]]+\\s-+\\)*\\_<"
(regexp-opt coq-keywords-save t)
"\\_>\\)"))
(defconst coq-save-with-hole-regexp
(concat "\\(?:Time\\s-+\\|Timeout\\s-+[[:digit:]]+\\s-+\\)*\\("
(regexp-opt coq-keywords-save-strict)
"\\)\\s-+\\(" coq-id "\\)\\s-*\\."))
(defconst coq-goal-command-regexp
(concat "\\`\\(?:" (mapconcat #'identity coq-keywords-goal "\\|") "\\)"))
(defconst coq-goal-with-hole-regexp
(concat "\\(" (mapconcat #'identity coq-keywords-goal "\\|")
"\\)\\s-+\\(" coq-id "\\)\\s-*:?"))
(defconst coq-decl-with-hole-regexp
(concat "\\(" (mapconcat #'identity coq-keywords-decl "\\|")
"\\)\\s-+\\(" coq-ids "\\)\\s-*:"))
;; (defconst coq-decl-with-hole-regexp
;; (if coq-variable-highlight-enable coq-decl-with-hole-regexp-1 'nil))
(defconst coq-defn-with-hole-regexp
(concat "\\(" (mapconcat #'identity coq-keywords-defn "\\|")
"\\)\\s-+\\(" coq-id "\\)"))
;; Any command can be prefixed with Local, Global of #[anyhting,anything,...]
(defconst coq-command-prefix-regexp "\\(Local\\s-\\|Global\\s-\\|#[[][^]]*[]]\\)")
;; FIXME: incomplete
(defun coq-add-command-prefix (reg) (concat "\\(" coq-command-prefix-regexp "\\)?" (mapconcat #'identity reg "\\|")))
(defconst coq-command-decl-regexp (coq-add-command-prefix coq-keywords-decl))
(defconst coq-command-defn-regexp (coq-add-command-prefix coq-keywords-defn))
;; must match:
;; "with f x y :" (followed by = or not)
;; "with f x y (z:" (not followed by =)
;; BUT NOT:
;; "with f ... (x:="
;; "match ... with .. => "
(defconst coq-with-with-hole-regexp
(concat "\\(with\\)\\s-+\\(" coq-id "\\)\\s-*\\([^=(.]*:\\|[^(]*(\\s-*"
coq-id "\\s-*:[^=]\\)"))
;; marche aussi a peu pres
;; (concat "\\(with\\)\\s-+\\(" coq-id "\\)\\s-*\\([^(.]*:\\|.*)[^(.]*:=\\)"))
;;"\\<Prop\\>\\|\\<Set\\>\\|\\<Type\\>"
(defconst coq-context-marker-regexp
(concat (regexp-opt '("ltac" "constr" "uconstr" "ltac1" "ltac2") 'symbols) ":"))
;;
;; font-lock
;;
(defvar coq-font-lock-keywords-1
(append
coq-font-lock-terms
`((,coq-solve-tactics-regexp . 'coq-solve-tactics-face)
(,coq-solve-cheat-tactics-regexp . 'coq-cheat-face)
(,coq-keywords-regexp . 'font-lock-keyword-face)
(,coq-reserved-regexp . 'font-lock-type-face)
(,coq-tactics-regexp . 'proof-tactics-name-face)
(,(mapconcat #'identity coq-tacticals "\\|") . 'proof-tacticals-name-face)
(,(coq--regexp-alt-list-symb (list "Set" "Type" "Prop")) . 'font-lock-type-face)
("============================" . 'font-lock-keyword-face)
(,coq-goal-with-hole-regexp 2 'font-lock-function-name-face)
(,coq-context-marker-regexp 1 'coq-context-qualifier-face))
(if coq-variable-highlight-enable
`((,coq-decl-with-hole-regexp 2 'font-lock-variable-name-face)))
`((,coq-defn-with-hole-regexp 2 'font-lock-function-name-face)
(,coq-with-with-hole-regexp 2 'font-lock-function-name-face)
(,coq-save-with-hole-regexp 2 'font-lock-function-name-face)
;; Remove spurious variable and function faces on commas.
(proof-zap-commas))))
;; ", " is for multiple hypothesis displayed in v8.5.
;; exactly no space after start of line = hyps names in
;; Search results (and when we get a more compact display of hyps)
;; exactly 2 spaces at start of line = is for normal goal display at
;; start of line
;; exactly 3 spaces at start of line = hyps on the same line (Set
;; Printing Compact Goals".
;; If more than 3 spaces: not a hyp.
;; we used to have: "^ " for goals in debug mode but it does not seem
;; necessary anymore.
(defvar coq-hyp-name-in-goal-or-response-regexp
"\\(?:\\(?1:^\\)\\|\\(?1:^ \\)\\|\\(?:[^ ] \\)\\(?1: \\)\\)\\(?2:\\(?:[^\n :(),=]\\|, \\)+\\)\\(?: *:=?[ \n]\\|,$\\)"
"Regexp matching hypothesis names in goal or response buffer.
Subexpr 2 contains the real name of the function.
Subexpr 1 contains the prefix context (spaces mainly) that is not
part of another hypothesis.")
; Matches the end of the last hyp, before the ======... separator.
(defvar coq-hyp-name-or-goalsep-in-goal-or-response-regexp
(concat coq-hyp-name-in-goal-or-response-regexp "\\|\\(?1:^\\s-+========\\)"))
(defun coq-find-first-hyp ()
(save-excursion
(goto-char (point-min))
(search-forward-regexp coq-hyp-name-in-goal-or-response-regexp nil t)
(match-beginning 2)))
(defun coq-detect-hyps-positions (buf &optional limit)
"Detect all hypotheses displayed in buffer BUF and returns positions.
5 positions are created for each hyp: (begcross beghypname endhypname beg end)."
(with-current-buffer buf
(save-excursion
(goto-char (point-min))
(let ((res '()))
(goto-char (point-min))
(while (search-forward-regexp coq-hyp-name-in-goal-or-response-regexp limit t)
(let* ((str (replace-regexp-in-string "\\`[ \r\n\t]+\\|[ \r\n\t]+\\'" "" (match-string 2) t t))
(beghypname (match-beginning 2))
(beg (match-end 0))
(begcross (match-beginning 1))
(endhypname (match-end 2))
(splitstr (split-string str ",\\|,$\\|:" t)) ; 4th arg of split-string errors in emacs24
(end (save-excursion ; looking for next hyp and return its leftest part
(search-forward-regexp coq-hyp-name-or-goalsep-in-goal-or-response-regexp nil t)
(goto-char (match-beginning 1))
;; if previous is a newline, don't include it i the overklay
(when (looking-back "\\s-" (1- (point)))
(goto-char (- (point) 1)))
(point))))
; if several hyp names, we name the overlays with the first hyp name
(setq res
(cons
(cons (mapcar (lambda (s) (substring-no-properties s)) splitstr)
(list begcross beghypname endhypname beg end))
res))))
res))))
;; Don't look at the conclusion of the goal
(defun coq-detect-hyps-positions-in-goals ()
(goto-char (point-min))
(coq-detect-hyps-positions
(current-buffer)
(if (search-forward-regexp "==========" nil t) (point) nil)))
;; We define a slightly different set of keywords for response buffer.
(defvar coq-response-font-lock-keywords
(append
coq-font-lock-terms
(list
(cons coq-reserved-regexp 'font-lock-type-face)
(cons coq-keywords-regexp 'font-lock-keyword-face)
(cons coq-shell-eager-annotation-start 'proof-warning-face)
(cons coq-error-regexp 'proof-error-face)
(cons (coq--regexp-alt-list-symb (list "In environment" "The term" "has type")) 'proof-error-face)
(cons (coq--regexp-alt-list-symb (list "Set" "Type" "Prop")) 'font-lock-type-face)
(list (concat "[?]" coq-id) 0 'coq-question-mark-face) ;; highlight evars and Ltac variables
(list coq-hyp-name-in-goal-or-response-regexp 2 'proof-declaration-name-face)
(list "^\\([^ \n]+\\) \\(is defined\\)" (list 1 'font-lock-function-name-face t)))))
(defvar coq-goals-font-lock-keywords
(append
coq-font-lock-terms
(list
(cons coq-reserved-regexp 'font-lock-type-face)
(list (concat "[?]" coq-id) 0 'coq-question-mark-face) ;; highlight evars and Ltac variables
(list coq-hyp-name-in-goal-or-response-regexp 2 'proof-declaration-name-face)
(cons (coq--regexp-alt-list-symb (list "Set" "Type" "Prop")) 'font-lock-type-face))))
;; Use this to evaluate code with "." being consisdered a symbol
;; constituent (better behavior for thing-at and maybe font-lock too,
;; for indentation we use ad hoc smie lexers).
(defmacro coq-with-altered-syntax-table (&rest code)
(declare (debug t))
`(unwind-protect
(progn (modify-syntax-entry ?\. "_")
,@code)
(modify-syntax-entry ?\. ".")))
(defconst coq-generic-expression
(mapcar (lambda (kw)
(list (capitalize kw)
; (concat "\\<" kw "\\>" "\\s-+\\(\\w+\\)\\W" )
; da: that seems buggy (kw already in \\<,\\>; want symbols, not words)
(concat kw "\\s-+\\(\\_<\\(?:\\sw\\|\\s_\\)+\\_>\\)")
1))
(append coq-keywords-decl coq-keywords-defn coq-keywords-goal)))
;; Local Variables: ***
;; indent-tabs-mode: nil ***
;; End: ***
(provide 'coq-syntax)
;;; coq-syntax.el ends here
|