-
Notifications
You must be signed in to change notification settings - Fork 631
/
g_vernac.mlg
1327 lines (1235 loc) · 52.7 KB
/
g_vernac.mlg
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) *)
(************************************************************************)
DECLARE GLOBAL PLUGIN
{
open Pp
open Util
open Names
open Glob_term
open Vernacexpr
open Constrexpr
open Constrexpr_ops
open Extend
open Decls
open Declaremods
open Namegen
module C = Constr
open Pcoq
open Pcoq.Prim
open Pcoq.Constr
open Pcoq.Module
open Pvernac.Vernac_
open Attributes
(* Rem: do not join the different GEXTEND into one, it breaks native *)
(* compilation on PowerPC and Sun architectures *)
let query_command = Entry.make "query_command"
let search_query = Entry.make "search_query"
let search_queries = Entry.make "search_queries"
let subprf = Entry.make "subprf"
let quoted_attributes = Entry.make "quoted_attributes"
let coercion_class = Entry.make "coercion_class"
let thm_token = Entry.make "thm_token"
let def_token = Entry.make "def_token"
let assumption_token = Entry.make "assumption_token"
let def_body = Entry.make "def_body"
let notation_declaration = Entry.make "notation_declaration"
let decl_notations = Entry.make "decl_notations"
let record_field = Entry.make "record_field"
let of_type = Entry.make "of_type"
let of_type_inst = Entry.make "of_type_inst"
let section_subset_expr = Entry.make "section_subset_expr"
let scope_delimiter = Entry.make "scope_delimiter"
let syntax_modifiers = Entry.make "syntax_modifiers"
let make_bullet s =
let open Proof_bullet in
let n = String.length s in
match s.[0] with
| '-' -> Dash n
| '+' -> Plus n
| '*' -> Star n
| _ -> assert false
(* For now we just keep the top-level location of the whole
vernacular, that is to say, including attributes and control flags;
this is not very convenient for advanced clients tho, so in the
future it'd be cool to actually locate the attributes and control
flags individually too. *)
let add_control_flag ~loc ~flag { CAst.v = cmd } =
CAst.make ~loc { cmd with control = flag :: cmd.control }
let test_hash_ident =
let open Pcoq.Lookahead in
to_entry "test_hash_ident" begin
lk_kw "#" >> lk_ident >> check_no_space
end
let test_id_colon =
let open Pcoq.Lookahead in
to_entry "test_id_colon" begin
lk_ident >> lk_kw ":"
end
}
GRAMMAR EXTEND Gram
GLOBAL: vernac_control quoted_attributes gallina_ext noedit_mode subprf;
vernac_control: FIRST
[ [ IDENT "Time"; c = vernac_control ->
{ add_control_flag ~loc ~flag:ControlTime c }
| IDENT "Instructions"; c = vernac_control ->
{ add_control_flag ~loc ~flag:ControlInstructions c }
| IDENT "Redirect"; s = ne_string; c = vernac_control ->
{ add_control_flag ~loc ~flag:(ControlRedirect s) c }
| IDENT "Timeout"; n = natural; c = vernac_control ->
{ add_control_flag ~loc ~flag:(ControlTimeout n) c }
| IDENT "Fail"; c = vernac_control ->
{ add_control_flag ~loc ~flag:ControlFail c }
| IDENT "Succeed"; c = vernac_control ->
{ add_control_flag ~loc ~flag:ControlSucceed c }
| v = decorated_vernac ->
{ let (attrs, expr) = v in CAst.make ~loc { control = []; attrs; expr = expr } } ]
]
;
decorated_vernac:
[ [ a = quoted_attributes ; fv = vernac ->
{ let (f, v) = fv in (List.append a f, v) } ] ]
;
quoted_attributes:
[ [ l = LIST0 [ "#[" ; a = attribute_list ; "]" -> { a } ] -> { List.flatten l } ]
]
;
attribute_list:
[ [ a = LIST0 attribute SEP "," -> { a } ]
]
;
attribute:
[ [ k = ident ; v = attr_value -> { CAst.make ~loc (Names.Id.to_string k, v) }
(* Required because "ident" is declared a keyword when loading Ltac. *)
| IDENT "using" ; v = attr_value -> { CAst.make ~loc ("using", v) } ]
]
;
attr_value:
[ [ "=" ; v = string -> { VernacFlagLeaf (FlagString v) }
| "=" ; v = IDENT -> { VernacFlagLeaf (FlagIdent v) }
| "(" ; a = attribute_list ; ")" -> { VernacFlagList a }
| -> { VernacFlagEmpty } ]
]
;
legacy_attr:
[ [ IDENT "Local" ->
{ CAst.make ~loc ("local", VernacFlagEmpty) }
| IDENT "Global" ->
{ CAst.make ~loc ("global", VernacFlagEmpty) }
| IDENT "Polymorphic" ->
{ Attributes.vernac_polymorphic_flag (Some loc) }
| IDENT "Monomorphic" ->
{ Attributes.vernac_monomorphic_flag (Some loc) }
| IDENT "Cumulative" ->
{ CAst.make ~loc ("universes", VernacFlagList [CAst.make ~loc ("cumulative", VernacFlagEmpty)]) }
| IDENT "NonCumulative" ->
{ CAst.make ~loc ("universes", VernacFlagList [CAst.make ~loc ("cumulative", VernacFlagLeaf (FlagIdent "no"))]) }
| IDENT "Private" ->
{ CAst.make ~loc ("private", VernacFlagList [CAst.make ~loc ("matching", VernacFlagEmpty)]) }
| IDENT "Program" ->
{ CAst.make ~loc ("program", VernacFlagEmpty) }
] ]
;
vernac:
[ [ attrs = LIST0 legacy_attr; v = vernac_aux -> { (attrs, v) } ] ]
;
vernac_aux:
(* Better to parse "." here: in case of failure (e.g. in coerce_to_var), *)
(* "." is still in the stream and discard_to_dot works correctly *)
[ [ g = gallina; "." -> { VernacSynPure g }
| g = gallina_ext; "." -> { g }
| c = command; "." -> { c }
| c = syntax; "." -> { c }
| c = subprf -> { VernacSynPure c }
] ]
;
vernac_aux: LAST
[ [ prfcom = command_entry -> { prfcom } ] ]
;
noedit_mode:
[ [ c = query_command -> { VernacSynPure (c None) } ] ]
;
subprf:
[ [ s = BULLET -> { VernacBullet (make_bullet s) }
| "{" -> { VernacSubproof None }
| "}" -> { VernacEndSubproof }
] ]
;
END
{
let warn_plural_command =
CWarnings.create ~name:"plural-command" ~category:CWarnings.CoreCategories.pedantic ~default:CWarnings.Disabled
(fun kwd -> strbrk (Printf.sprintf "Command \"%s\" expects more than one assumption." kwd))
let test_plural_form loc kwd = function
| [(_,([_],_))] ->
warn_plural_command ~loc kwd
| _ -> ()
let test_plural_form_types loc kwd = function
| [([_],_)] ->
warn_plural_command ~loc kwd
| _ -> ()
let lname_of_lident : lident -> lname =
CAst.map (fun s -> Name s)
let name_of_ident_decl : ident_decl -> name_decl =
on_fst lname_of_lident
let test_variance_ident =
let open Pcoq.Lookahead in
to_entry "test_variance_ident" begin
lk_kws ["=";"+";"*"] >> lk_ident
end
}
(* Gallina declarations *)
GRAMMAR EXTEND Gram
GLOBAL: gallina gallina_ext thm_token def_token assumption_token def_body of_type of_type_inst
record_field notation_declaration decl_notations fix_definition ident_decl univ_decl inductive_or_record_definition;
gallina:
(* Definition, Theorem, Variable, Axiom, ... *)
[ [ thm = thm_token; id = ident_decl; bl = binders; ":"; c = lconstr;
l = LIST0
[ "with"; id = ident_decl; bl = binders; ":"; c = lconstr ->
{ (id,(bl,c)) } ] ->
{ VernacStartTheoremProof (thm, (id,(bl,c))::l) }
| stre = assumption_token; nl = inline; bl = assum_list ->
{ VernacAssumption (stre, nl, bl) }
| tk = assumptions_token; nl = inline; bl = assum_list ->
{ let (kwd,stre) = tk in
test_plural_form loc kwd bl;
VernacAssumption (stre, nl, bl) }
| d = def_token; id = ident_decl; b = def_body ->
{ VernacDefinition (d, name_of_ident_decl id, b) }
| IDENT "Let"; id = ident_decl; b = def_body ->
{ VernacDefinition ((DoDischarge, Let), name_of_ident_decl id, b) }
(* Gallina inductive declarations *)
| f = finite_token; ind = inductive_or_record_definition ->
{ VernacInductive (f, [ind]) }
| f = inductive_token; indl = LIST1 inductive_or_record_definition SEP "with" ->
{ VernacInductive (f, indl) }
| "Fixpoint"; recs = LIST1 fix_definition SEP "with" ->
{ VernacFixpoint (NoDischarge, recs) }
| IDENT "Let"; "Fixpoint"; recs = LIST1 fix_definition SEP "with" ->
{ VernacFixpoint (DoDischarge, recs) }
| "CoFixpoint"; corecs = LIST1 cofix_definition SEP "with" ->
{ VernacCoFixpoint (NoDischarge, corecs) }
| IDENT "Let"; "CoFixpoint"; corecs = LIST1 cofix_definition SEP "with" ->
{ VernacCoFixpoint (DoDischarge, corecs) }
| IDENT "Scheme"; l = LIST1 scheme SEP "with" -> { VernacScheme l }
| IDENT "Scheme"; IDENT "Equality"; IDENT "for" ; id = smart_global ->
{ VernacSchemeEquality (SchemeEquality,id) }
| IDENT "Scheme"; IDENT "Boolean"; IDENT "Equality"; IDENT "for" ; id = smart_global ->
{ VernacSchemeEquality (SchemeBooleanEquality,id) }
| IDENT "Combined"; IDENT "Scheme"; id = identref; IDENT "from";
l = LIST1 identref SEP "," -> { VernacCombinedScheme (id, l) }
| IDENT "Register"; g = global; "as"; quid = qualid ->
{ VernacRegister(g, RegisterCoqlib quid) }
| IDENT "Register"; IDENT "Inline"; g = global ->
{ VernacRegister(g, RegisterInline) }
| IDENT "Primitive"; id = ident_decl; typopt = OPT [ ":"; typ = lconstr -> { typ } ]; ":="; r = register_token ->
{ VernacPrimitive(id, r, typopt) }
| IDENT "Universe"; l = LIST1 identref -> { VernacUniverse l }
| IDENT "Universes"; l = LIST1 identref -> { VernacUniverse l }
| IDENT "Constraint"; l = LIST1 univ_constraint SEP "," -> { VernacConstraint l }
] ]
;
register_token:
[ [ test_hash_ident; "#"; r = IDENT -> { CPrimitives.parse_op_or_type ~loc r } ] ]
;
thm_token:
[ [ "Theorem" -> { Theorem }
| IDENT "Lemma" -> { Lemma }
| IDENT "Fact" -> { Fact }
| IDENT "Remark" -> { Remark }
| IDENT "Corollary" -> { Corollary }
| IDENT "Proposition" -> { Proposition }
| IDENT "Property" -> { Property } ] ]
;
def_token:
[ [ "Definition" -> { (NoDischarge,Definition) }
| IDENT "Example" -> { (NoDischarge,Example) }
| IDENT "SubClass" -> { (NoDischarge,SubClass) } ] ]
;
assumption_token:
[ [ "Hypothesis" -> { (DoDischarge, Logical) }
| "Variable" -> { (DoDischarge, Definitional) }
| "Axiom" -> { (NoDischarge, Logical) }
| "Parameter" -> { (NoDischarge, Definitional) }
| IDENT "Conjecture" -> { (NoDischarge, Conjectural) } ] ]
;
assumptions_token:
[ [ IDENT "Hypotheses" -> { ("Hypotheses", (DoDischarge, Logical)) }
| IDENT "Variables" -> { ("Variables", (DoDischarge, Definitional)) }
| IDENT "Axioms" -> { ("Axioms", (NoDischarge, Logical)) }
| IDENT "Parameters" -> { ("Parameters", (NoDischarge, Definitional)) }
| IDENT "Conjectures" -> { ("Conjectures", (NoDischarge, Conjectural)) } ] ]
;
inline:
[ [ IDENT "Inline"; "("; i = natural; ")" -> { InlineAt i }
| IDENT "Inline" -> { DefaultInline }
| -> { NoInline } ] ]
;
univ_constraint:
[ [ l = universe_name; ord = [ "<" -> { Univ.Lt } | "=" -> { Univ.Eq } | "<=" -> { Univ.Le } ];
r = universe_name -> { (l, ord, r) } ] ]
;
univ_decl:
[ [ "@{" ; l = LIST0 identref; ext = [ "+" -> { true } | -> { false } ];
cs = [ "|"; l' = LIST0 univ_constraint SEP ",";
ext = [ "+" -> { true } | -> { false } ]; "}" -> { (l',ext) }
| ext = [ "}" -> { true } | bar_cbrace -> { false } ] -> { ([], ext) } ]
->
{ let open UState in
{ univdecl_instance = l;
univdecl_extensible_instance = ext;
univdecl_constraints = fst cs;
univdecl_extensible_constraints = snd cs } }
] ]
;
variance:
[ [ "+" -> { Univ.Variance.Covariant }
| "=" -> { Univ.Variance.Invariant }
| "*" -> { Univ.Variance.Irrelevant }
] ]
;
variance_identref:
[ [ id = identref -> { (id, None) }
| test_variance_ident; v = variance; id = identref -> { (id, Some v) }
(* We need this test to help the parser avoid the conflict
between "+" before ident (covariance) and trailing "+" (extra univs allowed) *)
] ]
;
cumul_univ_decl:
[ [ "@{" ; l = LIST0 variance_identref; ext = [ "+" -> { true } | -> { false } ];
cs = [ "|"; l' = LIST0 univ_constraint SEP ",";
ext = [ "+" -> { true } | -> { false } ]; "}" -> { (l',ext) }
| ext = [ "}" -> { true } | bar_cbrace -> { false } ] -> { ([], ext) } ]
->
{ let open UState in
{ univdecl_instance = l;
univdecl_extensible_instance = ext;
univdecl_constraints = fst cs;
univdecl_extensible_constraints = snd cs } }
] ]
;
ident_decl:
[ [ i = identref; l = OPT univ_decl -> { (i, l) }
] ]
;
cumul_ident_decl:
[ [ i = identref; l = OPT cumul_univ_decl -> { (i, l) }
] ]
;
inductive_token:
[ [ IDENT "Inductive" -> { Inductive_kw }
| IDENT "CoInductive" -> { CoInductive } ] ]
;
finite_token:
[ [ IDENT "Variant" -> { Variant }
| IDENT "Record" -> { Record }
| IDENT "Structure" -> { Structure }
| IDENT "Class" -> { Class true } ] ]
;
(* Simple definitions *)
def_body:
[ [ bl = binders; ":="; red = reduce; c = lconstr ->
{ match c.CAst.v with
| CCast(c, Some C.DEFAULTcast, t) -> DefineBody (bl, red, c, Some t)
| _ -> DefineBody (bl, red, c, None) }
| bl = binders; ":"; t = lconstr; ":="; red = reduce; c = lconstr ->
{ DefineBody (bl, red, c, Some t) }
| bl = binders; ":"; t = lconstr ->
{ ProveBody (bl, t) } ] ]
;
reduce:
[ [ IDENT "Eval"; r = red_expr; "in" -> { Some r }
| -> { None } ] ]
;
notation_declaration:
[ [ ntn = lstring; ":="; c = constr;
modl = syntax_modifiers;
scopt = OPT [ ":"; sc = IDENT -> { sc } ] ->
{ { ntn_decl_string = ntn; ntn_decl_interp = c;
ntn_decl_scope = scopt;
ntn_decl_modifiers = modl;
} } ] ]
;
decl_sep:
[ [ IDENT "and" -> { () } ] ]
;
decl_notations:
[ [ "where"; l = LIST1 notation_declaration SEP decl_sep -> { l }
| -> { [] } ] ]
;
(* Inductives and records *)
opt_constructors_or_fields:
[ [ ":="; lc = constructors_or_record -> { lc }
| ":=" -> { Constructors [] }
| -> { RecordDecl (None, [], None) } ] ]
;
inductive_or_record_definition:
[ [ oc = opt_coercion; id = cumul_ident_decl; indpar = binders;
extrapar = OPT [ "|"; p = binders -> { p } ];
c = OPT [ ":"; c = lconstr -> { c } ];
lc=opt_constructors_or_fields; ntn = decl_notations ->
{ (((oc,id),(indpar,extrapar),c,lc),ntn) } ] ]
;
constructors_or_record:
[ [ "|"; l = LIST1 constructor SEP "|" -> { Constructors l }
| attr = quoted_attributes ; id = identref ; c = constructor_type;
"|"; l = LIST1 constructor SEP "|" ->
{ Constructors ((c attr id)::l) }
| attr = quoted_attributes ; id = identref ; c = constructor_type ->
{ Constructors [ c attr id ] }
| attr = quoted_attributes ;
cstr = identref; "{"; fs = record_fields; "}"; id = default_inhabitant_ident ->
{ let () = unsupported_attributes attr in
RecordDecl (Some cstr,fs,id) }
| "{";fs = record_fields; "}"; id = default_inhabitant_ident -> { RecordDecl (None,fs,id) } ] ]
;
default_inhabitant_ident:
[ [ "as"; id = identref -> { Some id }
| -> { None } ] ]
;
(*
csort:
[ [ s = sort -> CSort (loc,s) ] ]
;
*)
opt_coercion:
[ [ ">" -> { AddCoercion }
| -> { NoCoercion } ] ]
;
(* (co)-fixpoints *)
fix_definition:
[ [ id_decl = ident_decl;
bl = binders_fixannot;
rtype = type_cstr;
body_def = OPT [":="; def = lconstr -> { def } ]; notations = decl_notations ->
{ let binders, rec_order = bl in
{fname = fst id_decl; univs = snd id_decl; rec_order; binders; rtype; body_def; notations}
} ] ]
;
cofix_definition:
[ [ id_decl = ident_decl; binders = binders; rtype = type_cstr;
body_def = OPT [":="; def = lconstr -> { def }]; notations = decl_notations ->
{ {fname = fst id_decl; univs = snd id_decl; rec_order = (); binders; rtype; body_def; notations}
} ]]
;
(* Inductive schemes *)
scheme:
[ [ kind = scheme_kind -> { (None,kind) }
| id = identref; ":="; kind = scheme_kind -> { (Some id,kind) } ] ]
;
scheme_kind:
[ [sch_type = scheme_type; "for"; sch_qualid = smart_global; IDENT "Sort"; sch_sort = sort_family
-> { {sch_type; sch_qualid; sch_sort} }
] ]
;
scheme_type:
[ [ IDENT "Induction" -> { SchemeInduction }
| IDENT "Minimality" -> { SchemeMinimality }
| IDENT "Elimination" -> { SchemeElimination }
| IDENT "Case" -> { SchemeCase }
] ]
;
(* Various Binders *)
(*
(* ... without coercions *)
binder_nodef:
[ [ b = binder_let ->
(match b with
CLocalAssum(l,ty) -> (l,ty)
| CLocalDef _ ->
user_err ~loc
(Pp.str"defined binder not allowed here.")) ] ]
;
*)
(* ... with coercions *)
record_field:
[ [ rfu_attrs = quoted_attributes ;
bd = record_binder; rfu_priority = OPT [ "|"; n = natural -> { n } ];
rfu_notation = decl_notations -> {
let (rfu_coercion, rfu_instance), rf_decl = bd in
rf_decl,
{ rfu_attrs ; rfu_coercion ; rfu_instance ; rfu_priority ;
rfu_notation } } ] ]
;
record_fields:
[ [ f = record_field; ";"; fs = record_fields -> { f :: fs }
| f = record_field -> { [f] }
| -> { [] }
] ]
;
field_body:
[ [ l = binders; oc = of_type_inst;
t = lconstr -> { fun id -> (oc,AssumExpr (id,l,t)) }
| l = binders; oc = of_type_inst;
t = lconstr; ":="; b = lconstr -> { fun id ->
(oc,DefExpr (id,l,b,Some t)) }
| l = binders; ":="; b = lconstr -> { fun id ->
(* Why are we dropping cast info here? *)
match b.CAst.v with
| CCast(b', _, t) ->
((NoCoercion,NoInstance),DefExpr(id,l,b',Some t))
| _ ->
((NoCoercion,NoInstance),DefExpr(id,l,b,None)) } ] ]
;
record_binder:
[ [ id = name -> { ((NoCoercion,NoInstance),AssumExpr(id, [], CAst.make ~loc @@ CHole (None, IntroAnonymous))) }
| id = name; f = field_body -> { f id } ] ]
;
assum_list:
[ [ bl = LIST1 assum_coe -> { bl } | b = assumpt -> { [b] } ] ]
;
assum_coe:
[ [ "("; a = assumpt; ")" -> { a } ] ]
;
assumpt:
[ [ idl = LIST1 ident_decl; oc = of_type; c = lconstr ->
{ (oc,(idl,c)) } ] ]
;
constructor_type:
[[ l = binders;
t= [ coe = of_type_inst; c = lconstr ->
{ fun l attr id -> ((attr, fst coe, snd coe),(id,mkProdCN ~loc l c)) }
| ->
{ fun l attr id -> ((attr,NoCoercion,NoInstance),(id,mkProdCN ~loc l (CAst.make ~loc @@ CHole (None, IntroAnonymous)))) } ]
-> { t l }
]]
;
constructor:
[ [ attr = quoted_attributes ;
id = identref; c=constructor_type -> { c attr id } ] ]
;
of_type:
[ [ ":>" -> { AddCoercion }
| ":"; ">" -> { AddCoercion }
| ":" -> { NoCoercion } ] ]
;
of_type_inst:
[ [ ":>" -> { (AddCoercion, BackInstanceWarning) (* replace with NoInstance at end of deprecation phase *) }
| ":"; ">" -> { (AddCoercion, BackInstanceWarning) (* replace with NoInstance at end of deprecation phase *) }
| "::" -> { (NoCoercion, BackInstance) }
| "::>" -> { (AddCoercion, BackInstance) }
| ":" -> { (NoCoercion, NoInstance) } ] ]
;
END
{
let test_only_starredidentrefs =
let open Pcoq.Lookahead in
to_entry "test_only_starredidentrefs" begin
lk_list (lk_ident <+> lk_kws ["Type"; "*"]) >> (lk_kws [".";")"])
end
let starredidentreflist_to_expr l =
match l with
| [] -> SsEmpty
| x :: xs -> List.fold_right (fun i acc -> SsUnion(i,acc)) xs x
let warn_deprecated_include_type =
CWarnings.create ~name:"deprecated-include-type" ~category:Deprecation.Version.v8_3
(fun () -> strbrk "Include Type is deprecated; use Include instead")
let warn_deprecated_as_ident_kind =
CWarnings.create ~name:"deprecated-as-ident-kind" ~category:Deprecation.Version.v8_14
(fun () -> strbrk "grammar kind \"as ident\" no longer accepts \"_\"; use \"as name\" instead to accept \"_\", too, or silence the warning if you actually intended to accept only identifiers.")
}
(* Modules and Sections *)
GRAMMAR EXTEND Gram
GLOBAL: gallina_ext module_expr module_type section_subset_expr;
gallina_ext:
[ [ (* Interactive module declaration *)
IDENT "Module"; export = export_token; id = identref;
bl = LIST0 module_binder; sign = of_module_type;
body = is_module_expr ->
{ VernacSynterp (VernacDefineModule (export, id, bl, sign, body)) }
| IDENT "Module"; "Type"; id = identref;
bl = LIST0 module_binder; sign = check_module_types;
body = is_module_type ->
{ VernacSynterp (VernacDeclareModuleType (id, bl, sign, body)) }
| IDENT "Declare"; IDENT "Module"; export = export_token; id = identref;
bl = LIST0 module_binder; ":"; mty = module_type_inl ->
{ VernacSynterp (VernacDeclareModule (export, id, bl, mty)) }
(* Section beginning *)
| IDENT "Section"; id = identref -> { VernacSynterp (VernacBeginSection id) }
(* This end a Section a Module or a Module Type *)
| IDENT "End"; id = identref -> { VernacSynterp (VernacEndSegment id) }
(* Naming a set of section hyps *)
| IDENT "Collection"; id = identref; ":="; expr = section_subset_expr ->
{ VernacSynPure (VernacNameSectionHypSet (id, expr)) }
(* Requiring an external file *)
| IDENT "From" ; ns = global ;
IDENT "Extra"; IDENT "Dependency"; f = ne_string ;
id = OPT [ "as"; id = IDENT -> { id } ] ->
{ VernacSynterp (VernacExtraDependency (ns, f, Option.map Id.of_string id)) }
(* Requiring an already compiled module *)
| IDENT "Require"; export = export_token; qidl = LIST1 filtered_import ->
{ VernacSynterp (VernacRequire (None, export, qidl)) }
| IDENT "From" ; ns = global ; IDENT "Require"; export = export_token
; qidl = LIST1 filtered_import ->
{ VernacSynterp (VernacRequire (Some ns, export, qidl)) }
| IDENT "Import"; cats = OPT import_categories; qidl = LIST1 filtered_import ->
{ VernacSynterp (VernacImport ((Import,cats),qidl)) }
| IDENT "Export"; cats = OPT import_categories; qidl = LIST1 filtered_import ->
{ VernacSynterp (VernacImport ((Export,cats),qidl)) }
| IDENT "Include"; e = module_type_inl; l = LIST0 ext_module_expr ->
{ VernacSynterp (VernacInclude(e::l)) }
| IDENT "Include"; "Type"; e = module_type_inl; l = LIST0 ext_module_type ->
{ warn_deprecated_include_type ~loc ();
VernacSynterp (VernacInclude(e::l)) } ] ]
;
import_categories:
[ [ negative = OPT "-"; "("; cats = LIST1 qualid SEP ","; ")" ->
{ let cats = List.map (fun cat -> CAst.make ?loc:cat.CAst.loc (Libnames.string_of_qualid cat)) cats in
{ negative=Option.has_some negative; import_cats = cats } }
] ]
;
filtered_import:
[ [ m = global -> { (m, ImportAll) }
| m = global; "("; ns = LIST1 one_import_filter_name SEP ","; ")" -> { (m, ImportNames ns) } ] ]
;
one_import_filter_name:
[ [ n = global; etc = OPT [ "("; ".."; ")" -> { () } ] -> { n, Option.has_some etc } ] ]
;
export_token:
[ [ IDENT "Import"; cats = OPT import_categories -> { Some (Import,cats) }
| IDENT "Export"; cats = OPT import_categories -> { Some (Export,cats) }
| -> { None } ] ]
;
ext_module_type:
[ [ "<+"; mty = module_type_inl -> { mty } ] ]
;
ext_module_expr:
[ [ "<+"; mexpr = module_expr_inl -> { mexpr } ] ]
;
check_module_type:
[ [ "<:"; mty = module_type_inl -> { mty } ] ]
;
check_module_types:
[ [ mtys = LIST0 check_module_type -> { mtys } ] ]
;
of_module_type:
[ [ ":"; mty = module_type_inl -> { Enforce mty }
| mtys = check_module_types -> { Check mtys } ] ]
;
is_module_type:
[ [ ":="; mty = module_type_inl ; l = LIST0 ext_module_type -> { (mty::l) }
| -> { [] } ] ]
;
is_module_expr:
[ [ ":="; mexpr = module_expr_inl; l = LIST0 ext_module_expr -> { (mexpr::l) }
| -> { [] } ] ]
;
functor_app_annot:
[ [ "["; IDENT "inline"; "at"; IDENT "level"; i = natural; "]" ->
{ InlineAt i }
| "["; IDENT "no"; IDENT "inline"; "]" -> { NoInline }
| -> { DefaultInline }
] ]
;
module_expr_inl:
[ [ "!"; me = module_expr -> { (me,NoInline) }
| me = module_expr; a = functor_app_annot -> { (me,a) } ] ]
;
module_type_inl:
[ [ "!"; me = module_type -> { (me,NoInline) }
| me = module_type; a = functor_app_annot -> { (me,a) } ] ]
;
(* Module binder *)
module_binder:
[ [ "("; export = export_token; idl = LIST1 identref; ":";
mty = module_type_inl; ")" -> { (export,idl,mty) } ] ]
;
(* Module expressions *)
module_expr:
[ [ me = module_expr_atom -> { CAst.make ~loc @@ CMident me }
| me1 = module_expr; me2 = module_expr_atom -> { CAst.make ~loc @@ CMapply (me1,me2) }
] ]
;
module_expr_atom:
[ [ qid = qualid -> { qid } | "("; me = module_expr_atom; ")" -> { me } ] ]
;
with_declaration:
[ [ "Definition"; fqid = fullyqualid; udecl = OPT univ_decl; ":="; c = Constr.lconstr ->
{ CWith_Definition (fqid,udecl,c) }
| IDENT "Module"; fqid = fullyqualid; ":="; qid = qualid ->
{ CWith_Module (fqid,qid) }
] ]
;
module_type:
[ [ qid = qualid -> { CAst.make ~loc @@ CMident qid }
| "("; mt = module_type; ")" -> { mt }
| mty = module_type; me = module_expr_atom ->
{ CAst.make ~loc @@ CMapply (mty,me) }
| mty = module_type; "with"; decl = with_declaration ->
{ CAst.make ~loc @@ CMwith (mty,decl) }
] ]
;
(* Proof using *)
section_subset_expr:
[ [ test_only_starredidentrefs; l = LIST0 starredidentref ->
{ starredidentreflist_to_expr l }
| e = ssexpr -> { e } ]]
;
starredidentref:
[ [ i = identref -> { SsSingl i }
| i = identref; "*" -> { SsFwdClose(SsSingl i) }
| "Type" -> { SsType }
| "Type"; "*" -> { SsFwdClose SsType } ]]
;
ssexpr:
[ "35"
[ "-"; e = ssexpr -> { SsCompl e } ]
| "50"
[ e1 = ssexpr; "-"; e2 = ssexpr-> { SsSubstr(e1,e2) }
| e1 = ssexpr; "+"; e2 = ssexpr-> { SsUnion(e1,e2) } ]
| "0"
[ i = starredidentref -> { i }
| "()" -> { SsEmpty }
| "("; test_only_starredidentrefs; l = LIST0 starredidentref; ")"->
{ starredidentreflist_to_expr l }
| "("; test_only_starredidentrefs; l = LIST0 starredidentref; ")"; "*" ->
{ SsFwdClose(starredidentreflist_to_expr l) }
| "("; e = ssexpr; ")"-> { e }
| "("; e = ssexpr; ")"; "*" -> { SsFwdClose e } ] ]
;
END
(* Extensions: implicits, coercions, etc. *)
GRAMMAR EXTEND Gram
GLOBAL: gallina_ext hint_info scope_delimiter;
gallina_ext: TOP
[ [ (* Transparent and Opaque *)
IDENT "Transparent"; l = LIST1 smart_global ->
{ VernacSynPure (VernacSetOpacity (Conv_oracle.transparent, l)) }
| IDENT "Opaque"; l = LIST1 smart_global ->
{ VernacSynPure (VernacSetOpacity (Conv_oracle.Opaque, l)) }
| IDENT "Strategy"; l =
LIST1 [ v=strategy_level; "["; q=LIST1 smart_global; "]" -> { (v,q) } ] ->
{ VernacSynPure (VernacSetStrategy l) }
(* Canonical structure *)
| IDENT "Canonical"; OPT [ IDENT "Structure" -> {()} ]; qid = global; ud = OPT [ u = OPT univ_decl; d = def_body -> { (u,d) } ] ->
{ match ud with
| None ->
VernacSynPure (VernacCanonical CAst.(make ?loc:qid.CAst.loc @@ AN qid))
| Some (u,d) ->
let s = coerce_reference_to_id qid in
VernacSynPure (VernacDefinition ((NoDischarge,CanonicalStructure),((CAst.make ?loc:qid.CAst.loc (Name s)),u),d)) }
| IDENT "Canonical"; OPT [ IDENT "Structure" -> {()} ]; ntn = by_notation ->
{ VernacSynPure (VernacCanonical CAst.(make ~loc @@ ByNotation ntn)) }
(* Coercions *)
| IDENT "Coercion"; qid = global; ud = OPT [ u = OPT univ_decl; d = def_body -> { u, d } ] ->
{ match ud with Some (u, d) -> let s = coerce_reference_to_id qid in
VernacSynPure (VernacDefinition ((NoDischarge,Coercion),((CAst.make ?loc:qid.CAst.loc (Name s)),u),d))
| None -> VernacSynPure (VernacCoercion (CAst.make ~loc @@ AN qid, None)) }
| IDENT "Identity"; IDENT "Coercion"; f = identref; ":";
s = coercion_class; ">->"; t = coercion_class ->
{ VernacSynPure (VernacIdentityCoercion (f, s, t)) }
| IDENT "Coercion"; qid = global; ":"; s = coercion_class; ">->";
t = coercion_class ->
{ VernacSynPure (VernacCoercion (CAst.make ~loc @@ AN qid, Some(s, t))) }
| IDENT "Coercion"; ntn = by_notation; ":"; s = coercion_class; ">->";
t = coercion_class ->
{ VernacSynPure (VernacCoercion (CAst.make ~loc @@ ByNotation ntn, Some (s, t))) }
| IDENT "Context"; c = LIST1 binder ->
{ VernacSynPure (VernacContext (List.flatten c)) }
| IDENT "Instance"; namesup = instance_name; ":";
t = term LEVEL "200";
info = hint_info ;
props = [ ":="; "{"; r = record_declaration; "}" -> { Some (true,r) } |
":="; c = lconstr -> { Some (false,c) } | -> { None } ] ->
{ VernacSynPure (VernacInstance (fst namesup,snd namesup,t,props,info)) }
| IDENT "Existing"; IDENT "Instance"; id = global;
info = hint_info ->
{ VernacSynPure (VernacExistingInstance [id, info]) }
| IDENT "Existing"; IDENT "Instances"; ids = LIST1 global;
pri = OPT [ "|"; i = natural -> { i } ] ->
{ let info = { Typeclasses.hint_priority = pri; hint_pattern = None } in
let insts = List.map (fun i -> (i, info)) ids in
VernacSynPure (VernacExistingInstance insts) }
| IDENT "Existing"; IDENT "Class"; is = global -> { VernacSynPure (VernacExistingClass is) }
(* Arguments *)
| IDENT "Arguments"; qid = smart_global;
args = LIST0 arg_specs;
more_implicits = OPT
[ ","; impl = LIST1
[ impl = LIST0 implicits_alt -> { List.flatten impl } ]
SEP "," -> { impl }
];
mods = OPT [ ":"; l = LIST1 args_modifier SEP "," -> { l } ] ->
{ let mods = match mods with None -> [] | Some l -> List.flatten l in
let more_implicits = Option.default [] more_implicits in
VernacSynPure (VernacArguments (qid, List.flatten args, more_implicits, mods)) }
| IDENT "Implicit"; "Type"; bl = reserv_list ->
{ VernacSynPure (VernacReserve bl) }
| IDENT "Implicit"; IDENT "Types"; bl = reserv_list ->
{ test_plural_form_types loc "Implicit Types" bl;
VernacSynPure (VernacReserve bl) }
| IDENT "Generalizable";
gen = [IDENT "All"; IDENT "Variables" -> { Some [] }
| IDENT "No"; IDENT "Variables" -> { None }
| ["Variable" -> { () } | IDENT "Variables" -> { () } ];
idl = LIST1 identref -> { Some idl } ] ->
{ VernacSynPure (VernacGeneralizable gen) } ] ]
;
args_modifier:
[ [ IDENT "simpl"; IDENT "nomatch" -> { [`ReductionDontExposeCase] }
| IDENT "simpl"; IDENT "never" -> { [`ReductionNeverUnfold] }
| IDENT "default"; IDENT "implicits" -> { [`DefaultImplicits] }
| IDENT "clear"; IDENT "implicits" -> { [`ClearImplicits] }
| IDENT "clear"; IDENT "scopes" -> { [`ClearScopes] }
| IDENT "clear"; IDENT "bidirectionality"; IDENT "hint" -> { [`ClearBidiHint] }
| IDENT "rename" -> { [`Rename] }
| IDENT "assert" -> { [`Assert] }
| IDENT "extra"; IDENT "scopes" -> { [`ExtraScopes] }
| IDENT "clear"; IDENT "scopes"; IDENT "and"; IDENT "implicits" ->
{ [`ClearImplicits; `ClearScopes] }
| IDENT "clear"; IDENT "implicits"; IDENT "and"; IDENT "scopes" ->
{ [`ClearImplicits; `ClearScopes] }
] ]
;
scope_delimiter:
[ [ "%"; key = IDENT -> { key } ] ]
;
argument_spec: [
[ b = OPT "!"; id = name ; s = LIST0 scope_delimiter ->
{ id.CAst.v, not (Option.is_empty b), List.map (fun x -> CAst.make ~loc x) s }
]
];
(* List of arguments implicit status, scope, modifiers *)
arg_specs: [
[ item = argument_spec ->
{ let name, recarg_like, notation_scope = item in
[RealArg { name=name; recarg_like=recarg_like;
notation_scope=notation_scope;
implicit_status = Explicit}] }
| "/" -> { [VolatileArg] }
| "&" -> { [BidiArg] }
| "("; items = LIST1 argument_spec; ")"; scl = LIST0 scope_delimiter ->
{ let scl = List.map (CAst.make ~loc) scl in
List.map (fun (name,recarg_like,notation_scope) ->
RealArg { name=name; recarg_like=recarg_like;
notation_scope = notation_scope @ scl;
implicit_status = Explicit}) items }
| "["; items = LIST1 argument_spec; "]"; scl = LIST0 scope_delimiter ->
{ let scl = List.map (CAst.make ~loc) scl in
List.map (fun (name,recarg_like,notation_scope) ->
RealArg { name=name; recarg_like=recarg_like;
notation_scope = notation_scope @ scl;
implicit_status = NonMaxImplicit}) items }
| "{"; items = LIST1 argument_spec; "}"; scl = LIST0 scope_delimiter ->
{ let scl = List.map (CAst.make ~loc) scl in
List.map (fun (name,recarg_like,notation_scope) ->
RealArg { name=name; recarg_like=recarg_like;
notation_scope = notation_scope @ scl;
implicit_status = MaxImplicit}) items }
]
];
(* Same as [arg_specs], but with only implicit status and names *)
implicits_alt: [
[ name = name -> { [(name.CAst.v, Explicit)] }
| "["; items = LIST1 name; "]" ->
{ List.map (fun name -> (name.CAst.v, NonMaxImplicit)) items }
| "{"; items = LIST1 name; "}" ->
{ List.map (fun name -> (name.CAst.v, MaxImplicit)) items }
]
];
instance_name:
[ [ name = ident_decl; bl = binders ->
{ (CAst.map (fun id -> Name id) (fst name), snd name), bl }
| -> { ((CAst.make ~loc Anonymous), None), [] } ] ]
;
hint_info:
[ [ "|"; i = OPT natural; pat = OPT constr_pattern ->
{ { Typeclasses.hint_priority = i; hint_pattern = pat } }
| -> { { Typeclasses.hint_priority = None; hint_pattern = None } } ] ]
;
reserv_list:
[ [ bl = LIST1 reserv_tuple -> { bl } | b = simple_reserv -> { [b] } ] ]
;
reserv_tuple:
[ [ "("; a = simple_reserv; ")" -> { a } ] ]
;
simple_reserv:
[ [ idl = LIST1 identref; ":"; c = lconstr -> { (idl,c) } ] ]
;
END
GRAMMAR EXTEND Gram
GLOBAL: command query_command coercion_class gallina_ext search_query search_queries;
gallina_ext: TOP
[ [ IDENT "Export"; "Set"; table = setting_name; v = option_setting ->
{ VernacSynterp (VernacSetOption (true, table, v)) }
| IDENT "Export"; IDENT "Unset"; table = setting_name ->
{ VernacSynterp (VernacSetOption (true, table, OptionUnset)) }
] ];
command:
[ [ IDENT "Comments"; l = LIST0 comment -> { VernacSynPure (VernacComments l) }
| IDENT "Library";
b = [ IDENT "Comment" -> { Docstring.Comment }
| IDENT "Warning" -> { Docstring.Warning }
| IDENT "Deprecation"; s = OPT [ IDENT "since"; s = STRING -> { s } ] -> { Docstring.Deprecation s } ];
s = STRING -> { VernacSynPure (VernacLibraryComment (b, s)) }
(* Hack! Should be in grammar_ext, but camlp5 factorizes badly *)
| IDENT "Declare"; IDENT "Instance"; id = ident_decl; bl = binders; ":";
t = term LEVEL "200";
info = hint_info ->
{ VernacSynPure (VernacDeclareInstance (id, bl, t, info)) }
(* Should be in syntax, but camlp5 would not factorize *)
| IDENT "Declare"; IDENT "Scope"; sc = IDENT ->
{ VernacSynPure (VernacDeclareScope sc) }
(* System directory *)
| IDENT "Pwd" -> { VernacSynterp (VernacChdir None) }
| IDENT "Cd" -> { VernacSynterp (VernacChdir None) }
| IDENT "Cd"; dir = ne_string -> { VernacSynterp (VernacChdir (Some dir)) }
| IDENT "Load"; verbosely = [ IDENT "Verbose" -> { true } | -> { false } ];
s = [ s = ne_string -> { s } | s = IDENT -> { s } ] ->
{ VernacSynterp (VernacLoad (verbosely, s)) }
| IDENT "Declare"; IDENT "ML"; IDENT "Module"; l = LIST1 ne_string ->
{ VernacSynterp (VernacDeclareMLModule l) }
| IDENT "Locate"; l = locatable -> { VernacSynPure (VernacLocate l) }
(* Type-Checking *)
| "Type"; c = lconstr -> { VernacSynPure (VernacGlobalCheck c) }
(* Printing (careful factorization of entries) *)
| IDENT "Print"; p = printable -> { VernacSynPure (VernacPrint p) }
| IDENT "Print"; qid = smart_global; l = OPT univ_name_list -> { VernacSynPure (VernacPrint (PrintName (qid,l))) }
| IDENT "Print"; IDENT "Module"; "Type"; qid = global ->
{ VernacSynPure (VernacPrint (PrintModuleType qid)) }
| IDENT "Print"; IDENT "Module"; qid = global ->
{ VernacSynPure (VernacPrint (PrintModule qid)) }
| IDENT "Print"; IDENT "Namespace" ; ns = dirpath ->
{ VernacSynPure (VernacPrint (PrintNamespace ns)) }
| IDENT "Inspect"; n = natural -> { VernacSynPure (VernacPrint (PrintInspect n)) }
(* For acting on parameter tables *)
| "Set"; table = setting_name; v = option_setting ->
{ VernacSynterp (VernacSetOption (false, table, v)) }
| IDENT "Unset"; table = setting_name ->
{ VernacSynterp (VernacSetOption (false, table, OptionUnset)) }
| IDENT "Print"; IDENT "Table"; table = setting_name ->
{ VernacSynPure (VernacPrintOption table) }
| IDENT "Add"; table = IDENT; field = IDENT; v = LIST1 table_value
-> { VernacSynPure (VernacAddOption ([table;field], v)) }
(* A global value below will be hidden by a field above! *)
(* In fact, we give priority to secondary tables *)
(* No syntax for tertiary tables due to conflict *)
(* (but they are unused anyway) *)
| IDENT "Add"; table = IDENT; v = LIST1 table_value ->
{ VernacSynPure (VernacAddOption ([table], v)) }
| IDENT "Test"; table = setting_name; "for"; v = LIST1 table_value
-> { VernacSynPure (VernacMemOption (table, v)) }
| IDENT "Test"; table = setting_name ->
{ VernacSynPure (VernacPrintOption table) }
| IDENT "Remove"; table = IDENT; field = IDENT; v= LIST1 table_value
-> { VernacSynPure (VernacRemoveOption ([table;field], v)) }
| IDENT "Remove"; table = IDENT; v = LIST1 table_value ->
{ VernacSynPure (VernacRemoveOption ([table], v)) } ]]
;
query_command: (* TODO: rapprocher Eval et Check *)
[ [ IDENT "Eval"; r = red_expr; "in"; c = lconstr; "." ->
{ fun g -> VernacCheckMayEval (Some r, g, c) }
| IDENT "Compute"; c = lconstr; "." ->