forked from coq/coq
-
Notifications
You must be signed in to change notification settings - Fork 0
/
constrextern.ml
1528 lines (1368 loc) · 64.7 KB
/
constrextern.ml
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
(************************************************************************)
(* * The Coq Proof Assistant / The Coq 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) *)
(************************************************************************)
(*i*)
open Pp
open CErrors
open Util
open Names
open Nameops
open Termops
open Libnames
open Namegen
open Impargs
open CAst
open Notation
open Constrexpr
open Constrexpr_ops
open Notation_ops
open Glob_term
open Glob_ops
open Pattern
open Detyping
open Structures
open Notationextern
module NamedDecl = Context.Named.Declaration
(*i*)
(* Translation from glob_constr to front constr *)
(**********************************************************************)
(* Parametrization *)
(* This governs printing of implicit arguments. When
[print_implicits] is on then [print_implicits_explicit_args] tells
how implicit args are printed. If on, implicit args are printed
with the form (id:=arg) otherwise arguments are printed normally and
the function is prefixed by "@" *)
let print_implicits = ref false
let print_implicits_explicit_args = ref false
(* Tells if implicit arguments not known to be inferable from a rigid
position are systematically printed *)
let print_implicits_defensive = ref true
(* This forces printing of coercions *)
let print_coercions = ref false
(* This forces printing of parentheses even when
it is implied by associativity/precedence *)
let print_parentheses = Notation_ops.print_parentheses
(* This forces printing universe names of Type{.} *)
let print_universes = Detyping.print_universes
(* This suppresses printing of notations *)
let print_no_symbol = ref false
(* This tells to skip types if a variable has this type by default *)
let { Goptions.get = print_use_implicit_types } =
Goptions.declare_bool_option_and_ref
~key:["Printing";"Use";"Implicit";"Types"]
~value:true
()
(* Print primitive tokens, like strings *)
let print_raw_literal = ref false
(**********************************************************************)
let hole = CAst.make @@ CHole (None, IntroAnonymous)
let is_reserved_type na t =
not !Flags.raw_print && print_use_implicit_types () &&
match na with
| Anonymous -> false
| Name id ->
try
let pat = Reserve.find_reserved_type id in
let _ = match_notation_constr ~print_univ:false t ~vars:Id.Set.empty ([],pat) in
true
with Not_found | No_match -> false
(**********************************************************************)
(* Turning notations and scopes on and off for printing *)
(* This governs printing of projections using the dot notation symbols *)
let print_projections = ref false
let print_meta_as_hole = ref false
let with_universes f = Flags.with_option print_universes f
let with_meta_as_hole f = Flags.with_option print_meta_as_hole f
let without_symbols f = Flags.with_option print_no_symbol f
(**********************************************************************)
(* Control printing of records *)
(* Set Record Printing flag *)
let { Goptions.get = get_record_print } =
Goptions.declare_bool_option_and_ref
~key:["Printing";"Records"]
~value:true
()
let is_record indsp =
try
let _ = Structure.find indsp in
true
with Not_found -> false
let encode_record r =
let indsp = Nametab.global_inductive r in
if not (is_record indsp) then
user_err ?loc:r.CAst.loc
(str "This type is not a structure type.");
indsp
module PrintingRecordRecord =
PrintingInductiveMake (struct
let encode _env = encode_record
let field = "Record"
let title = "Types leading to pretty-printing using record notation: "
let member_message s b =
str "Terms of " ++ s ++
str
(if b then " are printed using record notation"
else " are not printed using record notation")
end)
module PrintingRecordConstructor =
PrintingInductiveMake (struct
let encode _env = encode_record
let field = "Constructor"
let title = "Types leading to pretty-printing using constructor form: "
let member_message s b =
str "Terms of " ++ s ++
str
(if b then " are printed using constructor form"
else " are not printed using constructor form")
end)
module PrintingRecord = Goptions.MakeRefTable(PrintingRecordRecord)
module PrintingConstructor = Goptions.MakeRefTable(PrintingRecordConstructor)
(**********************************************************************)
(* Various externalisation functions *)
let insert_delimiters e = function
| None -> e
| Some sc -> CAst.make @@ CDelimiters (sc,e)
let insert_pat_delimiters ?loc p = function
| None -> p
| Some sc -> CAst.make ?loc @@ CPatDelimiters (sc,p)
let insert_pat_alias ?loc p = function
| Anonymous -> p
| Name _ as na -> CAst.make ?loc @@ CPatAlias (p,(CAst.make ?loc na))
let rec insert_entry_coercion ?loc l c = match l with
| [] -> c
| (inscope,ntn)::l -> CAst.make ?loc @@ CNotation (Some inscope,ntn,([insert_entry_coercion ?loc l c],[],[],[]))
let rec insert_pat_coercion ?loc l c = match l with
| [] -> c
| (inscope,ntn)::l -> CAst.make ?loc @@ CPatNotation (Some inscope,ntn,([insert_pat_coercion ?loc l c],[],[]),[])
(**********************************************************************)
(* conversion of references *)
let extern_evar n l = CEvar (n,l)
(** We allow customization of the global_reference printer.
For instance, in the debugger the tables of global references
may be inaccurate *)
let rec dirpath_of_modpath = function
| MPfile dp -> dp
| MPbound mbid -> let (_,id,_) = MBId.repr mbid in DirPath.make [id]
| MPdot (t, l) -> Libnames.add_dirpath_suffix (dirpath_of_modpath t) (Label.to_id l)
let path_of_global = function
| GlobRef.VarRef id -> Libnames.make_path DirPath.empty id
(* We rely on the tacite invariant that the label of a constant is used to build its internal name *)
| GlobRef.ConstRef cst -> Libnames.make_path (dirpath_of_modpath (Constant.modpath cst)) (Label.to_id (Constant.label cst))
(* We rely on the tacite invariant that an inductive block inherits the name of its first type *)
| GlobRef.IndRef (ind,1) -> Libnames.make_path (dirpath_of_modpath (MutInd.modpath ind)) (Label.to_id (MutInd.label ind))
(* These are hacks *)
| GlobRef.IndRef (ind,n) -> Libnames.make_path (dirpath_of_modpath (MutInd.modpath ind)) (Id.of_string_soft ("<inductive:" ^ Label.to_string (MutInd.label ind) ^ ":" ^ string_of_int n ^ ">"))
| GlobRef.ConstructRef ((ind,1),p) -> Libnames.make_path (dirpath_of_modpath (MutInd.modpath ind)) (Id.of_string_soft ("<constructor:" ^ Label.to_string (MutInd.label ind) ^ ":" ^ string_of_int (p+1) ^ ">"))
| GlobRef.ConstructRef ((ind,n),p) -> Libnames.make_path (dirpath_of_modpath (MutInd.modpath ind)) (Id.of_string_soft ("<constructor:" ^ Label.to_string (MutInd.label ind) ^ ":" ^ string_of_int n ^ ":" ^ string_of_int (p+1) ^ ">"))
let default_extern_reference ?loc vars r =
try Nametab.shortest_qualid_of_global ?loc vars r
with Not_found when GlobRef.is_bound r -> qualid_of_path (path_of_global r)
let my_extern_reference = ref default_extern_reference
let set_extern_reference f = my_extern_reference := f
let get_extern_reference () = !my_extern_reference
let extern_reference ?loc vars l = !my_extern_reference vars l
(**********************************************************************)
(* utilities *)
let rec fill_arg_scopes args subscopes (entry,(_,scopes) as all) =
assert (args = [] || notation_entry_eq (fst entry).notation_subentry InConstrEntry);
match args, subscopes with
| [], _ -> []
| a :: args, scopt :: subscopes ->
(a, (entry, (scopt, scopes))) :: fill_arg_scopes args subscopes all
| a :: args, [] ->
(a, (entry, ([], scopes))) :: fill_arg_scopes args [] all
let overlap_right_left lev_after ((typs,_):Notation_term.interpretation) =
List.exists (fun (_id,(({notation_relative_level = lev; notation_position = side},_),_,_)) ->
match side with
| Some Right -> may_capture_cont_after lev_after lev
| _ -> false) typs
let update_with_subscope from_entry (entry,(scopt,scl)) lev_after closed scopes =
let {notation_subentry = entry; notation_relative_level = lev; notation_position = side} = entry in
let lev = if !print_parentheses && side <> None then LevelLe 0 (* min level *) else lev in
let lev_after =
match side with
| Some Left -> Some from_entry.notation_level
| Some Right -> if closed then None else lev_after
| None -> None in
let subentry' = {notation_subentry = entry; notation_relative_level = lev; notation_position = side} in
((subentry',lev_after),(scopt,scl@scopes))
(**********************************************************************)
(* mapping patterns to cases_pattern_expr *)
let add_patt_for_params ind l =
if !Flags.in_debugger then l else
Util.List.addn (Inductiveops.inductive_nparamdecls (Global.env()) ind) (CAst.make @@ CPatAtom None) l
let add_cpatt_for_params ind l =
if !Flags.in_debugger then l else
Util.List.addn (Inductiveops.inductive_nparamdecls (Global.env()) ind) (DAst.make @@ PatVar Anonymous) l
let drop_implicits_in_patt cst nb_expl args =
let impl_st = implicits_of_global cst in
let impl_data = extract_impargs_data impl_st in
let rec impls_fit l = function
| [], t -> Some (List.rev_append l t)
| _, [] -> None
| h::t, { CAst.v = CPatAtom None }::tt when is_status_implicit h -> impls_fit l (t,tt)
| h::_, _ when is_status_implicit h -> None
| _::t, hh::tt -> impls_fit (hh::l) (t,tt)
in
let try_impls_fit (imps,args) =
if not !Constrintern.parsing_explicit &&
((!Flags.raw_print || !print_implicits) &&
List.exists is_status_implicit imps)
(* Note: !print_implicits_explicit_args=true not supported for patterns *)
then None
else impls_fit [] (imps,args)
in
let rec select = function
| [] -> None
| (_,imps)::imps_list ->
match try_impls_fit (imps,args) with
| None -> select imps_list
| x -> x
in
if Int.equal nb_expl 0 then select impl_data
else
let imps = List.skipn_at_least nb_expl (select_stronger_impargs impl_st) in
try_impls_fit (imps,args)
let destPrim = function { CAst.v = CPrim t } -> Some t | _ -> None
let destPatPrim = function { CAst.v = CPatPrim t } -> Some t | _ -> None
let make_notation_gen loc ntn mknot mkprim destprim l bl =
match snd ntn,List.map destprim l with
(* Special case to avoid writing "- 3" for e.g. (Z.opp 3) *)
| "- _", [Some (Number p)] when not (NumTok.Signed.is_zero p) ->
assert (bl=[]);
mknot (loc,ntn,([mknot (loc,(InConstrEntry,"( _ )"),l,[])]),[])
| _ ->
match decompose_notation_key ntn, l with
| (InConstrEntry,[Terminal x]), [] ->
begin match String.unquote_coq_string x with
| Some s -> mkprim (loc, String s)
| None ->
match NumTok.Unsigned.parse_string x with
| Some n -> mkprim (loc, Number (NumTok.SPlus,n))
| None -> mknot (loc,ntn,l,bl) end
| (InConstrEntry,[Terminal "-"; Terminal x]), [] ->
begin match NumTok.Unsigned.parse_string x with
| Some n -> mkprim (loc, Number (NumTok.SMinus,n))
| None -> mknot (loc,ntn,l,bl) end
| _ -> mknot (loc,ntn,l,bl)
let make_notation loc (inscope,ntn) (terms,termlists,binders,binderlists as subst) =
if not (List.is_empty termlists) || not (List.is_empty binderlists) then
CAst.make ?loc @@ CNotation (Some inscope,ntn,subst)
else
make_notation_gen loc ntn
(fun (loc,ntn,l,bl) -> CAst.make ?loc @@ CNotation (Some inscope,ntn,(l,[],bl,[])))
(fun (loc,p) -> CAst.make ?loc @@ CPrim p)
destPrim terms binders
let make_pat_notation ?loc (inscope,ntn) (terms,termlists,binders as subst) args =
if not (List.is_empty termlists && List.is_empty binders) then
(CAst.make ?loc @@ CPatNotation (Some inscope,ntn,subst,args))
else
make_notation_gen loc ntn
(fun (loc,ntn,l,_) -> CAst.make ?loc @@ CPatNotation (Some inscope,ntn,(l,[],[]),args))
(fun (loc,p) -> CAst.make ?loc @@ CPatPrim p)
destPatPrim terms []
let pattern_printable_in_both_syntax (ind,_ as c) =
let impl_st = extract_impargs_data (implicits_of_global (GlobRef.ConstructRef c)) in
let nb_params = Inductiveops.inductive_nparams (Global.env()) ind in
List.exists (fun (_,impls) ->
(List.length impls >= nb_params) &&
let params,args = Util.List.chop nb_params impls in
not !Flags.raw_print && not !print_implicits &&
(List.for_all is_status_implicit params)&&(List.for_all (fun x -> not (is_status_implicit x)) args)
) impl_st
let extern_record_pattern cstrsp args =
try
if !Flags.raw_print then raise_notrace Exit;
let projs = Structure.find_projections (fst cstrsp) in
if PrintingRecord.active (fst cstrsp) then
()
else if PrintingConstructor.active (fst cstrsp) then
raise_notrace Exit
else if not (get_record_print ()) then
raise_notrace Exit;
let rec ip projs args acc =
match projs, args with
| [], [] -> acc
| proj :: q, pat :: tail ->
let acc =
match proj, pat with
| _, { CAst.v = CPatAtom None } ->
(* we don't want to have 'x := _' in our patterns *)
acc
| Some c, _ ->
let loc = pat.CAst.loc in
(extern_reference ?loc Id.Set.empty (GlobRef.ConstRef c), pat) :: acc
| _ -> raise No_match in
ip q tail acc
| _ -> assert false
in
Some (List.rev (ip projs args []))
with
Not_found | No_match | Exit -> None
(* Better to use extern_glob_constr composed with injection/retraction ?? *)
let rec extern_cases_pattern_in_scope ((custom,(lev_after:int option)),scopes as allscopes) vars pat =
try
if !Flags.in_debugger || !Flags.raw_print || !print_raw_literal then raise No_match;
let (na,p,key) = uninterp_prim_token_cases_pattern pat scopes in
match availability_of_entry_coercion custom constr_lowest_level with
| None -> raise No_match
| Some coercion ->
let loc = cases_pattern_loc pat in
insert_pat_coercion ?loc coercion
(insert_pat_alias ?loc (insert_pat_delimiters ?loc (CAst.make ?loc @@ CPatPrim p) key) na)
with No_match ->
try
if !Flags.in_debugger || !Flags.raw_print || !print_no_symbol then raise No_match;
extern_notation_pattern allscopes vars pat
(uninterp_cases_pattern_notations pat)
with No_match ->
let loc = pat.CAst.loc in
match DAst.get pat with
| PatVar (Name id) when entry_has_global custom || entry_has_ident custom ->
CAst.make ?loc (CPatAtom (Some (qualid_of_ident ?loc id)))
| pat ->
match availability_of_entry_coercion custom constr_lowest_level with
| None -> raise No_match
| Some coercion ->
let allscopes = ((constr_some_level,None),scopes) in
let pat = match pat with
| PatVar (Name id) -> CAst.make ?loc (CPatAtom (Some (qualid_of_ident ?loc id)))
| PatVar (Anonymous) -> CAst.make ?loc (CPatAtom None)
| PatCstr(cstrsp,args,na) ->
let args = List.map (extern_cases_pattern_in_scope allscopes vars) args in
let p =
match extern_record_pattern cstrsp args with
| Some l -> CPatRecord l
| None ->
let c = extern_reference Id.Set.empty (GlobRef.ConstructRef cstrsp) in
if Constrintern.get_asymmetric_patterns () then
if pattern_printable_in_both_syntax cstrsp
then CPatCstr (c, None, args)
else CPatCstr (c, Some (add_patt_for_params (fst cstrsp) args), [])
else
let full_args = add_patt_for_params (fst cstrsp) args in
match drop_implicits_in_patt (GlobRef.ConstructRef cstrsp) 0 full_args with
| Some true_args -> CPatCstr (c, None, true_args)
| None -> CPatCstr (c, Some full_args, [])
in
insert_pat_alias ?loc (CAst.make ?loc p) na
in
insert_pat_coercion coercion pat
and apply_notation_to_pattern ?loc gr ((terms,termlists,binders),(no_implicit,nb_to_drop,more_args))
((custom, lev_after), (tmp_scope, scopes) as allscopes) vars pat rule =
let lev_after = if List.is_empty more_args then lev_after else Some Notation.app_level in
match rule with
| NotationRule (_,ntn as specific_ntn) ->
begin
let entry = fst (Notation.level_of_notation ntn) in
let entry = if overlap_right_left lev_after pat then {entry with notation_level = max_int} else entry in
match availability_of_entry_coercion custom entry with
| None -> raise No_match
| Some coercion ->
let closed = not (List.is_empty coercion) in
match availability_of_notation specific_ntn (tmp_scope,scopes) with
(* Uninterpretation is not allowed in current context *)
| None -> raise No_match
(* Uninterpretation is allowed in current context *)
| Some (scopt,key) ->
let scopes' = Option.List.cons scopt scopes in
let l =
List.map (fun (c,subscope) ->
let scopes = update_with_subscope entry subscope lev_after closed scopes' in
extern_cases_pattern_in_scope scopes vars c)
terms in
let ll =
List.map (fun (c,subscope) ->
let scopes = update_with_subscope entry subscope lev_after closed scopes' in
List.map (extern_cases_pattern_in_scope scopes vars) c)
termlists in
let bl =
List.map (fun (c,subscope) ->
let scopes = update_with_subscope entry subscope lev_after closed scopes' in
(extern_cases_pattern_in_scope scopes vars c, Explicit))
binders
in
let subscopes = find_arguments_scope gr in
let more_args_scopes = try List.skipn nb_to_drop subscopes with Failure _ -> [] in
let more_args = fill_arg_scopes more_args more_args_scopes allscopes in
let l2 = List.map (fun (c,allscopes) -> extern_cases_pattern_in_scope allscopes vars c) more_args in
let l2' = if Constrintern.get_asymmetric_patterns () || not (List.is_empty ll) then l2
else
if no_implicit then l2 else
match drop_implicits_in_patt gr nb_to_drop l2 with
| Some true_args -> true_args
| None -> raise No_match
in
insert_pat_coercion coercion
(insert_pat_delimiters ?loc
(make_pat_notation ?loc specific_ntn (l,ll,bl) l2') key)
end
| AbbrevRule kn ->
match availability_of_entry_coercion custom constr_lowest_level with
| None -> raise No_match
| Some coercion ->
let qid = Nametab.shortest_qualid_of_abbreviation ?loc vars kn in
let l1 =
List.rev_map (fun (c,(subentry,(scopt,scl))) ->
extern_cases_pattern_in_scope ((subentry,lev_after),(scopt,scl@scopes)) vars c)
terms in
let subscopes = find_arguments_scope gr in
let more_args_scopes = try List.skipn nb_to_drop subscopes with Failure _ -> [] in
let more_args = fill_arg_scopes more_args more_args_scopes allscopes in
let l2 = List.map (fun (c,allscopes) -> extern_cases_pattern_in_scope allscopes vars c) more_args in
let l2' = if Constrintern.get_asymmetric_patterns () then l2
else
if no_implicit then l2 else
match drop_implicits_in_patt gr nb_to_drop l2 with
| Some true_args -> true_args
| None -> raise No_match
in
assert (List.is_empty termlists);
assert (List.is_empty binders);
insert_pat_coercion ?loc coercion (CAst.make ?loc @@ CPatCstr (qid,None,List.rev_append l1 l2'))
and extern_notation_pattern allscopes vars t = function
| [] -> raise No_match
| (keyrule,pat,n as _rule)::rules ->
try
if is_printing_inactive_rule keyrule pat then raise No_match;
let loc = t.loc in
match DAst.get t with
| PatCstr (cstr,args,na) ->
let t = if na = Anonymous then t else DAst.make ?loc (PatCstr (cstr,args,Anonymous)) in
let p = apply_notation_to_pattern ?loc (GlobRef.ConstructRef cstr)
(match_notation_constr_cases_pattern t pat) allscopes vars pat keyrule in
insert_pat_alias ?loc p na
| PatVar Anonymous -> CAst.make ?loc @@ CPatAtom None
| PatVar (Name id) -> CAst.make ?loc @@ CPatAtom (Some (qualid_of_ident ?loc id))
with
No_match -> extern_notation_pattern allscopes vars t rules
let rec extern_notation_ind_pattern allscopes vars ind args = function
| [] -> raise No_match
| (keyrule,pat,n as _rule)::rules ->
try
if is_printing_inactive_rule keyrule pat then raise No_match;
apply_notation_to_pattern (GlobRef.IndRef ind)
(match_notation_constr_ind_pattern ind args pat) allscopes vars pat keyrule
with
No_match -> extern_notation_ind_pattern allscopes vars ind args rules
let extern_ind_pattern_in_scope (custom,scopes as allscopes) vars ind args =
(* pboutill: There are letins in pat which is incompatible with notations and
not explicit application. *)
if !Flags.in_debugger||Inductiveops.inductive_has_local_defs (Global.env()) ind then
let c = extern_reference vars (GlobRef.IndRef ind) in
let args = List.map (extern_cases_pattern_in_scope allscopes vars) args in
CAst.make @@ CPatCstr (c, Some (add_patt_for_params ind args), [])
else
try
if !Flags.raw_print || !print_no_symbol then raise No_match;
extern_notation_ind_pattern allscopes vars ind args
(uninterp_ind_pattern_notations ind)
with No_match ->
let c = extern_reference vars (GlobRef.IndRef ind) in
let args = List.map (extern_cases_pattern_in_scope allscopes vars) args in
match drop_implicits_in_patt (GlobRef.IndRef ind) 0 args with
| Some true_args -> CAst.make @@ CPatCstr (c, None, true_args)
| None -> CAst.make @@ CPatCstr (c, Some args, [])
let extern_cases_pattern vars p =
extern_cases_pattern_in_scope ((constr_some_level,None),([],[])) vars p
(**********************************************************************)
(* Externalising applications *)
let occur_name na aty =
match na with
| Name id -> occur_var_constr_expr id aty
| Anonymous -> false
let is_gvar id c = match DAst.get c with
| GVar id' -> Id.equal id id'
| _ -> false
let is_projection nargs r =
if not !Flags.in_debugger && not !Flags.raw_print && !print_projections then
try
match r with
| GlobRef.ConstRef c ->
let n = Structure.projection_nparams c + 1 in
if n <= nargs then Some n
else None
| _ -> None
with Not_found -> None
else None
let is_hole = function CHole _ | CEvar _ -> true | _ -> false
let isCRef_no_univ = function
| CRef (_,None) -> true
| _ -> false
let is_significant_implicit a =
not (is_hole (a.CAst.v))
let is_needed_for_correct_partial_application tail imp =
List.is_empty tail && not (maximal_insertion_of imp)
exception Expl
(* Take a list of arguments starting at position [q] and their implicit status *)
(* Decide for each implicit argument if it skipped or made explicit *)
(* If the removal of implicit arguments is not possible, raise [Expl] *)
(* [inctx] tells if the term is in a context which will enforce the external type *)
(* [n] is the total number of arguments block to which the [args] belong *)
let adjust_implicit_arguments inctx n args impl =
let rec exprec = function
| a::args, imp::impl when is_status_implicit imp ->
let tail = exprec (args,impl) in
let visible =
!Flags.raw_print ||
(!print_implicits && !print_implicits_explicit_args) ||
(is_needed_for_correct_partial_application tail imp) ||
(!print_implicits_defensive &&
(not (is_inferable_implicit inctx n imp) || !Flags.beautify) &&
is_significant_implicit (Lazy.force a))
in
if visible then
(Lazy.force a,Some (make @@ explicitation imp)) :: tail
else
tail
| a::args, _::impl -> (Lazy.force a,None) :: exprec (args,impl)
| args, [] -> List.map (fun a -> (Lazy.force a,None)) args (*In case of polymorphism*)
| [], (imp :: _) when is_status_implicit imp && maximal_insertion_of imp ->
(* The non-explicit application cannot be parsed back with the same type *)
raise Expl
| [], _ -> []
in exprec (args,impl)
let extern_projection inctx f nexpectedparams args impl =
let (args1,args2) = List.chop (nexpectedparams + 1) args in
let nextraargs = List.length args2 in
let (impl1,impl2) = impargs_for_proj ~nexpectedparams ~nextraargs impl in
let n = nexpectedparams + 1 + nextraargs in
let args1 = adjust_implicit_arguments inctx n args1 impl1 in
let args2 = adjust_implicit_arguments inctx n args2 impl2 in
let (c1,expl), args1 = List.sep_last args1 in
assert (expl = None);
let c = CProj (false,f,args1,c1) in
if args2 = [] then c else CApp (CAst.make c, args2)
let is_start_implicit = function
| imp :: _ -> is_status_implicit imp && maximal_insertion_of imp
| [] -> false
let extern_record ref args =
try
if !Flags.raw_print then raise_notrace Exit;
let cstrsp = match ref with GlobRef.ConstructRef c -> c | _ -> raise Not_found in
let struc = Structure.find (fst cstrsp) in
if PrintingRecord.active (fst cstrsp) then
()
else if PrintingConstructor.active (fst cstrsp) then
raise_notrace Exit
else if not (get_record_print ()) then
raise_notrace Exit;
let projs = struc.Structure.projections in
let rec cut args n =
if Int.equal n 0 then args
else
match args with
| [] -> raise No_match
| _ :: t -> cut t (n - 1) in
let args = cut args struc.Structure.nparams in
let rec ip projs args acc =
match projs with
| [] -> acc
| { Structure.proj_body = None } :: _ -> raise No_match
| { Structure.proj_body = Some c; proj_true = false } :: q ->
(* we don't want to print locals *)
ip q args acc
| { Structure.proj_body = Some c; proj_true = true } :: q ->
match args with
| [] -> raise No_match
(* we give up since the constructor is not complete *)
| arg :: tail ->
let arg = Lazy.force arg in
let loc = arg.CAst.loc in
let ref = extern_reference ?loc Id.Set.empty (GlobRef.ConstRef c) in
ip q tail ((ref, arg) :: acc)
in
Some (List.rev (ip projs args []))
with
| Not_found | No_match | Exit -> None
let extern_global impl f us =
if not !Constrintern.parsing_explicit && is_start_implicit impl
then
CAppExpl ((f, us), [])
else
CRef (f,us)
(* Implicit args indexes are in ascending order *)
(* inctx is useful only if there is a last argument to be deduced from ctxt *)
let extern_applied_ref inctx impl (cf,f) us args =
try
if not !Constrintern.parsing_explicit &&
((!Flags.raw_print ||
(!print_implicits && not !print_implicits_explicit_args)) &&
List.exists is_status_implicit impl)
then raise Expl;
let impl = if !Constrintern.parsing_explicit then [] else impl in
let n = List.length args in
let ref = CRef (f,us) in
let r = CAst.make ref in
let ip = is_projection n cf in
match ip with
| Some i ->
(* [t.(f args1) args2] projection-style notation *)
extern_projection inctx (f,us) (i-1) args impl
| None ->
let args = adjust_implicit_arguments inctx n args impl in
if args = [] then ref else CApp (r, args)
with Expl ->
(* A [@f args] node *)
let args = List.map Lazy.force args in
match is_projection (List.length args) cf with
| Some n when !print_projections ->
let args = List.map (fun c -> (c,None)) args in
let args1, args2 = List.chop n args in
let (c1,_), args1 = List.sep_last args1 in
let c = CProj (true, (f,us), args1, c1) in
if args2 = [] then c else CApp (CAst.make c, args2)
| _ ->
CAppExpl ((f,us), args)
let extern_applied_abbreviation inctx n extraimpl (cf,f) abbrevargs extraargs =
try
let abbrevargs = List.map (fun a -> (a,None)) abbrevargs in
let extraargs = adjust_implicit_arguments inctx n extraargs extraimpl in
let args = abbrevargs @ extraargs in
if args = [] then cf else CApp (CAst.make cf, args)
with Expl ->
let args = abbrevargs @ List.map Lazy.force extraargs in
CAppExpl ((f,None), args)
let mkFlattenedCApp (head,args) =
match head.CAst.v with
| CApp (g,args') ->
(* may happen with notations for a prefix of an n-ary application *)
(* or after removal of a coercion to funclass *)
CApp (g,args'@args)
| _ ->
CApp (head, args)
let extern_applied_notation inctx n impl f args =
if List.is_empty args then
f.CAst.v
else
try
let args = adjust_implicit_arguments inctx n args impl in
mkFlattenedCApp (f,args)
with Expl -> raise No_match
let extern_args extern env args =
let map (arg, argscopes) = lazy (extern argscopes env arg) in
List.map map args
let match_coercion_app c = match DAst.get c with
| GApp (r, args) ->
begin match DAst.get r with
| GRef (r,_) -> Some (c.CAst.loc, r, args)
| _ -> None
end
| _ -> None
let remove_one_coercion inctx c =
try match match_coercion_app c with
| Some (loc,r,args) when not (!Flags.raw_print || !print_coercions) ->
let nargs = List.length args in
(match Coercionops.hide_coercion r with
| Some nparams when
let inctx = inctx || (* coercion to funclass implying being in context *) nparams+1 < nargs in
nparams < nargs && inctx ->
(* We skip the coercion *)
let l = List.skipn nparams args in
let (a,l) = match l with a::l -> (a,l) | [] -> assert false in
(* Don't flatten App's in case of funclass so that
(atomic) notations on [a] work; should be compatible
since printer does not care whether App's are
collapsed or not and notations with an implicit
coercion using funclass either would have already
been confused with ordinary application or would have need
a surrounding context and the coercion to funclass would
have been made explicit to match *)
let a' = if List.is_empty l then a else DAst.make ?loc @@ GApp (a,l) in
let inctx = inctx || not (List.is_empty l) in
Some (nparams+1, inctx, a')
| _ -> None)
| _ -> None
with Not_found ->
None
let rec flatten_application c = match DAst.get c with
| GApp (f, l) ->
begin match DAst.get f with
| GApp(a,l') ->
let loc = c.CAst.loc in
flatten_application (DAst.make ?loc @@ GApp (a,l'@l))
| _ -> c
end
| a -> c
let same_binder_type ty nal c =
match nal, DAst.get c with
| _::_, (GProd (_,_,ty',_) | GLambda (_,_,ty',_)) -> glob_constr_eq ty ty'
| [], _ -> true
| _ -> assert false
(**********************************************************************)
(* mapping glob_constr to numerals (in presence of coercions, choose the *)
(* one with no delimiter if possible) *)
let extern_possible_prim_token ((custom,_),scopes) r =
if !print_raw_literal then raise No_match;
let (n,key) = uninterp_prim_token r scopes in
match availability_of_entry_coercion custom constr_lowest_level with
| None -> raise No_match
| Some coercion ->
insert_entry_coercion coercion (insert_delimiters (CAst.make ?loc:(loc_of_glob_constr r) @@ CPrim n) key)
let filter_enough_applied nargs l =
(* This is to ensure that notations for coercions are used only when
the coercion is fully applied; not explicitly done yet, but we
could also expect that the notation is exactly talking about the
coercion *)
match nargs with
| None -> l
| Some nargs ->
List.filter (fun (keyrule,pat,n as _rule) ->
match n with
| AppBoundedNotation n -> n >= nargs
| AppUnboundedNotation | NotAppNotation -> false) l
(* Helper function for safe and optimal printing of primitive tokens *)
(* such as those for Int63 *)
let extern_prim_token_delimiter_if_required n key_n scope_n scopes =
match availability_of_prim_token n scope_n scopes with
| Some None -> CPrim n
| None -> CDelimiters(key_n, CAst.make (CPrim n))
| Some (Some key) -> CDelimiters(key, CAst.make (CPrim n))
(**********************************************************************)
(* mapping decl *)
let extended_glob_local_binder_of_decl loc = function
| (p,bk,None,t) -> GLocalAssum (p,bk,t)
| (p,bk,Some x, t) ->
assert (bk = Explicit);
match DAst.get t with
| GHole (_, IntroAnonymous) -> GLocalDef (p,x,None)
| _ -> GLocalDef (p,x,Some t)
let extended_glob_local_binder_of_decl ?loc u = DAst.make ?loc (extended_glob_local_binder_of_decl loc u)
(**********************************************************************)
(* mapping special floats *)
(* this helper function is copied from notation.ml as it's not exported *)
let qualid_of_ref n =
n |> Coqlib.lib_ref |> Nametab.shortest_qualid_of_global Id.Set.empty
let q_infinity () = qualid_of_ref "num.float.infinity"
let q_neg_infinity () = qualid_of_ref "num.float.neg_infinity"
let q_nan () = qualid_of_ref "num.float.nan"
let extern_float f scopes =
if Float64.is_nan f then CRef(q_nan (), None)
else if Float64.is_infinity f then CRef(q_infinity (), None)
else if Float64.is_neg_infinity f then CRef(q_neg_infinity (), None)
else
let n = NumTok.Signed.of_string (Float64.to_hex_string f) in
extern_prim_token_delimiter_if_required (Number n)
"float" "float_scope" scopes
(**********************************************************************)
(* mapping glob_constr to constr_expr *)
type extern_env = Id.Set.t * UnivNames.universe_binders
let extern_env env sigma = vars_of_env env, Evd.universe_binders sigma
let empty_extern_env = Id.Set.empty, Id.Map.empty
let extern_glob_sort_name uvars = function
| GSProp -> CSProp
| GProp -> CProp
| GSet -> CSet
| GLocalUniv u -> CType (qualid_of_lident u)
| GRawUniv u -> CRawType u
| GUniv u -> begin match UnivNames.qualid_of_level uvars u with
| Some qid -> CType qid
| None -> CRawType u
end
let extern_glob_sort uvars u =
let map (q, l) =
q, List.map (on_fst (extern_glob_sort_name uvars)) l
in
map_glob_sort_gen map u
(** wrapper to handle print_universes: don't forget small univs *)
let extern_glob_sort uvars = function
(* In case we print a glob_constr w/o having passed through detyping *)
| UNamed (None, [(GSProp, 0) | (GProp, 0) | (GSet, 0)]) as u -> extern_glob_sort uvars u
| UNamed _ when not !print_universes -> UAnonymous {rigid=UnivRigid}
| UNamed _ | UAnonymous _ as u -> extern_glob_sort uvars u
let extern_instance uvars = function
| Some l when !print_universes ->
Some (List.map (map_glob_sort_gen (extern_glob_sort_name uvars)) l)
| _ -> None
let extern_ref (vars,uvars) ref us =
extern_global (select_stronger_impargs (implicits_of_global ref))
(extern_reference vars ref) (extern_instance uvars us)
let extern_var ?loc id = CRef (qualid_of_ident ?loc id,None)
let add_vname (vars,uvars) na = add_vname vars na, uvars
let rec insert_impargs impargs r = match impargs with
| [] -> r
| bk :: rest ->
match DAst.get r with
| GProd (na,_,t,c) ->
DAst.make ?loc:r.loc (GProd (na, bk, t, insert_impargs rest c))
| _ -> r
let rec extern inctx ?impargs scopes vars r =
let r = Option.cata (fun impargs -> insert_impargs impargs r) r impargs in
match remove_one_coercion inctx (flatten_application r) with
| Some (nargs,inctx,r') ->
(try extern_notations inctx scopes vars (Some nargs) r
with No_match -> extern inctx scopes vars r')
| None ->
let r' = match DAst.get r with
| GInt i when Coqlib.has_ref "num.int63.wrap_int" ->
let wrap = Coqlib.lib_ref "num.int63.wrap_int" in
DAst.make (GApp (DAst.make (GRef (wrap, None)), [r]))
| GFloat f when Coqlib.has_ref "num.float.wrap_float" ->
let wrap = Coqlib.lib_ref "num.float.wrap_float" in
DAst.make (GApp (DAst.make (GRef (wrap, None)), [r]))
| _ -> r in
try extern_notations inctx scopes vars None r'
with No_match ->
let loc = r.CAst.loc in
match DAst.get r with
| GRef (ref,us) when entry_has_global (fst (fst scopes)) -> CAst.make ?loc (extern_ref vars ref us)
| GVar id when entry_has_global (fst (fst scopes)) || entry_has_ident (fst (fst scopes)) ->
CAst.make ?loc (extern_var ?loc id)
| c ->
match availability_of_entry_coercion (fst (fst scopes)) constr_lowest_level with
| None -> raise No_match
| Some coercion ->
let scopes = ((constr_some_level, None), snd scopes) in
let c = match c with
(* The remaining cases are only for the constr entry *)
| GRef (ref,us) -> extern_ref vars ref us
| GVar id -> extern_var ?loc id
| GEvar (n,[]) when !print_meta_as_hole -> CHole (None, IntroAnonymous)
| GEvar (n,l) ->
extern_evar n (List.map (on_snd (extern false scopes vars)) l)
| GPatVar kind ->
if !print_meta_as_hole then CHole (None, IntroAnonymous) else
(match kind with
| Evar_kinds.SecondOrderPatVar n -> CPatVar n
| Evar_kinds.FirstOrderPatVar n -> CEvar (CAst.make n,[]))
| GApp (f,args) ->
(match DAst.get f with
| GRef (ref,us) ->
let subscopes = find_arguments_scope ref in
let args = fill_arg_scopes args subscopes scopes in
let args = extern_args (extern true) vars args in
(* Try a "{|...|}" record notation *)
(match extern_record ref args with
| Some l -> CRecord l
| None ->
(* Otherwise... *)
extern_applied_ref inctx
(select_stronger_impargs (implicits_of_global ref))
(ref,extern_reference ?loc (fst vars) ref) (extern_instance (snd vars) us) args)
| GProj (f,params,c) ->
extern_applied_proj inctx scopes vars f params c args
| _ ->
let args = List.map (fun c -> (sub_extern true scopes vars c,None)) args in
let head = sub_extern false scopes vars f in
mkFlattenedCApp (head,args))
| GProj (f,params,c) ->
extern_applied_proj inctx scopes vars f params c []
| GLetIn (na,b,t,c) ->
CLetIn (make ?loc na,sub_extern (Option.has_some t) scopes vars b,
Option.map (extern_typ scopes vars) t,
extern inctx ?impargs scopes (add_vname vars na) c)
| GProd (na,bk,t,c) ->
factorize_prod ?impargs scopes vars na bk t c
| GLambda (na,bk,t,c) ->
factorize_lambda inctx scopes vars na bk t c
| GCases (sty,rtntypopt,tml,eqns) ->
let vars' =
List.fold_right (Name.fold_right Id.Set.add)
(cases_predicate_names tml) (fst vars) in
let vars' = vars', snd vars in
let rtntypopt' = Option.map (extern_typ scopes vars') rtntypopt in
let tml = List.map (fun (tm,(na,x)) ->
let na' = match na, DAst.get tm with
| Anonymous, GVar id ->
begin match rtntypopt with
| None -> None
| Some ntn ->
if occur_glob_constr id ntn then
Some (CAst.make Anonymous)