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
|
(************************************************************************)
(* * The Rocq Prover / The Rocq Development Team *)
(* v * Copyright INRIA, CNRS and contributors *)
(* <O___,, * (see version control and CREDITS file for authors & dates) *)
(* \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 Pp
open CErrors
open Util
open Names
open Libobject
open Genarg
open Extend
open Procq
open Egramml
open Vernacexpr
open Libnames
open Nameops
type 'a grammar_tactic_prod_item_expr = 'a Pptactic.grammar_tactic_prod_item_expr =
| TacTerm of string
| TacNonTerm of ('a * Names.Id.t option) Loc.located
type raw_argument = string * string option
type argument = Genarg.ArgT.any Extend.user_symbol
(**********************************************************************)
(* Interpret entry names of the form "ne_constr_list" as entry keys *)
let atactic n =
Procq.Symbol.nterml Pltac.ltac_expr (string_of_int n)
type entry_name = EntryName :
'a raw_abstract_argument_type * (Tacexpr.raw_tactic_expr, _, 'a) Procq.Symbol.t -> entry_name
(** Quite ad-hoc *)
let get_tacentry n m =
let check_lvl n =
Int.equal m n
&& not (Int.equal m 0) (* Because tactic0 is at simple_tactic *)
in
if check_lvl n then EntryName (rawwit Tacarg.wit_tactic, Procq.Symbol.self)
else if check_lvl (n + 1) then EntryName (rawwit Tacarg.wit_tactic, Procq.Symbol.next)
else EntryName (rawwit Tacarg.wit_tactic, atactic n)
let get_separator = function
| None -> user_err Pp.(str "Missing separator.")
| Some sep -> sep
let check_separator ?loc = function
| None -> ()
| Some _ -> user_err ?loc (str "Separator is only for arguments with suffix _list_sep.")
let rec parse_user_entry ?loc s sep =
let open CString in
let matches pre suf s =
String.length s > (String.length pre + String.length suf) &&
is_prefix pre s && is_suffix suf s
in
let basename pre suf s =
let plen = String.length pre in
String.sub s plen (String.length s - (plen + String.length suf))
in
let tactic_len = String.length "tactic" in
if matches "ne_" "_list" s then
let entry = parse_user_entry ?loc (basename "ne_" "_list" s) None in
check_separator ?loc sep;
Ulist1 entry
else if matches "ne_" "_list_sep" s then
let entry = parse_user_entry ?loc (basename "ne_" "_list_sep" s) None in
Ulist1sep (entry, get_separator sep)
else if matches "" "_list" s then
let entry = parse_user_entry ?loc (basename "" "_list" s) None in
check_separator ?loc sep;
Ulist0 entry
else if matches "" "_list_sep" s then
let entry = parse_user_entry ?loc (basename "" "_list_sep" s) None in
Ulist0sep (entry, get_separator sep)
else if matches "" "_opt" s then
let entry = parse_user_entry ?loc (basename "" "_opt" s) None in
check_separator ?loc sep;
Uopt entry
else if String.length s = tactic_len + 1 && is_prefix "tactic" s
&& '5' >= s.[tactic_len] && s.[tactic_len] >= '0' then
let n = Char.code s.[tactic_len] - Char.code '0' in
check_separator ?loc sep;
Uentryl ("tactic", n)
else
let _ = check_separator ?loc sep in
Uentry s
let interp_entry_name interp symb =
let rec eval = function
| Ulist1 e -> Ulist1 (eval e)
| Ulist1sep (e, sep) -> Ulist1sep (eval e, sep)
| Ulist0 e -> Ulist0 (eval e)
| Ulist0sep (e, sep) -> Ulist0sep (eval e, sep)
| Uopt e -> Uopt (eval e)
| Uentry s -> Uentry (interp s None)
| Uentryl (s, n) -> Uentryl (interp s (Some n), n)
in
eval symb
(**********************************************************************)
(** Grammar declaration for Tactic Notation (Rocq level) *)
let get_tactic_entry n =
if Int.equal n 0 then
Pltac.simple_tactic, None
else if 1<=n && n<=5 then
Pltac.ltac_expr, Some (string_of_int n)
else
user_err Pp.(str ("Invalid Tactic Notation level: "^(string_of_int n)^"."))
(**********************************************************************)
(** State of the grammar extensions *)
type tactic_grammar = {
tacgram_level : int;
tacgram_prods : Pptactic.grammar_terminals;
}
(* Declaration of the tactic grammar rule *)
let head_is_ident tg = match tg.tacgram_prods with
| TacTerm _ :: _ -> true
| _ -> false
let rec prod_item_of_symbol lev = function
| Extend.Ulist1 s ->
let EntryName (Rawwit typ, e) = prod_item_of_symbol lev s in
EntryName (Rawwit (ListArg typ), Procq.Symbol.list1 e)
| Extend.Ulist0 s ->
let EntryName (Rawwit typ, e) = prod_item_of_symbol lev s in
EntryName (Rawwit (ListArg typ), Procq.Symbol.list0 e)
| Extend.Ulist1sep (s, sep) ->
let EntryName (Rawwit typ, e) = prod_item_of_symbol lev s in
EntryName (Rawwit (ListArg typ), Procq.Symbol.list1sep e (Procq.Symbol.tokens [Procq.TPattern (Procq.terminal sep)]) false)
| Extend.Ulist0sep (s, sep) ->
let EntryName (Rawwit typ, e) = prod_item_of_symbol lev s in
EntryName (Rawwit (ListArg typ), Procq.Symbol.list0sep e (Procq.Symbol.tokens [Procq.TPattern (Procq.terminal sep)]) false)
| Extend.Uopt s ->
let EntryName (Rawwit typ, e) = prod_item_of_symbol lev s in
EntryName (Rawwit (OptArg typ), Procq.Symbol.opt e)
| Extend.Uentry arg ->
let ArgT.Any tag = arg in
let wit = ExtraArg tag in
EntryName (Rawwit wit, Procq.Symbol.nterm (genarg_grammar wit))
| Extend.Uentryl (s, n) ->
let ArgT.Any tag = s in
assert (CString.is_suffix "tactic" (ArgT.repr tag));
get_tacentry n lev
(** Tactic grammar extensions *)
let add_tactic_entry (kn, ml, tg) state =
let open Tacexpr in
let entry, pos = get_tactic_entry tg.tacgram_level in
let mkact loc l =
let map arg =
(* HACK to handle especially the tactic(...) entry *)
let wit = Genarg.rawwit Tacarg.wit_tactic in
if Genarg.has_type arg wit && not ml then
Tacexp (Genarg.out_gen wit arg)
else
TacGeneric (None, arg)
in
let l = List.map map l in
(CAst.make ~loc (TacAlias (kn,l)):raw_tactic_expr)
in
let () =
if Int.equal tg.tacgram_level 0 && not (head_is_ident tg) then
user_err Pp.(str "Notation for simple tactic must start with an identifier.")
in
let map = function
| TacTerm s -> GramTerminal s
| TacNonTerm (loc, (s, ido)) ->
let EntryName (typ, e) = prod_item_of_symbol tg.tacgram_level s in
GramNonTerminal (Loc.tag ?loc @@ (typ, e))
in
let prods = List.map map tg.tacgram_prods in
let rules = make_rule mkact prods in
let r = ExtendRule (entry, Procq.Reuse (pos, [rules])) in
([r], state)
let tactic_grammar =
create_grammar_command "TacticGrammar" { gext_fun = add_tactic_entry; gext_eq = (==) (* FIXME *) }
let extend_tactic_grammar kn ml ntn = extend_grammar_command tactic_grammar (kn, ml, ntn)
(**********************************************************************)
(* Tactic Notation *)
let entry_names = ref String.Map.empty
let register_tactic_notation_entry name entry =
let entry = match entry with
| ExtraArg arg -> ArgT.Any arg
| _ -> assert false
in
entry_names := String.Map.add name entry !entry_names
let interp_prod_item = function
| TacTerm s -> TacTerm s
| TacNonTerm (loc, ((nt, sep), ido)) ->
let symbol = parse_user_entry ?loc nt sep in
let interp s = function
| None ->
if String.Map.mem s !entry_names then String.Map.find s !entry_names
else begin match ArgT.name s with
| None ->
if s = "var" then user_err Pp.(str ("var is deprecated, use hyp.")) (* to remove in 8.14 *)
else user_err Pp.(str ("Unknown entry "^s^"."))
| Some arg -> arg
end
| Some n ->
(* FIXME: do better someday *)
assert (String.equal s "tactic");
begin match Tacarg.wit_tactic with
| ExtraArg tag -> ArgT.Any tag
end
in
let symbol = interp_entry_name interp symbol in
TacNonTerm (loc, (symbol, ido))
let make_fresh_key =
let id = Summary.ref ~stage:Summary.Stage.Synterp ~name:"TACTIC-NOTATION-COUNTER" 0 in
fun prods ->
let cur = incr id; !id in
let map = function
| TacTerm s -> s
| TacNonTerm _ -> "#"
in
let prods = String.concat "_" (List.map map prods) in
(* We embed the hash of the kernel name in the label so that the identifier
should be mostly unique. This ensures that including two modules
together won't confuse the corresponding labels. *)
let hash = (cur lxor (ModPath.hash (Lib.current_mp ()))) land 0x7FFFFFFF in
let lbl = Id.of_string_soft (Printf.sprintf "%s_%08X" prods hash) in
Lib.make_kn lbl
type tactic_grammar_obj = {
tacobj_key : KerName.t;
tacobj_local : locality_flag;
tacobj_tacgram : tactic_grammar;
tacobj_forml : bool;
}
let pprule pa = {
Pptactic.pptac_level = pa.tacgram_level;
pptac_prods = pa.tacgram_prods;
}
let check_key key =
if Tacenv.check_alias key then
user_err Pp.(str "Conflicting tactic notations keys. This can happen when including \
twice the same module.")
let cache_tactic_notation (tobj, body) =
let key = tobj.tacobj_key in
let () = check_key key in
Tacenv.register_alias key body
let load_tactic_notation i (tobj, body) =
let key = tobj.tacobj_key in
let () = check_key key in
(* Only add the printing and interpretation rules. *)
Tacenv.register_alias key body
let subst_tactic_notation (subst, (tobj, body)) =
let open Tacenv in
{ tobj with
tacobj_key = Mod_subst.subst_kn subst tobj.tacobj_key
},
{ body with alias_body = Tacsubst.subst_tactic subst body.alias_body }
let classify_tactic_notation tacobj = Substitute
let ltac_notation_cat = Libobject.create_category "ltac.notations"
let inTacticGrammar : tactic_grammar_obj * Tacenv.alias_tactic -> obj =
declare_object {(default_object "TacticGrammar") with
(* no open_function for the interp side of tactic notations *)
load_function = load_tactic_notation;
cache_function = cache_tactic_notation;
subst_function = subst_tactic_notation;
classify_function = classify_tactic_notation}
let cache_tactic_syntax tobj =
let key = tobj.tacobj_key in
extend_tactic_grammar key tobj.tacobj_forml tobj.tacobj_tacgram;
Pptactic.declare_notation_tactic_pprule key (pprule tobj.tacobj_tacgram)
let open_tactic_syntax tobj =
let key = tobj.tacobj_key in
if not tobj.tacobj_local then
extend_tactic_grammar key tobj.tacobj_forml tobj.tacobj_tacgram
let load_tactic_syntax i tobj =
let key = tobj.tacobj_key in
(* Only add the printing and interpretation rules. *)
Pptactic.declare_notation_tactic_pprule key (pprule tobj.tacobj_tacgram);
if Int.equal i 1 && not tobj.tacobj_local then
extend_tactic_grammar key tobj.tacobj_forml tobj.tacobj_tacgram
let subst_tactic_syntax (subst, tobj) =
{ tobj with
tacobj_key = Mod_subst.subst_kn subst tobj.tacobj_key
}
(* why do we not Drop when local? *)
let classify_tactic_syntax tacobj = Substitute
let inTacticSyntax : tactic_grammar_obj -> obj =
declare_object {(default_object "TacticSyntax") with
object_stage = Summary.Stage.Synterp;
open_function = simple_open ~cat:ltac_notation_cat open_tactic_syntax;
load_function = load_tactic_syntax;
cache_function = cache_tactic_syntax;
subst_function = subst_tactic_syntax;
classify_function = classify_tactic_syntax}
let cons_production_parameter = function
| TacTerm _ -> None
| TacNonTerm (_, (_, ido)) -> ido
let add_glob_tactic_notation ?deprecation tacobj ids tac =
let open Tacenv in
let body =
{ alias_args = ids; alias_body = tac; alias_deprecation = deprecation } in
Lib.add_leaf (inTacticGrammar (tacobj, body))
let add_glob_tactic_notation_syntax local ~level ?deprecation prods forml =
let parule = {
tacgram_level = level;
tacgram_prods = prods;
} in
let tacobj = {
tacobj_key = make_fresh_key prods;
tacobj_local = local;
tacobj_tacgram = parule;
tacobj_forml = forml;
} in
Lib.add_leaf (inTacticSyntax tacobj);
tacobj
let add_tactic_notation ?deprecation tacobj e =
let ids = List.map_filter cons_production_parameter tacobj.tacobj_tacgram.tacgram_prods in
let tac = Tacintern.glob_tactic_env ids (Global.env()) e in
add_glob_tactic_notation ?deprecation tacobj ids tac
let add_tactic_notation_syntax local n ?deprecation prods =
let prods = List.map interp_prod_item prods in
add_glob_tactic_notation_syntax local ~level:n ?deprecation prods false
(**********************************************************************)
(* ML Tactic entries *)
exception NonEmptyArgument
(** ML tactic notations whose use can be restricted to an identifier are added
as true Ltac entries. *)
let extend_atomic_tactic name entries =
let open Tacexpr in
let map_prod prods =
let (hd, rem) = match prods with
| TacTerm s :: rem -> (s, rem)
| _ -> assert false (* Not handled by the ML extension syntax *)
in
let empty_value = function
| TacTerm s -> raise NonEmptyArgument
| TacNonTerm (_, (symb, _)) ->
let EntryName (typ, e) = prod_item_of_symbol 0 symb in
let Genarg.Rawwit wit = typ in
let inj x = CAst.make @@ TacArg ( TacGeneric (None, Genarg.in_gen typ x)) in
let default = epsilon_value inj e in
match default with
| None -> raise NonEmptyArgument
| Some def -> Tacintern.intern_tactic_or_tacarg (Genintern.empty_glob_sign ~strict:true Environ.empty_env) def
in
try Some (hd, List.map empty_value rem) with NonEmptyArgument -> None
in
let entries = List.map map_prod entries in
let add_atomic i args = match args with
| None -> ()
| Some (id, args) ->
let args = List.map (fun a -> Tacexp a) args in
let entry = { mltac_name = name; mltac_index = i } in
let body = CAst.make (TacML (entry, args)) in
Tacenv.register_ltac false false (Names.Id.of_string id) body
in
List.iteri add_atomic entries
let add_ml_tactic_notation name ~level ?deprecation prods =
let len = List.length prods in
let iter i prods =
let open Tacexpr in
let get_id = function
| TacTerm s -> None
| TacNonTerm (_, (_, ido)) -> ido
in
let ids = List.map_filter get_id prods in
let entry = { mltac_name = name; mltac_index = len - i - 1 } in
let map id = Reference (Locus.ArgVar (CAst.make id)) in
let tac = CAst.make (TacML (entry, List.map map ids)) in
let tacobj = add_glob_tactic_notation_syntax false ~level ?deprecation prods true in
add_glob_tactic_notation ?deprecation tacobj ids tac
in
List.iteri iter (List.rev prods);
(* We call [extend_atomic_tactic] only for "basic tactics" (the ones
at ltac_expr level 0) *)
if Int.equal level 0 then extend_atomic_tactic name prods
(**********************************************************************)
(** Ltac quotations *)
let ltac_quotations = ref String.Set.empty
let create_ltac_quotation ~plugin name cast (e, l) =
let () =
if String.Set.mem name !ltac_quotations then
failwith ("Ltac quotation " ^ name ^ " already registered")
in
let () = ltac_quotations := String.Set.add name !ltac_quotations in
let entry = match l with
| None -> Procq.Symbol.nterm e
| Some l -> Procq.Symbol.nterml e (string_of_int l)
in
let rule =
Procq.(
Rule.next
(Rule.next
(Rule.next
(Rule.next
(Rule.next
Rule.stop
(Symbol.token (Procq.terminal name)))
(Symbol.token (Procq.terminal ":")))
(Symbol.token (Procq.terminal "(")))
entry)
(Symbol.token (Procq.terminal ")")))
in
let action _ v _ _ _ loc = cast (Some loc, v) in
let gram = [Procq.Production.make rule action] in
let plugin_uid = (plugin, "tacquot:"^name) in
Egramml.grammar_extend ~plugin_uid Pltac.tactic_value (Procq.Reuse (None, gram))
(** Command *)
let is_defined_tac kn =
try ignore (Tacenv.interp_ltac kn); true with Not_found -> false
let warn_unusable_identifier =
CWarnings.create ~name:"unusable-identifier" ~category:CWarnings.CoreCategories.parsing
(fun id -> strbrk "The Ltac name" ++ spc () ++ Id.print id ++ spc () ++
strbrk "may be unusable because of a conflict with a notation.")
let register_ltac atts = function
| [Tacexpr.TacticRedefinition (qid, body)] ->
let local = Attributes.(parse explicit_hint_locality atts) in
let local = match local with
| Some local -> Locality.check_locality_nodischarge local; [local]
| None -> if Lib.sections_are_opened () then [Local] else [SuperGlobal; Export]
in
let kn =
try Tacenv.locate_tactic qid
with Not_found ->
CErrors.user_err ?loc:qid.CAst.loc
(str "There is no Ltac named " ++ pr_qualid qid ++ str ".")
in
let ist = Tacintern.make_empty_glob_sign ~strict:true in
let body = Tacintern.intern_tactic_or_tacarg ist body in
local |> List.iter (fun local -> Tacenv.redefine_ltac local kn body);
let name = Tacenv.shortest_qualid_of_tactic kn in
Flags.if_verbose Feedback.msg_info (Libnames.pr_qualid name ++ str " is redefined")
| tacl ->
let local, deprecation = Attributes.(parse Attributes.Notations.(locality ++ deprecation) atts) in
let local = Locality.make_module_locality local in
let map = function
| Tacexpr.TacticDefinition ({CAst.loc;v=id}, body) ->
let kn = Lib.make_kn id in
let id_pp = Id.print id in
let () = if is_defined_tac kn then
CErrors.user_err ?loc
(str "There is already an Ltac named " ++ id_pp ++ str".")
in
let is_shadowed =
try
match Procq.parse_string Pltac.tactic (Id.to_string id) with
| { CAst.v=(Tacexpr.TacArg _) } -> false
| _ -> true (* most probably TacAtom, i.e. a primitive tactic ident *)
with e when CErrors.noncritical e -> true (* prim tactics with args, e.g. "apply" *)
in
let () = if is_shadowed then warn_unusable_identifier id in
id, body
| Tacexpr.TacticRedefinition (qid, body) ->
CErrors.user_err Pp.(str "Ltac redefinitions not supported in a mutual block.")
in
let rfun = List.map map tacl in
let ist = Tacintern.make_empty_glob_sign ~strict:true in
let map (name, body) =
let body = Tacintern.intern_tactic_or_tacarg ist body in
(name, body)
in
let defs () =
(* Register locally the tactic to handle recursivity. This
function affects the whole environment, so that we transactify
it afterwards. *)
let iter_rec (id, _) =
let sp, kn = Lib.make_foname id in
Tacenv.push_tactic (Nametab.Until 1) sp kn
in
let () = List.iter iter_rec rfun in
List.map map rfun
in
let defs = Vernacstate.System.protect defs () in
let iter (id, tac) =
Tacenv.register_ltac false local id tac ?deprecation;
Flags.if_verbose Feedback.msg_info (Id.print id ++ str " is defined")
in
List.iter iter defs
(** Queries *)
let print_ltacs () =
let entries = KNmap.bindings (Tacenv.ltac_entries ()) in
let sort (kn1, _) (kn2, _) = KerName.compare kn1 kn2 in
let entries = List.sort sort entries in
let map (kn, entry) =
let qid =
try Some (Tacenv.shortest_qualid_of_tactic kn)
with Not_found -> None
in
match qid with
| None -> None
| Some qid -> Some (qid, entry.Tacenv.tac_body)
in
let entries = List.map_filter map entries in
let pr_entry (qid, body) =
let (l, t) = match body with
| {CAst.v=(Tacexpr.TacFun (l, t))} -> (l, t)
| _ -> ([], body)
in
let pr_ltac_fun_arg n = spc () ++ Name.print n in
hov 2 (pr_qualid qid ++ prlist pr_ltac_fun_arg l)
in
Feedback.msg_notice (prlist_with_sep fnl pr_entry entries)
let locatable_ltac = "Ltac"
let split_ltac_fun = function
| {CAst.v=(Tacexpr.TacFun (l, t))} -> (l,t)
| t -> ([],t)
let pr_ltac_fun_arg n = spc () ++ Name.print n
let print_ltac_body qid tac =
let redefined = match tac.Tacenv.tac_redef with
| [] -> mt ()
| mods ->
let pr_one mp =
let qid = try Nametab.shortest_qualid_of_module mp
with Not_found ->
try Nametab.shortest_qualid_of_dir (DirOpenModule mp)
with Not_found -> Nametab.shortest_qualid_of_dir (DirOpenModtype mp)
in
pr_qualid qid
in
let redef = prlist_with_sep fnl pr_one mods in
fnl () ++ str "Redefined by:" ++ fnl () ++ redef
in
let l,t = split_ltac_fun tac.Tacenv.tac_body in
hv 2 (
hov 2 (str "Ltac" ++ spc() ++ pr_qualid qid ++
prlist pr_ltac_fun_arg l ++ spc () ++ str ":=")
++ spc() ++ Pptactic.pr_glob_tactic (Global.env ()) t) ++ redefined
let () =
let open Prettyp in
let locate qid = try Some (qid, Tacenv.locate_tactic qid) with Not_found -> None in
let locate_all qid = List.map (fun kn -> (qid,kn)) (Tacenv.locate_extended_all_tactic qid) in
let shortest_qualid (qid,kn) = Tacenv.shortest_qualid_of_tactic kn in
let name (qid,kn) = str "Ltac" ++ spc () ++ pr_path (Tacenv.path_of_tactic kn) in
let print (qid,kn) =
let entries = Tacenv.ltac_entries () in
let tac = KNmap.find kn entries in
print_ltac_body qid tac in
let about = name in
register_locatable locatable_ltac {
locate;
locate_all;
shortest_qualid;
name;
print;
about;
}
let print_located_tactic qid =
Feedback.msg_notice (Prettyp.print_located_other (Global.env ()) locatable_ltac qid)
let print_ltac id =
try
let kn = Tacenv.locate_tactic id in
let entries = Tacenv.ltac_entries () in
let tac = KNmap.find kn entries in
print_ltac_body id tac
with
Not_found ->
user_err
(pr_qualid id ++ spc() ++ str "is not a user defined tactic.")
(** Grammar *)
let () =
let open Procq.Entry in
let entries = [
Any Pltac.ltac_expr;
Any Pltac.simple_tactic;
Any Pltac.tactic_value;
] in
register_grammars_by_name "tactic" entries
let get_identifier i =
(* Workaround for badly-designed generic arguments lacking a closure *)
Names.Id.of_string_soft (Printf.sprintf "$%i" i)
type _ ty_sig =
| TyNil : (Geninterp.interp_sign -> unit Proofview.tactic) ty_sig
| TyIdent : string * 'r ty_sig -> 'r ty_sig
| TyArg : ('a, 'b, 'c) Extend.ty_user_symbol * 'r ty_sig -> ('c -> 'r) ty_sig
type ty_ml = TyML : 'r ty_sig * 'r -> ty_ml
let rec untype_user_symbol : type a b c. (a,b,c) ty_user_symbol -> Genarg.ArgT.any user_symbol = fun tu ->
match tu with
| TUlist1 l -> Ulist1(untype_user_symbol l)
| TUlist1sep(l,s) -> Ulist1sep(untype_user_symbol l, s)
| TUlist0 l -> Ulist0(untype_user_symbol l)
| TUlist0sep(l,s) -> Ulist0sep(untype_user_symbol l, s)
| TUopt(o) -> Uopt(untype_user_symbol o)
| TUentry a -> Uentry (Genarg.ArgT.Any a)
| TUentryl (a,i) -> Uentryl (Genarg.ArgT.Any a,i)
let rec clause_of_sign : type a. int -> a ty_sig -> Genarg.ArgT.any Extend.user_symbol grammar_tactic_prod_item_expr list =
fun i sign -> match sign with
| TyNil -> []
| TyIdent (s, sig') -> TacTerm s :: clause_of_sign i sig'
| TyArg (a, sig') ->
let id = Some (get_identifier i) in
TacNonTerm (None, (untype_user_symbol a, id)) :: clause_of_sign (i + 1) sig'
let clause_of_ty_ml = function
| TyML (t,_) -> clause_of_sign 1 t
let rec eval_sign : type a. a ty_sig -> a -> Geninterp.Val.t list -> Geninterp.interp_sign -> unit Proofview.tactic =
fun sign tac ->
match sign with
| TyNil ->
begin fun vals ist -> match vals with
| [] -> tac ist
| _ :: _ -> assert false
end
| TyIdent (s, sig') -> eval_sign sig' tac
| TyArg (a, sig') ->
let f = eval_sign sig' in
begin fun tac vals ist -> match vals with
| [] -> assert false
| v :: vals ->
let v' = Taccoerce.Value.cast (topwit (Egramml.proj_symbol a)) v in
f (tac v') vals ist
end tac
let eval : ty_ml -> Geninterp.Val.t list -> Geninterp.interp_sign -> unit Proofview.tactic = function
| TyML (t,tac) -> eval_sign t tac
let eval_of_ty_ml = eval
let is_constr_entry = function
| TUentry a -> Option.has_some @@ genarg_type_eq (ExtraArg a) Stdarg.wit_constr
| _ -> false
let rec only_constr : type a. a ty_sig -> bool = function
| TyNil -> true
| TyIdent(_,_) -> false
| TyArg (u, s) -> if is_constr_entry u then only_constr s else false
let rec mk_sign_vars : type a. int -> a ty_sig -> Name.t list = fun i tu -> match tu with
| TyNil -> []
| TyIdent (_,s) -> mk_sign_vars i s
| TyArg (_, s) -> Name (get_identifier i) :: mk_sign_vars (i + 1) s
let dummy_id = Id.of_string "_"
let lift_constr_tac_to_ml_tac vars tac =
let tac _ ist = Proofview.Goal.enter begin fun gl ->
let env = Proofview.Goal.env gl in
let sigma = Tacmach.project gl in
let map = function
| Anonymous -> None
| Name id ->
let c = Id.Map.find id ist.Geninterp.lfun in
try Some (Taccoerce.Value.of_constr @@ Taccoerce.coerce_to_closed_constr env c)
with Taccoerce.CannotCoerceTo ty ->
Taccoerce.error_ltac_variable dummy_id (Some (env,sigma)) c ty
in
let args = List.map_filter map vars in
tac args ist
end in
tac
let tactic_extend plugin_name tacname ~level ?deprecation sign =
let open Tacexpr in
let ml_tactic_name =
{ mltac_tactic = tacname;
mltac_plugin = plugin_name }
in
match sign with
| [TyML (TyIdent (name, s),tac) as ml_tac] when only_constr s ->
(* The extension is only made of a name followed by constr
entries: we do not add any grammar nor printing rule and add it
as a true Ltac definition. *)
let vars = mk_sign_vars 1 s in
let ml = { Tacexpr.mltac_name = ml_tactic_name; Tacexpr.mltac_index = 0 } in
let tac = match s with
| TyNil -> eval ml_tac
(* Special handling of tactics without arguments: such tactics do
not do a Proofview.Goal.nf_enter to compute their arguments. It
matters for some whole-prof tactics like [shelve_unifiable]. *)
| _ -> lift_constr_tac_to_ml_tac vars (eval ml_tac)
in
(* Arguments are not passed directly to the ML tactic in the TacML
node, the ML tactic retrieves its arguments in the [ist]
environment instead. This is the rĂ´le of the
[lift_constr_tac_to_ml_tac] function. *)
let body = CAst.make (Tacexpr.TacFun (vars, CAst.make (Tacexpr.TacML (ml, [])))) in
let id = Names.Id.of_string name in
let obj () = Tacenv.register_ltac true false id body ?deprecation in
let () = Tacenv.register_ml_tactic ml_tactic_name [|tac|] in
Mltop.declare_cache_obj obj plugin_name
| _ ->
let obj () = add_ml_tactic_notation ml_tactic_name ~level ?deprecation (List.map clause_of_ty_ml sign) in
Tacenv.register_ml_tactic ml_tactic_name @@ Array.of_list (List.map eval sign);
Mltop.declare_cache_obj obj plugin_name
type (_, 'a) ml_ty_sig =
| MLTyNil : ('a, 'a) ml_ty_sig
| MLTyArg : ('r, 'a) ml_ty_sig -> (Geninterp.Val.t -> 'r, 'a) ml_ty_sig
let rec ml_sig_len : type r a. (r, a) ml_ty_sig -> int = function
| MLTyNil -> 0
| MLTyArg sign -> 1 + ml_sig_len sign
let rec cast_ml : type r a. (r, a) ml_ty_sig -> r -> Geninterp.Val.t list -> a =
fun sign f ->
match sign with
| MLTyNil ->
begin function
| [] -> f
| _ :: _ -> CErrors.anomaly (str "Arity mismatch")
end
| MLTyArg sign ->
function
| [] -> CErrors.anomaly (str "Arity mismatch")
| arg :: args -> cast_ml sign (f arg) args
let ml_tactic_extend ~plugin ~name ~local ?deprecation sign tac =
let open Tacexpr in
let tac args _ = cast_ml sign tac args in
let ml_tactic_name = { mltac_tactic = name; mltac_plugin = plugin } in
let ml = { mltac_name = ml_tactic_name; mltac_index = 0 } in
let len = ml_sig_len sign in
let args = List.init len (fun i -> Id.of_string (Printf.sprintf "arg%i" i)) in
let vars = List.map (fun id -> Name id) args in
let args = List.map (fun id -> Reference (Locus.ArgVar (CAst.make id))) args in
let body = CAst.make (Tacexpr.TacFun (vars, CAst.make (Tacexpr.TacML (ml, args)))) in
let id = Names.Id.of_string name in
let obj () = Tacenv.register_ltac true local id body ?deprecation in
let () = Tacenv.register_ml_tactic ml_tactic_name [|tac|] in
Mltop.declare_cache_obj obj plugin
module MLName =
struct
open Tacexpr
type t = ml_tactic_name
let compare tac1 tac2 =
let c = String.compare tac1.mltac_tactic tac2.mltac_tactic in
if c = 0 then String.compare tac1.mltac_plugin tac2.mltac_plugin
else c
end
module MLTacMap = Map.Make(MLName)
let ml_table : (Geninterp.Val.t list -> Geninterp.Val.t Ftactic.t) MLTacMap.t ref = ref MLTacMap.empty
type ml_ltac_val = {
tacval_tac : Tacexpr.ml_tactic_name;
tacval_var : Id.t list;
}
let in_tacval =
(* This is a hack to emulate value-returning ML-implemented tactics in Ltac.
We use a dummy generic argument to work around the limitations of the Ltac
runtime. Indeed, the TacML node needs to return unit values, since it is
considered a "tactic" in the runtime. Changing it to allow arbitrary values
would require to toggle this status, and thus to make it a "value" node.
This would in turn create too much backwards incompatibility. Instead, we
piggy back on the TacGeneric node, which by construction is used to return
values.
The trick is to represent a n-ary application of a ML function as a generic
argument. We store in the node the name of the tactic and its arity, while
giving canonical names to the bound variables of the closure. This trick is
already performed in several external developments for specific calls, we
make it here generic. The argument should not be used for other purposes, so
we only export the registering functions.
*)
let wit : (Empty.t, ml_ltac_val, Geninterp.Val.t) Genarg.genarg_type =
Genarg.create_arg "ltac:val"
in
(* No need to internalize this ever *)
let intern_fun _ e = Empty.abort e in
let subst_fun s v = v in
let () = Genintern.register_intern0 wit intern_fun in
let () = Gensubst.register_subst0 wit subst_fun in
(* No need to register a value tag for it via register_val0 since we will
never access this genarg directly. *)
let interp_fun ist tac =
let args = List.map (fun id -> Id.Map.get id ist.Geninterp.lfun) tac.tacval_var in
let tac = MLTacMap.get tac.tacval_tac !ml_table in
tac args
in
let () = Geninterp.register_interp0 wit interp_fun in
(fun v -> Genarg.in_gen (Genarg.Glbwit wit) v)
let ml_val_tactic_extend ~plugin ~name ~local ?deprecation sign tac =
let open Tacexpr in
let tac args = cast_ml sign tac args in
let ml_tactic_name = { mltac_tactic = name; mltac_plugin = plugin } in
let len = ml_sig_len sign in
let vars = List.init len (fun i -> Id.of_string (Printf.sprintf "arg%i" i)) in
let body = TacGeneric (None, in_tacval { tacval_tac = ml_tactic_name; tacval_var = vars }) in
let vars = List.map (fun id -> Name id) vars in
let body = CAst.make (Tacexpr.TacFun (vars, CAst.make (Tacexpr.TacArg body))) in
let id = Names.Id.of_string name in
let obj () = Tacenv.register_ltac true local id body ?deprecation in
let () = assert (not @@ MLTacMap.mem ml_tactic_name !ml_table) in
let () = ml_table := MLTacMap.add ml_tactic_name tac !ml_table in
Mltop.declare_cache_obj obj plugin
(** ARGUMENT EXTEND *)
open Geninterp
type ('a, 'b, 'c) argument_printer =
'a Pptactic.raw_extra_genarg_printer *
'b Pptactic.glob_extra_genarg_printer *
'c Pptactic.extra_genarg_printer
type ('a, 'b) argument_intern =
| ArgInternFun : ('a, 'b) Genintern.intern_fun -> ('a, 'b) argument_intern
| ArgInternWit : ('a, 'b, 'c) Genarg.genarg_type -> ('a, 'b) argument_intern
type 'b argument_subst =
| ArgSubstFun : 'b Gensubst.subst_fun -> 'b argument_subst
| ArgSubstWit : ('a, 'b, 'c) Genarg.genarg_type -> 'b argument_subst
type ('b, 'c) argument_interp =
| ArgInterpRet : ('c, 'c) argument_interp
| ArgInterpFun : ('b, Val.t) interp_fun -> ('b, 'c) argument_interp
| ArgInterpWit : ('a, 'b, 'r) Genarg.genarg_type -> ('b, 'c) argument_interp
| ArgInterpSimple :
(Geninterp.interp_sign -> Environ.env -> Evd.evar_map -> 'b -> 'c) -> ('b, 'c) argument_interp
type ('a, 'b, 'c) tactic_argument = {
arg_parsing : 'a Vernacextend.argument_rule;
arg_tag : 'c Val.tag option;
arg_intern : ('a, 'b) argument_intern;
arg_subst : 'b argument_subst;
arg_interp : ('b, 'c) argument_interp;
arg_printer : ('a, 'b, 'c) argument_printer;
}
let intern_fun (type a b c) name (arg : (a, b, c) tactic_argument) : (a, b) Genintern.intern_fun =
match arg.arg_intern with
| ArgInternFun f -> f
| ArgInternWit wit ->
fun ist v ->
let ans = Genarg.out_gen (glbwit wit) (Tacintern.intern_genarg ist (Genarg.in_gen (rawwit wit) v)) in
(ist, ans)
let subst_fun (type a b c) (arg : (a, b, c) tactic_argument) : b Gensubst.subst_fun =
match arg.arg_subst with
| ArgSubstFun f -> f
| ArgSubstWit wit ->
fun s v ->
let ans = Genarg.out_gen (glbwit wit) (Tacsubst.subst_genarg s (Genarg.in_gen (glbwit wit) v)) in
ans
let interp_fun (type a b c) name (arg : (a, b, c) tactic_argument) (tag : c Val.tag) : (b, Val.t) interp_fun =
match arg.arg_interp with
| ArgInterpRet -> (fun ist v -> Ftactic.return (Geninterp.Val.inject tag v))
| ArgInterpFun f -> f
| ArgInterpWit wit ->
(fun ist x -> Tacinterp.interp_genarg ist (Genarg.in_gen (glbwit wit) x))
| ArgInterpSimple f ->
(fun ist v -> Ftactic.enter begin fun gl ->
let env = Proofview.Goal.env gl in
let sigma = Proofview.Goal.sigma gl in
let v = f ist env sigma v in
Ftactic.return (Geninterp.Val.inject tag v)
end)
let argument_extend (type a b c) ~plugin ~name (arg : (a, b, c) tactic_argument) =
let wit = Genarg.create_arg name in
let () = Genintern.register_intern0 wit (intern_fun name arg) in
let () = Gensubst.register_subst0 wit (subst_fun arg) in
let tag = match arg.arg_tag with
| None ->
let () = register_val0 wit None in
val_tag (topwit wit)
| Some tag ->
let () = register_val0 wit (Some tag) in
tag
in
let () = register_interp0 wit (interp_fun name arg tag) in
let entry = match arg.arg_parsing with
| Vernacextend.Arg_alias e ->
let () = Procq.register_grammar wit e in
e
| Vernacextend.Arg_rules rules ->
let e = Procq.create_generic_entry2 name (Genarg.rawwit wit) in
let plugin_uid = (plugin, "argextend:"^name) in
let () = Egramml.grammar_extend ~plugin_uid e (Procq.Fresh (Gramlib.Gramext.First, [None, None, rules])) in
e
in
let (rpr, gpr, tpr) = arg.arg_printer in
let () = Pptactic.declare_extra_genarg_pprule wit rpr gpr tpr in
let () = create_ltac_quotation ~plugin name
(fun (loc, v) -> Tacexpr.TacGeneric (Some name,Genarg.in_gen (Genarg.rawwit wit) v))
(entry, None)
in
(wit, entry)
|