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
(************************************************************************) (* * The Coq Proof Assistant / The Coq Development Team *) (* v * INRIA, CNRS and contributors - Copyright 1999-2019 *) (* <O___,, * (see CREDITS file for the list of authors) *) (* \VV/ **************************************************************) (* // * This file is distributed under the terms of the *) (* * GNU Lesser General Public License Version 2.1 *) (* * (see LICENSE file for the text of the license) *) (************************************************************************) open Util open Pp open Names open Genarg open Tac2env open Tac2expr open Tac2entries.Pltac open Proofview.Notations (** Standard values *) module Value = Tac2ffi open Value let core_prefix path n = KerName.make path (Label.of_id (Id.of_string_soft n)) let std_core n = core_prefix Tac2env.std_prefix n let coq_core n = core_prefix Tac2env.coq_prefix n let ltac1_core n = core_prefix Tac2env.ltac1_prefix n module Core = struct let t_int = coq_core "int" let t_string = coq_core "string" let t_array = coq_core "array" let t_unit = coq_core "unit" let t_list = coq_core "list" let t_constr = coq_core "constr" let t_pattern = coq_core "pattern" let t_ident = coq_core "ident" let t_option = coq_core "option" let t_exn = coq_core "exn" let t_reference = std_core "reference" let t_ltac1 = ltac1_core "t" let c_nil = coq_core "[]" let c_cons = coq_core "::" let c_none = coq_core "None" let c_some = coq_core "Some" let c_true = coq_core "true" let c_false = coq_core "false" end open Core let v_unit = Value.of_unit () let v_blk = Valexpr.make_block let of_name c = match c with | Anonymous -> Value.of_option Value.of_ident None | Name id -> Value.of_option Value.of_ident (Some id) let to_name c = match Value.to_option Value.to_ident c with | None -> Anonymous | Some id -> Name id let of_relevance = function | Sorts.Relevant -> ValInt 0 | Sorts.Irrelevant -> ValInt 1 let to_relevance = function | ValInt 0 -> Sorts.Relevant | ValInt 1 -> Sorts.Irrelevant | _ -> assert false let of_annot f Context.{binder_name;binder_relevance} = of_tuple [|(f binder_name); of_relevance binder_relevance|] let to_annot f x = match to_tuple x with | [|x;y|] -> let x = f x in let y = to_relevance y in Context.make_annot x y | _ -> assert false let of_instance u = let u = Univ.Instance.to_array (EConstr.Unsafe.to_instance u) in Value.of_array (fun v -> Value.of_ext Value.val_univ v) u let to_instance u = let u = Value.to_array (fun v -> Value.to_ext Value.val_univ v) u in EConstr.EInstance.make (Univ.Instance.of_array u) let of_rec_declaration (nas, ts, cs) = (Value.of_array (of_annot of_name) nas, Value.of_array Value.of_constr ts, Value.of_array Value.of_constr cs) let to_rec_declaration (nas, ts, cs) = (Value.to_array (to_annot to_name) nas, Value.to_array Value.to_constr ts, Value.to_array Value.to_constr cs) let of_result f = function | Inl c -> v_blk 0 [|f c|] | Inr e -> v_blk 1 [|Value.of_exn e|] (** Stdlib exceptions *) let err_notfocussed = Tac2interp.LtacError (coq_core "Not_focussed", [||]) let err_outofbounds = Tac2interp.LtacError (coq_core "Out_of_bounds", [||]) let err_notfound = Tac2interp.LtacError (coq_core "Not_found", [||]) let err_matchfailure = Tac2interp.LtacError (coq_core "Match_failure", [||]) (** Helper functions *) let thaw f = Tac2ffi.apply f [v_unit] let fatal_flag : unit Exninfo.t = Exninfo.make () let set_bt info = if !Tac2interp.print_ltac2_backtrace then Tac2interp.get_backtrace >>= fun bt -> Proofview.tclUNIT (Exninfo.add info Tac2entries.backtrace bt) else Proofview.tclUNIT info let throw ?(info = Exninfo.null) e = set_bt info >>= fun info -> let info = Exninfo.add info fatal_flag () in Proofview.tclLIFT (Proofview.NonLogical.raise ~info e) let fail ?(info = Exninfo.null) e = set_bt info >>= fun info -> Proofview.tclZERO ~info e let return x = Proofview.tclUNIT x let pname s = { mltac_plugin = "ltac2"; mltac_tactic = s } let wrap f = return () >>= fun () -> return (f ()) let wrap_unit f = return () >>= fun () -> f (); return v_unit let assert_focussed = Proofview.Goal.goals >>= fun gls -> match gls with | [_] -> Proofview.tclUNIT () | [] | _ :: _ :: _ -> throw err_notfocussed let pf_apply f = Proofview.Goal.goals >>= function | [] -> Proofview.tclENV >>= fun env -> Proofview.tclEVARMAP >>= fun sigma -> f env sigma | [gl] -> gl >>= fun gl -> f (Proofview.Goal.env gl) (Tacmach.New.project gl) | _ :: _ :: _ -> throw err_notfocussed (** Primitives *) let define_primitive name arity f = Tac2env.define_primitive (pname name) (mk_closure arity f) let define0 name f = define_primitive name arity_one (fun _ -> f) let define1 name r0 f = define_primitive name arity_one begin fun x -> f (Value.repr_to r0 x) end let define2 name r0 r1 f = define_primitive name (arity_suc arity_one) begin fun x y -> f (Value.repr_to r0 x) (Value.repr_to r1 y) end let define3 name r0 r1 r2 f = define_primitive name (arity_suc (arity_suc arity_one)) begin fun x y z -> f (Value.repr_to r0 x) (Value.repr_to r1 y) (Value.repr_to r2 z) end (** Printing *) let () = define1 "print" pp begin fun pp -> wrap_unit (fun () -> Feedback.msg_notice pp) end let () = define1 "message_of_int" int begin fun n -> return (Value.of_pp (Pp.int n)) end let () = define1 "message_of_string" string begin fun s -> return (Value.of_pp (str (Bytes.to_string s))) end let () = define1 "message_of_constr" constr begin fun c -> pf_apply begin fun env sigma -> let pp = Printer.pr_econstr_env env sigma c in return (Value.of_pp pp) end end let () = define1 "message_of_ident" ident begin fun c -> let pp = Id.print c in return (Value.of_pp pp) end let () = define1 "message_of_exn" valexpr begin fun v -> Proofview.tclENV >>= fun env -> Proofview.tclEVARMAP >>= fun sigma -> let pp = Tac2print.pr_valexpr env sigma v (GTypRef (Other Core.t_exn, [])) in return (Value.of_pp pp) end let () = define2 "message_concat" pp pp begin fun m1 m2 -> return (Value.of_pp (Pp.app m1 m2)) end (** Array *) let () = define2 "array_make" int valexpr begin fun n x -> if n < 0 || n > Sys.max_array_length then throw err_outofbounds else wrap (fun () -> v_blk 0 (Array.make n x)) end let () = define1 "array_length" block begin fun (_, v) -> return (Value.of_int (Array.length v)) end let () = define3 "array_set" block int valexpr begin fun (_, v) n x -> if n < 0 || n >= Array.length v then throw err_outofbounds else wrap_unit (fun () -> v.(n) <- x) end let () = define2 "array_get" block int begin fun (_, v) n -> if n < 0 || n >= Array.length v then throw err_outofbounds else wrap (fun () -> v.(n)) end (** Ident *) let () = define2 "ident_equal" ident ident begin fun id1 id2 -> return (Value.of_bool (Id.equal id1 id2)) end let () = define1 "ident_to_string" ident begin fun id -> return (Value.of_string (Bytes.of_string (Id.to_string id))) end let () = define1 "ident_of_string" string begin fun s -> let id = try Some (Id.of_string (Bytes.to_string s)) with _ -> None in return (Value.of_option Value.of_ident id) end (** Int *) let () = define2 "int_equal" int int begin fun m n -> return (Value.of_bool (m == n)) end let binop n f = define2 n int int begin fun m n -> return (Value.of_int (f m n)) end let () = binop "int_compare" Int.compare let () = binop "int_add" (+) let () = binop "int_sub" (-) let () = binop "int_mul" ( * ) let () = define1 "int_neg" int begin fun m -> return (Value.of_int (~- m)) end (** Char *) let () = define1 "char_of_int" int begin fun n -> wrap (fun () -> Value.of_char (Char.chr n)) end let () = define1 "char_to_int" char begin fun n -> wrap (fun () -> Value.of_int (Char.code n)) end (** String *) let () = define2 "string_make" int char begin fun n c -> if n < 0 || n > Sys.max_string_length then throw err_outofbounds else wrap (fun () -> Value.of_string (Bytes.make n c)) end let () = define1 "string_length" string begin fun s -> return (Value.of_int (Bytes.length s)) end let () = define3 "string_set" string int char begin fun s n c -> if n < 0 || n >= Bytes.length s then throw err_outofbounds else wrap_unit (fun () -> Bytes.set s n c) end let () = define2 "string_get" string int begin fun s n -> if n < 0 || n >= Bytes.length s then throw err_outofbounds else wrap (fun () -> Value.of_char (Bytes.get s n)) end (** Terms *) (** constr -> constr *) let () = define1 "constr_type" constr begin fun c -> let get_type env sigma = Proofview.V82.wrap_exceptions begin fun () -> let (sigma, t) = Typing.type_of env sigma c in let t = Value.of_constr t in Proofview.Unsafe.tclEVARS sigma <*> Proofview.tclUNIT t end in pf_apply get_type end (** constr -> constr *) let () = define2 "constr_equal" constr constr begin fun c1 c2 -> Proofview.tclEVARMAP >>= fun sigma -> let b = EConstr.eq_constr sigma c1 c2 in Proofview.tclUNIT (Value.of_bool b) end let () = define1 "constr_kind" constr begin fun c -> let open Constr in Proofview.tclEVARMAP >>= fun sigma -> return begin match EConstr.kind sigma c with | Rel n -> v_blk 0 [|Value.of_int n|] | Var id -> v_blk 1 [|Value.of_ident id|] | Meta n -> v_blk 2 [|Value.of_int n|] | Evar (evk, args) -> v_blk 3 [| Value.of_int (Evar.repr evk); Value.of_array Value.of_constr args; |] | Sort s -> v_blk 4 [|Value.of_ext Value.val_sort s|] | Cast (c, k, t) -> v_blk 5 [| Value.of_constr c; Value.of_ext Value.val_cast k; Value.of_constr t; |] | Prod (na, t, u) -> v_blk 6 [| of_annot of_name na; Value.of_constr t; Value.of_constr u; |] | Lambda (na, t, c) -> v_blk 7 [| of_annot of_name na; Value.of_constr t; Value.of_constr c; |] | LetIn (na, b, t, c) -> v_blk 8 [| of_annot of_name na; Value.of_constr b; Value.of_constr t; Value.of_constr c; |] | App (c, cl) -> v_blk 9 [| Value.of_constr c; Value.of_array Value.of_constr cl; |] | Const (cst, u) -> v_blk 10 [| Value.of_constant cst; of_instance u; |] | Ind (ind, u) -> v_blk 11 [| Value.of_ext Value.val_inductive ind; of_instance u; |] | Construct (cstr, u) -> v_blk 12 [| Value.of_ext Value.val_constructor cstr; of_instance u; |] | Case (ci, c, t, bl) -> v_blk 13 [| Value.of_ext Value.val_case ci; Value.of_constr c; Value.of_constr t; Value.of_array Value.of_constr bl; |] | Fix ((recs, i), def) -> let (nas, ts, cs) = of_rec_declaration def in v_blk 14 [| Value.of_array Value.of_int recs; Value.of_int i; nas; ts; cs; |] | CoFix (i, def) -> let (nas, ts, cs) = of_rec_declaration def in v_blk 15 [| Value.of_int i; nas; ts; cs; |] | Proj (p, c) -> v_blk 16 [| Value.of_ext Value.val_projection p; Value.of_constr c; |] | Int n -> v_blk 17 [|Value.of_uint63 n|] end end let () = define1 "constr_make" valexpr begin fun knd -> let c = match Tac2ffi.to_block knd with | (0, [|n|]) -> let n = Value.to_int n in EConstr.mkRel n | (1, [|id|]) -> let id = Value.to_ident id in EConstr.mkVar id | (2, [|n|]) -> let n = Value.to_int n in EConstr.mkMeta n | (3, [|evk; args|]) -> let evk = Evar.unsafe_of_int (Value.to_int evk) in let args = Value.to_array Value.to_constr args in EConstr.mkEvar (evk, args) | (4, [|s|]) -> let s = Value.to_ext Value.val_sort s in EConstr.mkSort (EConstr.Unsafe.to_sorts s) | (5, [|c; k; t|]) -> let c = Value.to_constr c in let k = Value.to_ext Value.val_cast k in let t = Value.to_constr t in EConstr.mkCast (c, k, t) | (6, [|na; t; u|]) -> let na = to_annot to_name na in let t = Value.to_constr t in let u = Value.to_constr u in EConstr.mkProd (na, t, u) | (7, [|na; t; c|]) -> let na = to_annot to_name na in let t = Value.to_constr t in let u = Value.to_constr c in EConstr.mkLambda (na, t, u) | (8, [|na; b; t; c|]) -> let na = to_annot to_name na in let b = Value.to_constr b in let t = Value.to_constr t in let c = Value.to_constr c in EConstr.mkLetIn (na, b, t, c) | (9, [|c; cl|]) -> let c = Value.to_constr c in let cl = Value.to_array Value.to_constr cl in EConstr.mkApp (c, cl) | (10, [|cst; u|]) -> let cst = Value.to_constant cst in let u = to_instance u in EConstr.mkConstU (cst, u) | (11, [|ind; u|]) -> let ind = Value.to_ext Value.val_inductive ind in let u = to_instance u in EConstr.mkIndU (ind, u) | (12, [|cstr; u|]) -> let cstr = Value.to_ext Value.val_constructor cstr in let u = to_instance u in EConstr.mkConstructU (cstr, u) | (13, [|ci; c; t; bl|]) -> let ci = Value.to_ext Value.val_case ci in let c = Value.to_constr c in let t = Value.to_constr t in let bl = Value.to_array Value.to_constr bl in EConstr.mkCase (ci, c, t, bl) | (14, [|recs; i; nas; ts; cs|]) -> let recs = Value.to_array Value.to_int recs in let i = Value.to_int i in let def = to_rec_declaration (nas, ts, cs) in EConstr.mkFix ((recs, i), def) | (15, [|i; nas; ts; cs|]) -> let i = Value.to_int i in let def = to_rec_declaration (nas, ts, cs) in EConstr.mkCoFix (i, def) | (16, [|p; c|]) -> let p = Value.to_ext Value.val_projection p in let c = Value.to_constr c in EConstr.mkProj (p, c) | (17, [|n|]) -> let n = Value.to_uint63 n in EConstr.mkInt n | _ -> assert false in return (Value.of_constr c) end let () = define1 "constr_check" constr begin fun c -> pf_apply begin fun env sigma -> try let (sigma, _) = Typing.type_of env sigma c in Proofview.Unsafe.tclEVARS sigma >>= fun () -> return (of_result Value.of_constr (Inl c)) with e when CErrors.noncritical e -> let e = CErrors.push e in return (of_result Value.of_constr (Inr e)) end end let () = define3 "constr_substnl" (list constr) int constr begin fun subst k c -> let ans = EConstr.Vars.substnl subst k c in return (Value.of_constr ans) end let () = define3 "constr_closenl" (list ident) int constr begin fun ids k c -> let ans = EConstr.Vars.substn_vars k ids c in return (Value.of_constr ans) end let () = define1 "constr_case" (repr_ext val_inductive) begin fun ind -> Proofview.tclENV >>= fun env -> try let ans = Inductiveops.make_case_info env ind Sorts.Relevant Constr.RegularStyle in return (Value.of_ext Value.val_case ans) with e when CErrors.noncritical e -> throw err_notfound end let () = define2 "constr_constructor" (repr_ext val_inductive) int begin fun (ind, i) k -> Proofview.tclENV >>= fun env -> try let open Declarations in let ans = Environ.lookup_mind ind env in let _ = ans.mind_packets.(i).mind_consnames.(k) in return (Value.of_ext val_constructor ((ind, i), (k + 1))) with e when CErrors.noncritical e -> throw err_notfound end let () = define3 "constr_in_context" ident constr closure begin fun id t c -> Proofview.Goal.goals >>= function | [gl] -> gl >>= fun gl -> let env = Proofview.Goal.env gl in let sigma = Proofview.Goal.sigma gl in let has_var = try let _ = Environ.lookup_named_val id env in true with Not_found -> false in if has_var then Tacticals.New.tclZEROMSG (str "Variable already exists") else let open Context.Named.Declaration in let nenv = EConstr.push_named (LocalAssum (Context.make_annot id Sorts.Relevant, t)) env in let (sigma, (evt, _)) = Evarutil.new_type_evar nenv sigma Evd.univ_flexible in let (sigma, evk) = Evarutil.new_pure_evar (Environ.named_context_val nenv) sigma evt in Proofview.Unsafe.tclEVARS sigma >>= fun () -> Proofview.Unsafe.tclSETGOALS [Proofview.with_empty_state evk] >>= fun () -> thaw c >>= fun _ -> Proofview.Unsafe.tclSETGOALS [Proofview.with_empty_state (Proofview.Goal.goal gl)] >>= fun () -> let args = List.map (fun d -> EConstr.mkVar (get_id d)) (EConstr.named_context env) in let args = Array.of_list (EConstr.mkRel 1 :: args) in let ans = EConstr.mkEvar (evk, args) in let ans = EConstr.mkLambda (Context.make_annot (Name id) Sorts.Relevant, t, ans) in return (Value.of_constr ans) | _ -> throw err_notfocussed end (** Patterns *) let empty_context = EConstr.mkMeta Constr_matching.special_meta let () = define0 "pattern_empty_context" begin return (Value.of_constr empty_context) end let () = define2 "pattern_matches" pattern constr begin fun pat c -> pf_apply begin fun env sigma -> let ans = try Some (Constr_matching.matches env sigma pat c) with Constr_matching.PatternMatchingFailure -> None in begin match ans with | None -> fail err_matchfailure | Some ans -> let ans = Id.Map.bindings ans in let of_pair (id, c) = Value.of_tuple [| Value.of_ident id; Value.of_constr c |] in return (Value.of_list of_pair ans) end end end let () = define2 "pattern_matches_subterm" pattern constr begin fun pat c -> let open Constr_matching in let rec of_ans s = match IStream.peek s with | IStream.Nil -> fail err_matchfailure | IStream.Cons ({ m_sub = (_, sub); m_ctx }, s) -> let ans = Id.Map.bindings sub in let of_pair (id, c) = Value.of_tuple [| Value.of_ident id; Value.of_constr c |] in let ans = Value.of_tuple [| Value.of_constr (Lazy.force m_ctx); Value.of_list of_pair ans |] in Proofview.tclOR (return ans) (fun _ -> of_ans s) in pf_apply begin fun env sigma -> let ans = Constr_matching.match_subterm env sigma (Id.Set.empty,pat) c in of_ans ans end end let () = define2 "pattern_matches_vect" pattern constr begin fun pat c -> pf_apply begin fun env sigma -> let ans = try Some (Constr_matching.matches env sigma pat c) with Constr_matching.PatternMatchingFailure -> None in begin match ans with | None -> fail err_matchfailure | Some ans -> let ans = Id.Map.bindings ans in let ans = Array.map_of_list snd ans in return (Value.of_array Value.of_constr ans) end end end let () = define2 "pattern_matches_subterm_vect" pattern constr begin fun pat c -> let open Constr_matching in let rec of_ans s = match IStream.peek s with | IStream.Nil -> fail err_matchfailure | IStream.Cons ({ m_sub = (_, sub); m_ctx }, s) -> let ans = Id.Map.bindings sub in let ans = Array.map_of_list snd ans in let ans = Value.of_tuple [| Value.of_constr (Lazy.force m_ctx); Value.of_array Value.of_constr ans |] in Proofview.tclOR (return ans) (fun _ -> of_ans s) in pf_apply begin fun env sigma -> let ans = Constr_matching.match_subterm env sigma (Id.Set.empty,pat) c in of_ans ans end end let () = define3 "pattern_matches_goal" bool (list (pair bool pattern)) (pair bool pattern) begin fun rev hp cp -> assert_focussed >>= fun () -> Proofview.Goal.enter_one begin fun gl -> let env = Proofview.Goal.env gl in let sigma = Proofview.Goal.sigma gl in let concl = Proofview.Goal.concl gl in let mk_pattern (b, pat) = if b then Tac2match.MatchPattern pat else Tac2match.MatchContext pat in let r = (List.map mk_pattern hp, mk_pattern cp) in Tac2match.match_goal env sigma concl ~rev r >>= fun (hyps, ctx, subst) -> let of_ctxopt ctx = Value.of_constr (Option.default empty_context ctx) in let hids = Value.of_array Value.of_ident (Array.map_of_list fst hyps) in let hctx = Value.of_array of_ctxopt (Array.map_of_list snd hyps) in let subs = Value.of_array Value.of_constr (Array.map_of_list snd (Id.Map.bindings subst)) in let cctx = of_ctxopt ctx in let ans = Value.of_tuple [| hids; hctx; subs; cctx |] in Proofview.tclUNIT ans end end let () = define2 "pattern_instantiate" constr constr begin fun ctx c -> let ctx = EConstr.Unsafe.to_constr ctx in let c = EConstr.Unsafe.to_constr c in let ans = Termops.subst_meta [Constr_matching.special_meta, c] ctx in return (Value.of_constr (EConstr.of_constr ans)) end (** Error *) let () = define1 "throw" exn begin fun (e, info) -> throw ~info e end (** Control *) (** exn -> 'a *) let () = define1 "zero" exn begin fun (e, info) -> fail ~info e end (** (unit -> 'a) -> (exn -> 'a) -> 'a *) let () = define2 "plus" closure closure begin fun x k -> Proofview.tclOR (thaw x) (fun e -> Tac2ffi.apply k [Value.of_exn e]) end (** (unit -> 'a) -> 'a *) let () = define1 "once" closure begin fun f -> Proofview.tclONCE (thaw f) end (** (unit -> unit) list -> unit *) let () = define1 "dispatch" (list closure) begin fun l -> let l = List.map (fun f -> Proofview.tclIGNORE (thaw f)) l in Proofview.tclDISPATCH l >>= fun () -> return v_unit end (** (unit -> unit) list -> (unit -> unit) -> (unit -> unit) list -> unit *) let () = define3 "extend" (list closure) closure (list closure) begin fun lft tac rgt -> let lft = List.map (fun f -> Proofview.tclIGNORE (thaw f)) lft in let tac = Proofview.tclIGNORE (thaw tac) in let rgt = List.map (fun f -> Proofview.tclIGNORE (thaw f)) rgt in Proofview.tclEXTEND lft tac rgt >>= fun () -> return v_unit end (** (unit -> unit) -> unit *) let () = define1 "enter" closure begin fun f -> let f = Proofview.tclIGNORE (thaw f) in Proofview.tclINDEPENDENT f >>= fun () -> return v_unit end (** (unit -> 'a) -> ('a * ('exn -> 'a)) result *) let () = define1 "case" closure begin fun f -> Proofview.tclCASE (thaw f) >>= begin function | Proofview.Next (x, k) -> let k = Tac2ffi.mk_closure arity_one begin fun e -> let (e, info) = Value.to_exn e in set_bt info >>= fun info -> k (e, info) end in return (v_blk 0 [| Value.of_tuple [| x; Value.of_closure k |] |]) | Proofview.Fail e -> return (v_blk 1 [| Value.of_exn e |]) end end (** int -> int -> (unit -> 'a) -> 'a *) let () = define3 "focus" int int closure begin fun i j tac -> Proofview.tclFOCUS i j (thaw tac) end (** unit -> unit *) let () = define0 "shelve" begin Proofview.shelve >>= fun () -> return v_unit end (** unit -> unit *) let () = define0 "shelve_unifiable" begin Proofview.shelve_unifiable >>= fun () -> return v_unit end let () = define1 "new_goal" int begin fun ev -> let ev = Evar.unsafe_of_int ev in Proofview.tclEVARMAP >>= fun sigma -> if Evd.mem sigma ev then Proofview.Unsafe.tclNEWGOALS [Proofview.with_empty_state ev] <*> Proofview.tclUNIT v_unit else throw err_notfound end (** unit -> constr *) let () = define0 "goal" begin assert_focussed >>= fun () -> Proofview.Goal.enter_one begin fun gl -> let concl = Tacmach.New.pf_nf_concl gl in return (Value.of_constr concl) end end (** ident -> constr *) let () = define1 "hyp" ident begin fun id -> pf_apply begin fun env _ -> let mem = try ignore (Environ.lookup_named id env); true with Not_found -> false in if mem then return (Value.of_constr (EConstr.mkVar id)) else Tacticals.New.tclZEROMSG (str "Hypothesis " ++ quote (Id.print id) ++ str " not found") (* FIXME: Do something more sensible *) end end let () = define0 "hyps" begin pf_apply begin fun env _ -> let open Context in let open Named.Declaration in let hyps = List.rev (Environ.named_context env) in let map = function | LocalAssum (id, t) -> let t = EConstr.of_constr t in Value.of_tuple [|Value.of_ident id.binder_name; Value.of_option Value.of_constr None; Value.of_constr t|] | LocalDef (id, c, t) -> let c = EConstr.of_constr c in let t = EConstr.of_constr t in Value.of_tuple [|Value.of_ident id.binder_name; Value.of_option Value.of_constr (Some c); Value.of_constr t|] in return (Value.of_list map hyps) end end (** (unit -> constr) -> unit *) let () = define1 "refine" closure begin fun c -> let c = thaw c >>= fun c -> Proofview.tclUNIT ((), Value.to_constr c) in Proofview.Goal.enter begin fun gl -> Refine.generic_refine ~typecheck:true c gl end >>= fun () -> return v_unit end let () = define2 "with_holes" closure closure begin fun x f -> Proofview.tclEVARMAP >>= fun sigma0 -> thaw x >>= fun ans -> Proofview.tclEVARMAP >>= fun sigma -> Proofview.Unsafe.tclEVARS sigma0 >>= fun () -> Tacticals.New.tclWITHHOLES false (Tac2ffi.apply f [ans]) sigma end let () = define1 "progress" closure begin fun f -> Proofview.tclPROGRESS (thaw f) end let () = define2 "abstract" (option ident) closure begin fun id f -> Abstract.tclABSTRACT id (Proofview.tclIGNORE (thaw f)) >>= fun () -> return v_unit end let () = define2 "time" (option string) closure begin fun s f -> let s = Option.map Bytes.to_string s in Proofview.tclTIME s (thaw f) end let () = define0 "check_interrupt" begin Proofview.tclCHECKINTERRUPT >>= fun () -> return v_unit end (** Fresh *) let () = define2 "fresh_free_union" (repr_ext val_free) (repr_ext val_free) begin fun set1 set2 -> let ans = Id.Set.union set1 set2 in return (Value.of_ext Value.val_free ans) end let () = define1 "fresh_free_of_ids" (list ident) begin fun ids -> let free = List.fold_right Id.Set.add ids Id.Set.empty in return (Value.of_ext Value.val_free free) end let () = define1 "fresh_free_of_constr" constr begin fun c -> Proofview.tclEVARMAP >>= fun sigma -> let rec fold accu c = match EConstr.kind sigma c with | Constr.Var id -> Id.Set.add id accu | _ -> EConstr.fold sigma fold accu c in let ans = fold Id.Set.empty c in return (Value.of_ext Value.val_free ans) end let () = define2 "fresh_fresh" (repr_ext val_free) ident begin fun avoid id -> let nid = Namegen.next_ident_away_from id (fun id -> Id.Set.mem id avoid) in return (Value.of_ident nid) end (** Env *) let () = define1 "env_get" (list ident) begin fun ids -> let r = match ids with | [] -> None | _ :: _ as ids -> let (id, path) = List.sep_last ids in let path = DirPath.make (List.rev path) in let fp = Libnames.make_path path id in try Some (Nametab.global_of_path fp) with Not_found -> None in return (Value.of_option Value.of_reference r) end let () = define1 "env_expand" (list ident) begin fun ids -> let r = match ids with | [] -> [] | _ :: _ as ids -> let (id, path) = List.sep_last ids in let path = DirPath.make (List.rev path) in let qid = Libnames.make_qualid path id in Nametab.locate_all qid in return (Value.of_list Value.of_reference r) end let () = define1 "env_path" reference begin fun r -> match Nametab.path_of_global r with | fp -> let (path, id) = Libnames.repr_path fp in let path = DirPath.repr path in return (Value.of_list Value.of_ident (List.rev_append path [id])) | exception Not_found -> throw err_notfound end let () = define1 "env_instantiate" reference begin fun r -> Proofview.tclENV >>= fun env -> Proofview.tclEVARMAP >>= fun sigma -> let (sigma, c) = Evd.fresh_global env sigma r in Proofview.Unsafe.tclEVARS sigma >>= fun () -> return (Value.of_constr c) end (** Ltac1 in Ltac2 *) let ltac1 = Tac2ffi.repr_ext Value.val_ltac1 let of_ltac1 v = Value.of_ext Value.val_ltac1 v let () = define1 "ltac1_ref" (list ident) begin fun ids -> let open Ltac_plugin in let r = match ids with | [] -> raise Not_found | _ :: _ as ids -> let (id, path) = List.sep_last ids in let path = DirPath.make (List.rev path) in let fp = Libnames.make_path path id in if Tacenv.exists_tactic fp then List.hd (Tacenv.locate_extended_all_tactic (Libnames.qualid_of_path fp)) else raise Not_found in let tac = Tacinterp.Value.of_closure (Tacinterp.default_ist ()) (Tacenv.interp_ltac r) in return (Value.of_ext val_ltac1 tac) end let () = define1 "ltac1_run" ltac1 begin fun v -> let open Ltac_plugin in Tacinterp.tactic_of_value (Tacinterp.default_ist ()) v >>= fun () -> return v_unit end let () = define3 "ltac1_apply" ltac1 (list ltac1) closure begin fun f args k -> let open Ltac_plugin in let open Tacexpr in let open Locus in let k ret = Proofview.tclIGNORE (Tac2ffi.apply k [Value.of_ext val_ltac1 ret]) in let fold arg (i, vars, lfun) = let id = Id.of_string ("x" ^ string_of_int i) in let x = Reference (ArgVar CAst.(make id)) in (succ i, x :: vars, Id.Map.add id arg lfun) in let (_, args, lfun) = List.fold_right fold args (0, [], Id.Map.empty) in let lfun = Id.Map.add (Id.of_string "F") f lfun in let ist = { (Tacinterp.default_ist ()) with Tacinterp.lfun = lfun; } in let tac = TacArg(CAst.make @@ TacCall (CAst.make (ArgVar CAst.(make @@ Id.of_string "F"),args))) in Tacinterp.val_interp ist tac k >>= fun () -> return v_unit end let () = define1 "ltac1_of_constr" constr begin fun c -> let open Ltac_plugin in return (Value.of_ext val_ltac1 (Tacinterp.Value.of_constr c)) end let () = define1 "ltac1_to_constr" ltac1 begin fun v -> let open Ltac_plugin in return (Value.of_option Value.of_constr (Tacinterp.Value.to_constr v)) end let () = define1 "ltac1_of_list" (list ltac1) begin fun l -> let open Geninterp.Val in return (Value.of_ext val_ltac1 (inject (Base typ_list) l)) end let () = define1 "ltac1_to_list" ltac1 begin fun v -> let open Ltac_plugin in return (Value.of_option (Value.of_list of_ltac1) (Tacinterp.Value.to_list v)) end (** ML types *) let constr_flags () = let open Pretyping in { use_typeclasses = true; solve_unification_constraints = true; fail_evar = true; expand_evars = true; program_mode = false; polymorphic = false; } let open_constr_no_classes_flags () = let open Pretyping in { use_typeclasses = false; solve_unification_constraints = true; fail_evar = false; expand_evars = true; program_mode = false; polymorphic = false; } (** Embed all Ltac2 data into Values *) let to_lvar ist = let open Glob_ops in let lfun = Tac2interp.set_env ist Id.Map.empty in { empty_lvar with Ltac_pretype.ltac_genargs = lfun } let gtypref kn = GTypRef (Other kn, []) let intern_constr self ist c = let (_, (c, _)) = Genintern.intern Stdarg.wit_constr ist c in (GlbVal c, gtypref t_constr) let catchable_exception = function | Logic_monad.Exception _ -> false | e -> CErrors.noncritical e let interp_constr flags ist c = let open Pretyping in let ist = to_lvar ist in pf_apply begin fun env sigma -> try let (sigma, c) = understand_ltac flags env sigma ist WithoutTypeConstraint c in let c = Value.of_constr c in Proofview.Unsafe.tclEVARS sigma >>= fun () -> Proofview.tclUNIT c with e when catchable_exception e -> let (e, info) = CErrors.push e in set_bt info >>= fun info -> match Exninfo.get info fatal_flag with | None -> Proofview.tclZERO ~info e | Some () -> throw ~info e end let () = let intern = intern_constr in let interp ist c = interp_constr (constr_flags ()) ist c in let print env c = str "constr:(" ++ Printer.pr_lglob_constr_env env c ++ str ")" in let subst subst c = Detyping.subst_glob_constr (Global.env()) subst c in let obj = { ml_intern = intern; ml_subst = subst; ml_interp = interp; ml_print = print; } in define_ml_object Tac2quote.wit_constr obj let () = let intern = intern_constr in let interp ist c = interp_constr (open_constr_no_classes_flags ()) ist c in let print env c = str "open_constr:(" ++ Printer.pr_lglob_constr_env env c ++ str ")" in let subst subst c = Detyping.subst_glob_constr (Global.env()) subst c in let obj = { ml_intern = intern; ml_subst = subst; ml_interp = interp; ml_print = print; } in define_ml_object Tac2quote.wit_open_constr obj let () = let interp _ id = return (Value.of_ident id) in let print _ id = str "ident:(" ++ Id.print id ++ str ")" in let obj = { ml_intern = (fun _ _ id -> GlbVal id, gtypref t_ident); ml_interp = interp; ml_subst = (fun _ id -> id); ml_print = print; } in define_ml_object Tac2quote.wit_ident obj let () = let intern self ist c = let env = ist.Genintern.genv in let sigma = Evd.from_env env in let warn = if !Ltac_plugin.Tacintern.strict_check then fun x -> x else Constrintern.for_grammar in let _, pat = warn (fun () ->Constrintern.intern_constr_pattern env sigma ~as_type:false c) () in GlbVal pat, gtypref t_pattern in let subst subst c = let env = Global.env () in let sigma = Evd.from_env env in Patternops.subst_pattern env sigma subst c in let print env pat = str "pattern:(" ++ Printer.pr_lconstr_pattern_env env Evd.empty pat ++ str ")" in let interp _ c = return (Value.of_pattern c) in let obj = { ml_intern = intern; ml_interp = interp; ml_subst = subst; ml_print = print; } in define_ml_object Tac2quote.wit_pattern obj let () = let intern self ist ref = match ref.CAst.v with | Tac2qexpr.QHypothesis id -> GlbVal (GlobRef.VarRef id), gtypref t_reference | Tac2qexpr.QReference qid -> let gr = try Nametab.locate qid with Not_found -> Nametab.error_global_not_found qid in GlbVal gr, gtypref t_reference in let subst s c = Globnames.subst_global_reference s c in let interp _ gr = return (Value.of_reference gr) in let print _ = function | GlobRef.VarRef id -> str "reference:(" ++ str "&" ++ Id.print id ++ str ")" | r -> str "reference:(" ++ Printer.pr_global r ++ str ")" in let obj = { ml_intern = intern; ml_subst = subst; ml_interp = interp; ml_print = print; } in define_ml_object Tac2quote.wit_reference obj let () = let intern self ist (ids, tac) = let map { CAst.v = id } = id in let ids = List.map map ids in (* Prevent inner calls to Ltac2 values *) let extra = Tac2intern.drop_ltac2_env ist.Genintern.extra in let ltacvars = List.fold_right Id.Set.add ids ist.Genintern.ltacvars in let ist = { ist with Genintern.extra; ltacvars } in let _, tac = Genintern.intern Ltac_plugin.Tacarg.wit_tactic ist tac in let fold ty _ = GTypArrow (gtypref t_ltac1, ty) in let ty = List.fold_left fold (gtypref t_unit) ids in GlbVal (ids, tac), ty in let interp _ (ids, tac) = let clos args = let add lfun id v = let v = Tac2ffi.to_ext val_ltac1 v in Id.Map.add id v lfun in let lfun = List.fold_left2 add Id.Map.empty ids args in let ist = { env_ist = Id.Map.empty } in let lfun = Tac2interp.set_env ist lfun in let ist = Ltac_plugin.Tacinterp.default_ist () in let ist = { ist with Geninterp.lfun = lfun } in let tac = (Ltac_plugin.Tacinterp.eval_tactic_ist ist tac : unit Proofview.tactic) in let wrap (e, info) = set_bt info >>= fun info -> Proofview.tclZERO ~info e in Proofview.tclOR tac wrap >>= fun () -> return v_unit in let len = List.length ids in if Int.equal len 0 then clos [] else return (Tac2ffi.of_closure (Tac2ffi.abstract len clos)) in let subst s (ids, tac) = (ids, Genintern.substitute Ltac_plugin.Tacarg.wit_tactic s tac) in let print env (ids, tac) = let ids = if List.is_empty ids then mt () else pr_sequence Id.print ids ++ spc () ++ str "|-" ++ spc () in str "ltac1:(" ++ ids ++ Ltac_plugin.Pptactic.pr_glob_tactic env tac ++ str ")" in let obj = { ml_intern = intern; ml_subst = subst; ml_interp = interp; ml_print = print; } in define_ml_object Tac2quote.wit_ltac1 obj let () = let open Ltac_plugin in let intern self ist (ids, tac) = let map { CAst.v = id } = id in let ids = List.map map ids in (* Prevent inner calls to Ltac2 values *) let extra = Tac2intern.drop_ltac2_env ist.Genintern.extra in let ltacvars = List.fold_right Id.Set.add ids ist.Genintern.ltacvars in let ist = { ist with Genintern.extra; ltacvars } in let _, tac = Genintern.intern Ltac_plugin.Tacarg.wit_tactic ist tac in let fold ty _ = GTypArrow (gtypref t_ltac1, ty) in let ty = List.fold_left fold (gtypref t_ltac1) ids in GlbVal (ids, tac), ty in let interp _ (ids, tac) = let clos args = let add lfun id v = let v = Tac2ffi.to_ext val_ltac1 v in Id.Map.add id v lfun in let lfun = List.fold_left2 add Id.Map.empty ids args in let ist = { env_ist = Id.Map.empty } in let lfun = Tac2interp.set_env ist lfun in let ist = Ltac_plugin.Tacinterp.default_ist () in let ist = { ist with Geninterp.lfun = lfun } in return (Value.of_ext val_ltac1 (Tacinterp.Value.of_closure ist tac)) in let len = List.length ids in if Int.equal len 0 then clos [] else return (Tac2ffi.of_closure (Tac2ffi.abstract len clos)) in let subst s (ids, tac) = (ids, Genintern.substitute Tacarg.wit_tactic s tac) in let print env (ids, tac) = let ids = if List.is_empty ids then mt () else pr_sequence Id.print ids ++ str " |- " in str "ltac1val:(" ++ ids++ Ltac_plugin.Pptactic.pr_glob_tactic env tac ++ str ")" in let obj = { ml_intern = intern; ml_subst = subst; ml_interp = interp; ml_print = print; } in define_ml_object Tac2quote.wit_ltac1val obj (** Ltac2 in terms *) let () = let interp ist poly env sigma concl (ids, tac) = (* Syntax prevents bound variables in constr quotations *) let () = assert (List.is_empty ids) in let ist = Tac2interp.get_env ist in let tac = Proofview.tclIGNORE (Tac2interp.interp ist tac) in let name, poly = Id.of_string "ltac2", poly in let c, sigma = Pfedit.refine_by_tactic ~name ~poly env sigma concl tac in (EConstr.of_constr c, sigma) in GlobEnv.register_constr_interp0 wit_ltac2 interp let () = let interp ist poly env sigma concl id = let ist = Tac2interp.get_env ist in let c = Id.Map.find id ist.env_ist in let c = Value.to_constr c in let sigma = Typing.check env sigma c concl in (c, sigma) in GlobEnv.register_constr_interp0 wit_ltac2_quotation interp let () = let pr_raw id = Genprint.PrinterBasic (fun _env _sigma -> mt ()) in let pr_glb id = Genprint.PrinterBasic (fun _env _sigma -> str "$" ++ Id.print id) in let pr_top _ = Genprint.TopPrinterBasic mt in Genprint.register_print0 wit_ltac2_quotation pr_raw pr_glb pr_top (** Ltac2 in Ltac1 *) let () = let e = Tac2entries.Pltac.tac2expr_in_env in let inject (loc, v) = Ltac_plugin.Tacexpr.TacGeneric (in_gen (rawwit wit_ltac2) v) in Ltac_plugin.Tacentries.create_ltac_quotation "ltac2" inject (e, None) (* Ltac1 runtime representation of Ltac2 closure quotations *) let typ_ltac2 : (Id.t list * glb_tacexpr) Geninterp.Val.typ = Geninterp.Val.create "ltac2:ltac2_eval" let ltac2_eval = let open Ltac_plugin in let ml_name = { Tacexpr.mltac_plugin = "ltac2"; mltac_tactic = "ltac2_eval"; } in let eval_fun args ist = match args with | [] -> assert false | tac :: args -> (* By convention the first argument is the tactic being applied, the rest being the arguments it should be fed with *) let Geninterp.Val.Dyn (tag, tac) = tac in let (ids, tac) : Id.t list * glb_tacexpr = match Geninterp.Val.eq tag typ_ltac2 with | None -> assert false | Some Refl -> tac in let fold accu id = match Id.Map.find id ist.Geninterp.lfun with | v -> Id.Map.add id (Tac2ffi.of_ext val_ltac1 v) accu | exception Not_found -> assert false in let env_ist = List.fold_left fold Id.Map.empty ids in Proofview.tclIGNORE (Tac2interp.interp { env_ist } tac) in let () = Tacenv.register_ml_tactic ml_name [|eval_fun|] in { Tacexpr.mltac_name = ml_name; mltac_index = 0 } let () = let open Ltac_plugin in let open Tacinterp in let interp ist (ids, tac as self) = match ids with | [] -> (* Evaluate the Ltac2 quotation eagerly *) let idtac = Value.of_closure { ist with lfun = Id.Map.empty } (Tacexpr.TacId []) in let ist = { env_ist = Id.Map.empty } in Tac2interp.interp ist tac >>= fun _ -> Ftactic.return idtac | _ :: _ -> (* Return a closure [@f := {blob} |- fun ids => ltac2_eval(f, ids) ] *) (* This name cannot clash with Ltac2 variables which are all lowercase *) let self_id = Id.of_string "F" in let nas = List.map (fun id -> Name id) ids in let mk_arg id = Tacexpr.Reference (Locus.ArgVar (CAst.make id)) in let args = List.map mk_arg ids in let clos = Tacexpr.TacFun (nas, Tacexpr.TacML (CAst.make (ltac2_eval, mk_arg self_id :: args))) in let self = Geninterp.Val.inject (Geninterp.Val.Base typ_ltac2) self in let ist = { ist with lfun = Id.Map.singleton self_id self } in Ftactic.return (Value.of_closure ist clos) in Geninterp.register_interp0 wit_ltac2 interp let () = let pr_raw _ = Genprint.PrinterBasic (fun _env _sigma -> mt ()) in let pr_glb (ids, e) = let ids = if List.is_empty ids then mt () else pr_sequence Id.print ids ++ str " |- " in Genprint.PrinterBasic Pp.(fun _env _sigma -> ids ++ Tac2print.pr_glbexpr e) in let pr_top _ = Genprint.TopPrinterBasic mt in Genprint.register_print0 wit_ltac2 pr_raw pr_glb pr_top (** Built-in notation scopes *) let add_scope s f = Tac2entries.register_scope (Id.of_string s) f let rec pr_scope = let open CAst in function | SexprStr {v=s} -> qstring s | SexprInt {v=n} -> Pp.int n | SexprRec (_, {v=na}, args) -> let na = match na with | None -> str "_" | Some id -> Id.print id in na ++ str "(" ++ prlist_with_sep (fun () -> str ", ") pr_scope args ++ str ")" let scope_fail s args = let args = str "(" ++ prlist_with_sep (fun () -> str ", ") pr_scope args ++ str ")" in CErrors.user_err (str "Invalid arguments " ++ args ++ str " in scope " ++ str s) let q_unit = CAst.make @@ CTacCst (AbsKn (Tuple 0)) let add_generic_scope s entry arg = let parse = function | [] -> let scope = Extend.Aentry entry in let act x = CAst.make @@ CTacExt (arg, x) in Tac2entries.ScopeRule (scope, act) | arg -> scope_fail s arg in add_scope s parse open CAst let () = add_scope "keyword" begin function | [SexprStr {loc;v=s}] -> let scope = Extend.Atoken (Tok.PKEYWORD s) in Tac2entries.ScopeRule (scope, (fun _ -> q_unit)) | arg -> scope_fail "keyword" arg end let () = add_scope "terminal" begin function | [SexprStr {loc;v=s}] -> let scope = Extend.Atoken (CLexer.terminal s) in Tac2entries.ScopeRule (scope, (fun _ -> q_unit)) | arg -> scope_fail "terminal" arg end let () = add_scope "list0" begin function | [tok] -> let Tac2entries.ScopeRule (scope, act) = Tac2entries.parse_scope tok in let scope = Extend.Alist0 scope in let act l = Tac2quote.of_list act l in Tac2entries.ScopeRule (scope, act) | [tok; SexprStr {v=str}] -> let Tac2entries.ScopeRule (scope, act) = Tac2entries.parse_scope tok in let sep = Extend.Atoken (CLexer.terminal str) in let scope = Extend.Alist0sep (scope, sep) in let act l = Tac2quote.of_list act l in Tac2entries.ScopeRule (scope, act) | arg -> scope_fail "list0" arg end let () = add_scope "list1" begin function | [tok] -> let Tac2entries.ScopeRule (scope, act) = Tac2entries.parse_scope tok in let scope = Extend.Alist1 scope in let act l = Tac2quote.of_list act l in Tac2entries.ScopeRule (scope, act) | [tok; SexprStr {v=str}] -> let Tac2entries.ScopeRule (scope, act) = Tac2entries.parse_scope tok in let sep = Extend.Atoken (CLexer.terminal str) in let scope = Extend.Alist1sep (scope, sep) in let act l = Tac2quote.of_list act l in Tac2entries.ScopeRule (scope, act) | arg -> scope_fail "list1" arg end let () = add_scope "opt" begin function | [tok] -> let Tac2entries.ScopeRule (scope, act) = Tac2entries.parse_scope tok in let scope = Extend.Aopt scope in let act opt = match opt with | None -> CAst.make @@ CTacCst (AbsKn (Other Core.c_none)) | Some x -> CAst.make @@ CTacApp (CAst.make @@ CTacCst (AbsKn (Other Core.c_some)), [act x]) in Tac2entries.ScopeRule (scope, act) | arg -> scope_fail "opt" arg end let () = add_scope "self" begin function | [] -> let scope = Extend.Aself in let act tac = tac in Tac2entries.ScopeRule (scope, act) | arg -> scope_fail "self" arg end let () = add_scope "next" begin function | [] -> let scope = Extend.Anext in let act tac = tac in Tac2entries.ScopeRule (scope, act) | arg -> scope_fail "next" arg end let () = add_scope "tactic" begin function | [] -> (* Default to level 5 parsing *) let scope = Extend.Aentryl (tac2expr, "5") in let act tac = tac in Tac2entries.ScopeRule (scope, act) | [SexprInt {loc;v=n}] as arg -> let () = if n < 0 || n > 6 then scope_fail "tactic" arg in let scope = Extend.Aentryl (tac2expr, string_of_int n) in let act tac = tac in Tac2entries.ScopeRule (scope, act) | arg -> scope_fail "tactic" arg end let () = add_scope "thunk" begin function | [tok] -> let Tac2entries.ScopeRule (scope, act) = Tac2entries.parse_scope tok in let act e = Tac2quote.thunk (act e) in Tac2entries.ScopeRule (scope, act) | arg -> scope_fail "thunk" arg end let () = add_scope "constr" (fun arg -> let delimiters = List.map (function | SexprRec (_, { v = Some s }, []) -> s | _ -> scope_fail "constr" arg) arg in let act e = Tac2quote.of_constr ~delimiters e in Tac2entries.ScopeRule (Extend.Aentry Pcoq.Constr.constr, act) ) let add_expr_scope name entry f = add_scope name begin function | [] -> Tac2entries.ScopeRule (Extend.Aentry entry, f) | arg -> scope_fail name arg end let () = add_expr_scope "ident" q_ident (fun id -> Tac2quote.of_anti Tac2quote.of_ident id) let () = add_expr_scope "bindings" q_bindings Tac2quote.of_bindings let () = add_expr_scope "with_bindings" q_with_bindings Tac2quote.of_bindings let () = add_expr_scope "intropattern" q_intropattern Tac2quote.of_intro_pattern let () = add_expr_scope "intropatterns" q_intropatterns Tac2quote.of_intro_patterns let () = add_expr_scope "destruction_arg" q_destruction_arg Tac2quote.of_destruction_arg let () = add_expr_scope "induction_clause" q_induction_clause Tac2quote.of_induction_clause let () = add_expr_scope "conversion" q_conversion Tac2quote.of_conversion let () = add_expr_scope "rewriting" q_rewriting Tac2quote.of_rewriting let () = add_expr_scope "clause" q_clause Tac2quote.of_clause let () = add_expr_scope "hintdb" q_hintdb Tac2quote.of_hintdb let () = add_expr_scope "occurrences" q_occurrences Tac2quote.of_occurrences let () = add_expr_scope "dispatch" q_dispatch Tac2quote.of_dispatch let () = add_expr_scope "strategy" q_strategy_flag Tac2quote.of_strategy_flag let () = add_expr_scope "reference" q_reference Tac2quote.of_reference let () = add_expr_scope "move_location" q_move_location Tac2quote.of_move_location let () = add_expr_scope "pose" q_pose Tac2quote.of_pose let () = add_expr_scope "assert" q_assert Tac2quote.of_assertion let () = add_expr_scope "constr_matching" q_constr_matching Tac2quote.of_constr_matching let () = add_expr_scope "goal_matching" q_goal_matching Tac2quote.of_goal_matching let () = add_generic_scope "open_constr" Pcoq.Constr.constr Tac2quote.wit_open_constr let () = add_generic_scope "pattern" Pcoq.Constr.constr Tac2quote.wit_pattern (** seq scope, a bit hairy *) open Extend exception SelfSymbol let rec generalize_symbol : type a tr s. (s, tr, a) Extend.symbol -> (s, Extend.norec, a) Extend.symbol = function | Atoken tok -> Atoken tok | Alist1 e -> Alist1 (generalize_symbol e) | Alist1sep (e, sep) -> let e = generalize_symbol e in let sep = generalize_symbol sep in Alist1sep (e, sep) | Alist0 e -> Alist0 (generalize_symbol e) | Alist0sep (e, sep) -> let e = generalize_symbol e in let sep = generalize_symbol sep in Alist0sep (e, sep) | Aopt e -> Aopt (generalize_symbol e) | Aself -> raise SelfSymbol | Anext -> raise SelfSymbol | Aentry e -> Aentry e | Aentryl (e, l) -> Aentryl (e, l) | Arules r -> Arules r type _ converter = | CvNil : (Loc.t -> raw_tacexpr) converter | CvCns : 'act converter * ('a -> raw_tacexpr) option -> ('a -> 'act) converter let rec apply : type a. a converter -> raw_tacexpr list -> a = function | CvNil -> fun accu loc -> Tac2quote.of_tuple ~loc accu | CvCns (c, None) -> fun accu x -> apply c accu | CvCns (c, Some f) -> fun accu x -> apply c (f x :: accu) type seqrule = | Seqrule : (Tac2expr.raw_tacexpr, Extend.norec, 'act, Loc.t -> raw_tacexpr) rule * 'act converter -> seqrule let rec make_seq_rule = function | [] -> Seqrule (Stop, CvNil) | tok :: rem -> let Tac2entries.ScopeRule (scope, f) = Tac2entries.parse_scope tok in let scope = generalize_symbol scope in let Seqrule (r, c) = make_seq_rule rem in let r = NextNoRec (r, scope) in let f = match tok with | SexprStr _ -> None (* Leave out mere strings *) | _ -> Some f in Seqrule (r, CvCns (c, f)) let () = add_scope "seq" begin fun toks -> let scope = try let Seqrule (r, c) = make_seq_rule (List.rev toks) in Arules [Rules (r, apply c [])] with SelfSymbol -> CErrors.user_err (str "Recursive symbols (self / next) are not allowed in local rules") in Tac2entries.ScopeRule (scope, (fun e -> e)) end