Source file cbn.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
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
open Util
open Names
open Constr
open Context
open Univ
open Environ
open EConstr
open Vars
open Context.Rel.Declaration
(** This module implements a call by name reduction used by the cbn tactic.
It has an ability to "refold" constants by storing constants and
their parameters in its stack.
*)
(** Machinery to custom the behavior of the reduction *)
module ReductionBehaviour = Reductionops.ReductionBehaviour
type cst_info = { volatile : bool; refold_after_iota : bool }
module CbnClos = struct
open EConstr
type t = { term : constr; subst : subs; mutable forced : constr option }
and subs = t Esubst.subs
type view = subs * (EConstr.t, EConstr.t, ESorts.t, EInstance.t, ERelevance.t) Constr.kind_of_term
let id_subst = Esubst.subs_id 0
let inject term = { term; subst = id_subst; forced = None }
let lift n c =
if Int.equal n 0 then c else { term = c.term; subst = Esubst.subs_shft (n, c.subst); forced = None }
let mk_clos subst term =
if Esubst.is_subs_id subst then inject term else
match Constr.kind (EConstr.Unsafe.to_constr term) with
| Rel n -> begin match Esubst.expand_rel n subst with
| Inl (k, v) -> lift k v
| Inr (k, _) -> inject (mkRel k)
end
| _ ->
{ term; subst; forced = None }
let mk_clos_vect subst v = Array.map (mk_clos subst) v
let is_id_subst c = Esubst.is_subs_id c.subst
let mk_app f args =
match args with
| [] -> f
| _ :: _ ->
let nargs = List.length args in
let term = mkApp (mkRel 1, Array.init nargs (fun i -> mkRel (i + 2))) in
let subst = List.fold_right Esubst.subs_cons (f :: args) id_subst in
mk_clos subst term
let mk_array u elems def ty =
let n = Array.length elems in
let term = mkArray (u, Array.init n (fun i -> mkRel (i + 1)), mkRel (n + 1), mkRel (n + 2)) in
let subst = List.fold_right Esubst.subs_cons (Array.to_list elems @ [def; ty]) id_subst in
mk_clos subst term
let rec force c =
if Esubst.is_subs_id c.subst then c.term
else match c.forced with
| Some t -> t
| None ->
let t = force_constr c.subst c.term in
c.forced <- Some t;
t
and force_constr subs c =
EConstr.Vars.esubst (fun k v -> force (lift k v)) subs c
let force_vect v = Array.map force v
let force_under_context subs (nas,c) =
nas, force_constr (Esubst.subs_liftn (Array.length nas) subs) c
let force_invert subs = function
| NoInvert -> NoInvert
| CaseInvert { indices } -> CaseInvert { indices = Array.Fun1.map force_constr subs indices }
let force_return subs (p, r) =
(force_under_context subs p, r)
let force_branches subs brs = Array.Fun1.map force_under_context subs brs
let force_case subs (ci, u, pms, ret, iv, brs) =
let pms = Array.Fun1.map force_constr subs pms in
let ret = force_return subs ret in
let iv = force_invert subs iv in
let brs = force_branches subs brs in
ci, u, pms, ret, iv, brs
let mk_clos_fix subs (struc,(nas, ts, bs)) =
struc, (nas, mk_clos_vect subs ts, mk_clos_vect (Esubst.subs_liftn (Array.length nas) subs) bs)
let force_fix subs f =
let ((ri, n), (names, types, bodies)) = mk_clos_fix subs f in
((ri, n), (names, force_vect types, force_vect bodies))
let force_cofix subs (n, (names, types, bodies)) =
let nb = Array.length bodies in
(n, (names, force_vect (mk_clos_vect subs types), force_vect (mk_clos_vect (Esubst.subs_liftn nb subs) bodies)))
let equal sigma a b =
(a.term == b.term && a.subst == b.subst) ||
let a = force a in
let b = force b in
EConstr.eq_constr sigma a b
let rec kind sigma c : view =
match EConstr.kind sigma c.term with
| Rel n ->
begin match Esubst.expand_rel n c.subst with
| Inl (k, v) -> kind sigma (lift k v)
| Inr (k, _) ->
Esubst.subs_id 0, Rel k
end
| k -> c.subst, k
type array_view = {
array_length : int;
array_get : int -> t;
array_default : t;
}
let array_view sigma c =
match kind sigma c with
| subs, Array (_,elems,def,ty) -> Some {
array_length = Array.length elems;
array_get = (fun i -> mk_clos subs elems.(i));
array_default = mk_clos subs def;
}
| _ -> None
end
let mk_clos = CbnClos.mk_clos
let mk_clos_vect = CbnClos.mk_clos_vect
(** Machinery about stack of unfolded constants *)
module Cst_stack = struct
open EConstr
(** constant * params * args
- constant applied to params = term in head applied to args
- there is at most one arguments with an empty list of args, it must be the first.
- in args, the int represents the indice of the first arg to consider *)
type t = (constr * CbnClos.t list * (int * CbnClos.t array) list * cst_info) list
let empty : t = []
let all_volatile (l : t) = CList.for_all (fun (_,_,_,{volatile; _}) -> volatile) l
let drop_useless (l : t) : t = match l with
| _ :: ((_,_,[],_)::_ as q) -> q
| l -> l
let add_param (h : CbnClos.t) (cst_l : t) : t =
let append2cst = function
| (c,params,[],vol) -> (c, h::params, [], vol)
| (c,params,((i,t)::q),vol) when i = pred (Array.length t) ->
(c, params, q, vol)
| (c,params,(i,t)::q, vol) ->
(c, params, (succ i,t)::q, vol)
in
drop_useless (List.map append2cst cst_l)
let add_args (cl : CbnClos.t array) (l : t) : t =
List.map (fun (a,b,args,vol) -> (a,b,(0,cl)::args,vol)) l
let add_cst ?(volatile=false) ?(refold_after_iota=false) (cst : constr) (l : t) : t = match l with
| (_,_,[],_) :: q as l -> l
| l -> (cst,[],[],{volatile; refold_after_iota})::l
let best_cst (l : t) : (constr * CbnClos.t list) option = match l with
| (cst,params,[],_)::_ -> Some(cst,params)
| _ -> None
let reference sigma (t : t) = match best_cst t with
| Some (c, params) when isConst sigma c -> Some (fst (destConst sigma c), List.map CbnClos.force params)
| _ -> None
(** [best_replace d cst_l c] makes the best replacement for [d]
by [cst_l] in [c] *)
let best_replace sigma d (cst_l : t) c =
let reconstruct_head = List.fold_left
(fun t (i,args) ->
let args = Array.map CbnClos.force (Array.sub args i (Array.length args - i)) in
mkApp (t,args)) in
List.fold_right
(fun (cst,params,args,_) t -> Termops.replace_term sigma
(reconstruct_head d args)
(applist (cst, List.rev_map CbnClos.force params))
t) cst_l c
let pr env sigma pr_a (l : t) =
let open Pp in
let p_c c = Termops.Internal.print_constr_env env sigma c in
prlist_with_sep pr_semicolon
(fun (c,params,args,{volatile; refold_after_iota}) ->
hov 1 (str"(" ++ p_c c ++ str ")" ++ spc () ++ pr_sequence pr_a params ++ spc () ++ str "(args:" ++
pr_sequence (fun (i,el) -> prvect_with_sep spc pr_a (Array.sub el i (Array.length el - i))) args ++
str ")" ++
(if volatile then str " (volatile)" else mt()) ++
(if refold_after_iota then str " (refold-after-iota)" else mt()))) l
end
(** The type of (machine) stacks (= lambda-bar-calculus' contexts) *)
module Stack =
struct
open EConstr
type app_node = int * CbnClos.t array * int
let pr_app_node pr (i,a,j) =
let open Pp in surround (
prvect_with_sep pr_comma pr (Array.sub a i (j - i + 1))
)
type cst_member =
| Cst_const of pconstant
| Cst_proj of Projection.t * ERelevance.t
type case_stk =
case_info * EInstance.t * EConstr.t array * (EConstr.t,ERelevance.t) pcase_return * EConstr.t pcase_invert * (EConstr.t,ERelevance.t) pcase_branch array
type member =
| App of app_node
| Case of CbnClos.subs * case_stk * Cst_stack.t
| Proj of Projection.t * ERelevance.t * Cst_stack.t
| Fix of CbnClos.subs * (EConstr.t, EConstr.t, ERelevance.t) pfixpoint * t * Cst_stack.t
| Primitive of CPrimitives.t * (Constant.t * EInstance.t) * t * CPrimitives.args_red * Cst_stack.t
| Cst of { const : cst_member;
curr : int;
remains : int list;
params : t;
volatile : bool;
refold_after_iota : bool;
cst_l : Cst_stack.t;
}
and t = member list
let rec pr_member pr_c member =
let open Pp in
let pr_c x = hov 1 (pr_c x) in
match member with
| App app -> str "ZApp" ++ pr_app_node pr_c app
| Case (subs,(_,_,_,_,_,br),cst) ->
str "ZCase(" ++
prvect_with_sep pr_bar (fun (nas, b) ->
let b = mk_clos (Esubst.subs_liftn (Array.length nas) subs) b in
pr_c b) br
++ str ")"
| Proj (p,_,cst) ->
str "ZProj(" ++ Projection.debug_print p ++ str ")"
| Fix (subs,f,args,cst) ->
let f = CbnClos.mk_clos_fix subs f in
str "ZFix(" ++ Constr.debug_print_fix pr_c f
++ pr_comma () ++ pr pr_c args ++ str ")"
| Primitive (p,c,args,kargs,cst_l) ->
str "ZPrimitive(" ++ str (CPrimitives.to_string p)
++ pr_comma () ++ pr pr_c args ++ str ")"
| Cst {const=mem;curr;remains;params;cst_l;refold_after_iota} ->
str "ZCst(" ++ pr_cst_member pr_c mem ++ pr_comma () ++ int curr
++ pr_comma () ++
prlist_with_sep pr_semicolon int remains ++
pr_comma () ++ pr pr_c params ++
(if refold_after_iota then str ", refold-after-iota" else mt()) ++ str ")"
and pr pr_c l =
let open Pp in
prlist_with_sep pr_semicolon (fun x -> hov 1 (pr_member pr_c x)) l
and pr_cst_member pr_c c =
let open Pp in
match c with
| Cst_const (c, u) ->
if UVars.Instance.is_empty u then Constant.debug_print c
else str"(" ++ Constant.debug_print c ++ str ", " ++
UVars.Instance.pr Sorts.raw_printer u ++ str")"
| Cst_proj (p,r) ->
str".(" ++ Projection.debug_print p ++ str")"
let empty = []
let append_app v s =
let le = Array.length v in
if Int.equal le 0 then s else App (0,v,pred le) :: s
let decomp_node (i,l,j) sk =
if i < j then (l.(i), App (succ i,l,j) :: sk)
else (l.(i), sk)
let decomp = function
| App node::s -> Some (decomp_node node s)
| _ -> None
let decomp_node_last (i,l,j) sk =
if i < j then (l.(j), App (i,l,pred j) :: sk)
else (l.(j), sk)
let equal env sigma sk1 sk2 =
let equal_cst_member x y =
match x, y with
| Cst_const (c1,u1), Cst_const (c2, u2) ->
QConstant.equal env c1 c2 && UVars.Instance.equal u1 u2
| Cst_proj (p1,_), Cst_proj (p2,_) -> QProjection.Repr.equal env (Projection.repr p1) (Projection.repr p2)
| _, _ -> false
in
let eq_case (ci1, u1, pms1, (p1,_), _, br1) (ci2, u2, pms2, (p2,_), _, br2) =
let eq_under_ctx (nas1, c1) (nas2, c2) =
Int.equal (Array.length nas1) (Array.length nas2) &&
EConstr.eq_constr sigma c1 c2
in
Array.equal (EConstr.eq_constr sigma) pms1 pms2 &&
eq_under_ctx p1 p2 &&
Array.equal eq_under_ctx br1 br2
in
let rec equal_rec sk1 sk2 =
match sk1,sk2 with
| [],[] -> true
| App a1 :: s1, App a2 :: s2 ->
let t1,s1' = decomp_node_last a1 s1 in
let t2,s2' = decomp_node_last a2 s2 in
(CbnClos.equal sigma t1 t2) && (equal_rec s1' s2')
| Case (subs1,c1,_) :: s1, Case (subs2,c2,_) :: s2 ->
let c1 = CbnClos.force_case subs1 c1
and c2 = CbnClos.force_case subs2 c2 in
eq_case c1 c2 && equal_rec s1 s2
| (Proj (p,_,_)::s1, Proj(p2,_,_)::s2) ->
QProjection.Repr.equal env (Projection.repr p) (Projection.repr p2)
&& equal_rec s1 s2
| Fix (subs1,f1,s1,_) :: s1', Fix (subs2,f2,s2,_) :: s2' ->
let f1 = CbnClos.force_fix subs1 f1
and f2 = CbnClos.force_fix subs2 f2 in
EConstr.eq_constr sigma (mkFix f1) (mkFix f2)
&& equal_rec (List.rev s1) (List.rev s2)
&& equal_rec s1' s2'
| Cst c1::s1', Cst c2::s2' ->
equal_cst_member c1.const c2.const
&& equal_rec (List.rev c1.params) (List.rev c2.params)
&& equal_rec s1' s2'
| ((App _|Case _|Proj _|Fix _|Cst _|Primitive _)::_|[]), _ -> false
in equal_rec (List.rev sk1) (List.rev sk2)
let append_app_list l s =
let a = Array.of_list l in
append_app a s
let rec args_size = function
| App (i,_,j)::s -> j + 1 - i + args_size s
| (Case _|Fix _|Proj _|Cst _|Primitive _)::_ | [] -> 0
let strip_app s =
let rec aux out = function
| ( App _ as e) :: s -> aux (e :: out) s
| s -> List.rev out,s
in aux [] s
let strip_n_app n s =
let rec aux n out = function
| App (i,a,j) as e :: s ->
let nb = j - i + 1 in
if n >= nb then
aux (n - nb) (e::out) s
else
let p = i+n in
Some (CList.rev
(if Int.equal n 0 then out else App (i,a,p-1) :: out),
a.(p),
if j > p then App(succ p,a,j)::s else s)
| s -> None
in aux n [] s
let will_expose_iota args =
List.exists
(function (Fix (_,_,_,l) | Case (_,_,l) |
Proj (_,_,l) | Cst {cst_l=l}) when Cst_stack.all_volatile l -> true | _ -> false)
args
let list_of_app_stack s =
let rec aux = function
| App (i,a,j) :: s ->
let (args',s') = aux s in
let a' = Array.sub a i (j - i + 1) in
(Array.fold_right (fun x y -> x::y) a' args', s')
| s -> ([],s) in
let (out,s') = aux s in
let init = match s' with [] -> true | _ -> false in
Option.init init out
let app_stack_for_all p s =
let rec aux = function
| App (i,a,j) :: s ->
let rec loop k = k > j || (p a.(k) && loop (succ k)) in
loop i && aux s
| [] -> true
| _ :: _ -> false
in aux s
let tail n0 s0 =
let rec aux n s =
if Int.equal n 0 then s else
match s with
| App (i,a,j) :: s ->
let nb = j - i + 1 in
if n >= nb then
aux (n - nb) s
else
let p = i+n in
if j >= p then App(p,a,j)::s else s
| _ -> raise (Invalid_argument "Reductionops.Stack.tail")
in aux n0 s0
let nth s p =
match strip_n_app p s with
| Some (_,el,_) -> el
| None -> raise Not_found
(** This function breaks the abstraction of Cst_stack ! *)
let best_state_opt sigma sk l =
let rec aux sk def = function
|(_,_,_,{volatile=true; _}) -> def
|(cst, params, [], _) -> Some (CbnClos.inject cst, append_app_list (List.rev params) sk)
|(cst, params, (i,t)::q, vol) -> match decomp sk with
| Some (el,sk') when CbnClos.equal sigma el t.(i) ->
if i = pred (Array.length t)
then aux sk' def (cst, params, q, vol)
else aux sk' def (cst, params, (succ i,t)::q, vol)
| _ -> def
in List.fold_left (aux sk) None l
let best_state sigma (_,sk as s) l =
match best_state_opt sigma sk l with
| Some s -> s
| None -> s
let constr_of_cst_member sigma f sk =
match f with
| Cst_const (c, u) -> CbnClos.inject (mkConstU (c, EInstance.make u)), sk
| Cst_proj (p,r) ->
match decomp sk with
| Some (hd, sk) -> CbnClos.inject (mkProj (p, r, CbnClos.force hd)), sk
| None -> assert false
let zip ?(refold=false) sigma s =
let open CbnClos in
let best_refold = best_state_opt sigma in
let rec zip = function
| f, [] -> force f
| f, (App (i,a,j) :: s) ->
let a' = if Int.equal i 0 && Int.equal j (Array.length a - 1)
then a
else Array.sub a i (j - i + 1) in
zip (inject (mkApp (force f, Array.map force a')), s)
| f, (Case (subs,case,cst_l)::s) when refold ->
begin match best_refold s cst_l with
| Some state -> zip state
| None ->
let (ci,u,pms,rt,iv,br) = CbnClos.force_case subs case in
let case = mkCase (ci, u, pms, rt, iv, CbnClos.force f, br) in
zip (inject case, s)
end
| f, (Case (subs,case,_)::s) ->
let (ci,u,pms,rt,iv,br) = force_case subs case in
zip (inject (mkCase (ci, u, pms, rt, iv, force f, br)), s)
| f, (Fix (subs,fix,st,cst_l)::s) when refold ->
let sk = st @ append_app [|f|] s in
begin match best_refold sk cst_l with
| Some state -> zip state
| None -> zip (inject (mkFix (force_fix subs fix)), sk)
end
| f, (Fix (subs,fix,st,_)::s) -> zip
(inject (mkFix (force_fix subs fix)), st @ (append_app [|f|] s))
| f, (Cst {const;params;cst_l}::s) when refold ->
let sk = params @ append_app [|f|] s in
begin match const with
| Cst_const (c, u) ->
begin match best_refold sk cst_l with
| Some state -> zip state
| None -> zip (inject (mkConstU (c, EInstance.make u)), sk)
end
| Cst_proj (p, r) ->
match decomp sk with
| Some (hd, sk) ->
begin match best_refold sk cst_l with
| Some state -> zip state
| None -> zip (inject (mkProj (p, r, force hd)), sk)
end
| None -> assert false
end
| f, (Cst {const;params}::s) ->
zip (constr_of_cst_member sigma const (params @ (append_app [|f|] s)))
| f, (Proj (p,r,cst_l)::s) when refold ->
begin match best_refold s cst_l with
| Some state -> zip state
| None -> zip (inject (mkProj (p,r,force f)),s)
end
| f, (Proj (p,r,_)::s) -> zip (inject (mkProj (p,r,force f)),s)
| f, (Primitive (p,c,args,kargs,cst_l)::s) ->
zip (inject (mkConstU c), args @ append_app [|f|] s)
in
zip s
let check_native_args op stk =
let nargs = CPrimitives.arity op in
let rargs = args_size stk in
nargs <= rargs
let get_next_primitive_args kargs stk =
let rec nargs = function
| [] -> 0
| CPrimitives.Kwhnf :: _ -> 0
| _ :: s -> 1 + nargs s
in
let n = nargs kargs in
(List.skipn (n+1) kargs, strip_n_app n stk)
end
(** The type of (machine) states (= lambda-bar-calculus' cuts) *)
let clos_of_app_stack sigma x args =
if CbnClos.is_id_subst x && Stack.app_stack_for_all CbnClos.is_id_subst args then
CbnClos.inject (Stack.zip sigma (x,args))
else match Stack.list_of_app_stack args with
| Some args -> CbnClos.mk_app x args
| None -> assert false
let reduce_array_primitive sigma u p args =
let get i = Array.get args i in
let get_int i = match CbnClos.kind sigma (get i) with
| subs, Int i -> Some i
| _ -> None
in
let get_array i = CbnClos.array_view sigma (get i) in
let bounded_index len i =
if Uint63.le Uint63.zero i && Uint63.lt i (Uint63.of_int len)
then Some (snd (Uint63.to_int2 i))
else None
in
let elems_of_array a = Array.init a.CbnClos.array_length a.CbnClos.array_get in
let mk_array elems def ty = CbnClos.mk_array u elems def ty in
try match p with
| CPrimitives.Arraymake ->
begin match get_int 1 with
| Some len ->
let a = Parray.make len (get 2) in
let elems, def = Parray.to_array a in
Some (mk_array elems def (get 0))
| None -> None
end
| CPrimitives.Arrayget ->
begin match get_array 1, get_int 2 with
| Some a, Some i ->
let elt = match bounded_index a.CbnClos.array_length i with
| Some i -> a.CbnClos.array_get i
| None -> a.CbnClos.array_default
in
Some elt
| _, _ -> None
end
| CPrimitives.Arraydefault ->
begin match get_array 1 with
| Some a -> Some a.CbnClos.array_default
| None -> None
end
| CPrimitives.Arrayset ->
begin match get_array 1, get_int 2 with
| Some a, Some i ->
let elems = match bounded_index a.CbnClos.array_length i with
| Some i -> Array.init a.CbnClos.array_length (fun j -> if Int.equal i j then get 3 else a.CbnClos.array_get j)
| None -> elems_of_array a
in
Some (mk_array elems a.CbnClos.array_default (get 0))
| _, _ -> None
end
| CPrimitives.Arraycopy ->
begin match get_array 1 with
| Some a -> Some (mk_array (elems_of_array a) a.CbnClos.array_default (get 0))
| None -> None
end
| CPrimitives.Arraylength ->
begin match get_array 1 with
| Some a -> Some (CbnClos.inject (mkInt (Uint63.of_int a.CbnClos.array_length)))
| None -> None
end
| _ -> None
with Invalid_argument _ -> None
let apply_subst sigma cst_l t stack =
let rec aux cst_l t stack =
match (Stack.decomp stack, CbnClos.kind sigma t) with
| Some (h,stacktl), (subs, Lambda (_,_,c)) ->
let cst_l' = Cst_stack.add_param h cst_l in
aux cst_l' (mk_clos (Esubst.subs_cons h subs) c) stacktl
| _ ->
(cst_l, (t, stack))
in
aux cst_l t stack
(** @return c if there is a constant c whose body is bd
@return bd else.
It has only a meaning because internal representation of "Fixpoint f x
:= t" is Definition f := fix f x => t
Even more fragile that we could hope because do Module M. Fixpoint
f x := t. End M. Definition f := u. and say goodbye to any hope
of refolding M.f this way ...
*)
let magically_constant_of_fixbody env sigma (reference, params) bd = function
| Name.Anonymous -> bd
| Name.Name id ->
let open UnivProblem in
let cst = Constant.change_label reference id in
if not (Environ.mem_constant cst env) then bd
else
let (cst, u), ctx = UnivGen.fresh_constant_instance env cst in
match constant_opt_value_in env (cst,u) with
| None -> bd
| Some t ->
let csts = EConstr.eq_constr_universes env sigma (Reductionops.beta_applist sigma (EConstr.of_constr t, params)) bd in
begin match csts with
| Some csts ->
let addqs l r (qs,us) = Sorts.QVar.Map.add l r qs, us in
let addus l r (qs,us) = qs, Univ.Level.Map.add l r us in
let subst = Set.fold (fun cst acc ->
match cst with
| QLeq _ | QElimTo _ -> assert false
| QEq (a, b) ->
let a = match a with
| QVar q -> q
| _ -> assert false
in
addqs a b acc
| ULub (u, v) | UWeak (u, v) -> addus u v acc
| UEq (u, v) | ULe (u, v) ->
let get u = match u with
| Sorts.SProp | Sorts.Prop -> assert false
| Sorts.Set -> Level.set
| Sorts.Type u | Sorts.GSort (_, u)
| Sorts.VSort (_, u) -> Option.get (Universe.level u)
in
addus (get u) (get v) acc)
csts UVars.empty_sort_subst
in
let inst = UVars.subst_sort_level_instance subst u in
applist (mkConstU (cst, EInstance.make inst), params)
| None -> bd
end
let contract_cofix env sigma ?reference ?current_refold base_subs (bodynum,(names,types,bodies as cofix)) =
let nbodies = Array.length bodies in
let current_refold = Option.map
(fun (cst, params) -> CbnClos.mk_app (CbnClos.inject cst) (List.rev params))
current_refold in
let make_Fi j =
let ind = nbodies-j-1 in
let bd = CbnClos.mk_clos base_subs (mkCoFix (ind,cofix)) in
if Int.equal bodynum ind then Option.default bd current_refold
else match reference with
| None -> bd
| Some r ->
CbnClos.inject (magically_constant_of_fixbody env sigma r (CbnClos.force bd) names.(ind).binder_name) in
let closure = List.init nbodies make_Fi in
let subst = List.fold_right Esubst.subs_cons closure base_subs in
CbnClos.mk_clos subst bodies.(bodynum)
(** Similar to the "fix" case below *)
let singleton_best_cst = function
| [_] as cst_l -> Cst_stack.best_cst cst_l
| [] | _ :: _ :: _ -> None
let reduce_and_refold_cofix recfun env sigma cst_l subs ((_,(_,_,bodies)) as cofix) sk =
let current_refold = singleton_best_cst cst_l in
let reference =
if Array.length bodies > 1 then Cst_stack.reference sigma cst_l
else None
in
let raw_answer =
contract_cofix env sigma ?reference ?current_refold subs cofix in
let (x, (t, sk')) = apply_subst sigma Cst_stack.empty raw_answer sk in
let t = match cst_l, current_refold with
| [], _ | _, Some _ -> t
| _ :: _, None ->
let d = mkCoFix (CbnClos.force_cofix subs cofix) in
CbnClos.inject (Cst_stack.best_replace sigma d cst_l (CbnClos.force t))
in
recfun x (t, sk')
let contract_fix env sigma ?reference ?current_refold base_subs ((recindices,bodynum),(names,types,bodies as fixdata)) =
let nbodies = Array.length recindices in
let current_refold = Option.map
(fun (cst, params) -> CbnClos.mk_app (CbnClos.inject cst) (List.rev params))
current_refold in
let make_Fi j =
let ind = nbodies-j-1 in
let bd = CbnClos.mk_clos base_subs (mkFix ((recindices,ind),fixdata)) in
if Int.equal bodynum ind then Option.default bd current_refold
else match reference with
| None -> bd
| Some r -> CbnClos.inject (magically_constant_of_fixbody env sigma r (CbnClos.force bd) names.(ind).binder_name) in
let closure = List.init nbodies make_Fi in
let subst = List.fold_right Esubst.subs_cons closure base_subs in
CbnClos.mk_clos subst bodies.(bodynum)
(** First we substitute the Rel bodynum by the fixpoint and then we try to
replace the fixpoint by the best constant from [cst_l]
Other rels are directly substituted by constants "magically found from the
context" in contract_fix *)
let reduce_and_refold_fix recfun env sigma cst_l subs (((_,_),(_,_,bodies)) as fix) sk =
let current_refold = singleton_best_cst cst_l in
let reference =
if Array.length bodies > 1 then Cst_stack.reference sigma cst_l
else None
in
let raw_answer =
contract_fix env sigma ?reference ?current_refold subs fix in
let (x, (t, sk')) = apply_subst sigma Cst_stack.empty raw_answer sk in
let t = match cst_l, current_refold with
| [], _ | _, Some _ -> t
| _ :: _, None ->
let d = mkFix (CbnClos.force_fix subs fix) in
CbnClos.inject (Cst_stack.best_replace sigma d cst_l (CbnClos.force t))
in
recfun x (t, sk')
module CredNative = Reductionops.CredNative
(** Generic reduction function with environment
Here is where unfolded constant are stored in order to be
eventually refolded.
It uses ReductionBehaviour, prefers
refold constant instead of value and tries to infer constants
fix and cofix came from.
It substitutes fix and cofix by the constant they come from in
contract_* in any case .
*)
let debug_RAKAM = Reductionops.debug_RAKAM
let equal_stacks env sigma (x, l) (y, l') =
Stack.equal env sigma l l' && CbnClos.equal sigma x y
let cbn_subst_of_rel_context_instance_list sign args subst =
let open Context.Rel.Declaration in
let rec aux subst sign l = match sign, l with
| LocalAssum _ :: sign', a::args' -> aux (Esubst.subs_cons a subst) sign' args'
| LocalDef (_,c,_)::sign', args' ->
let c = CbnClos.mk_clos subst c in
aux (Esubst.subs_cons c subst) sign' args'
| [], [] -> subst
| _ -> CErrors.anomaly (Pp.str "Instance and signature do not match.")
in aux subst (List.rev sign) args
let apply_branch env sigma (ind, i) args subs (ci, u, pms, iv, r, lf) =
let args = Stack.tail ci.ci_npar args in
let args = Option.get (Stack.list_of_app_stack args) in
let br = lf.(i - 1) in
let body = snd br in
let subs =
if Int.equal ci.ci_cstr_nargs.(i - 1) ci.ci_cstr_ndecls.(i - 1) then
List.fold_left (fun subst arg -> Esubst.subs_cons arg subst) subs args
else
let pms = Array.Fun1.map CbnClos.force_constr subs pms in
let ctx = expand_branch env sigma u pms (ind, i) (fst br, mkProp) in
cbn_subst_of_rel_context_instance_list ctx args subs
in
CbnClos.mk_clos subs body
exception PatternFailure
let match_einstance sigma pu u psubst =
match UVars.Instance.pattern_match pu (EInstance.kind sigma u) psubst with
| Some psubst -> psubst
| None -> raise PatternFailure
let match_sort ps s psubst =
match Sorts.pattern_match ps s psubst with
| Some psubst -> psubst
| None -> raise PatternFailure
let rec match_arg_pattern whrec env sigma ctx psubst p t =
let open Declarations in
match p with
| EHole i ->
let t = CbnClos.force t in
let t' = EConstr.it_mkLambda_or_LetIn t ctx in
Partial_subst.add_term i t' psubst
| EHoleIgnored -> psubst
| ERigid (ph, es) ->
let t, stk = whrec ctx (t, Stack.empty) in
let psubst = match_rigid_arg_pattern whrec env sigma ctx psubst ph t in
let psubst, stk = apply_rule whrec env sigma ctx psubst es stk in
match stk with
| [] -> psubst
| _ :: _ -> raise PatternFailure
and match_rigid_arg_pattern whrec env sigma ctx psubst p t =
let subs, kt = CbnClos.kind sigma t in
match [@ocaml.warning "-4"] p, kt with
| PHInd (ind, pu), Ind (ind', u) ->
if QInd.equal env ind ind' then match_einstance sigma pu u psubst else raise PatternFailure
| PHConstr (constr, pu), Construct (constr', u) ->
if QConstruct.equal env constr constr' then match_einstance sigma pu u psubst else raise PatternFailure
| PHRel i, Rel n when i = n -> psubst
| PHSort ps, Sort s -> match_sort ps (ESorts.kind sigma s) psubst
| PHSymbol (c, pu), Const (c', u) ->
if QConstant.equal env c c' then match_einstance sigma pu u psubst else raise PatternFailure
| PHInt i, Int i' ->
if Uint63.equal i i' then psubst else raise PatternFailure
| PHFloat f, Float f' ->
if Float64.equal f f' then psubst else raise PatternFailure
| PHString s, String s' ->
if Pstring.equal s s' then psubst else raise PatternFailure
| PHLambda (ptys, pbod), _ ->
let t = CbnClos.force t in
let ntys, _ = EConstr.decompose_lambda sigma t in
let na = List.length ntys and np = Array.length ptys in
if np > na then raise PatternFailure;
let ntys, body = EConstr.decompose_lambda_n sigma np t in
let ctx' = List.map (fun (n, ty) -> Context.Rel.Declaration.LocalAssum (n, ty)) ntys in
let tys = Array.of_list @@ List.rev_map snd ntys in
let na = Array.length tys in
let contexts_upto = Array.init na (fun i -> List.skipn (na - i) ctx' @ ctx) in
let tys = Array.map CbnClos.inject tys in
let psubst = Array.fold_left3 (fun psubst ctx -> match_arg_pattern whrec env sigma ctx psubst) psubst contexts_upto ptys tys in
let psubst = match_arg_pattern whrec env sigma (ctx' @ ctx) psubst (ERigid pbod) (CbnClos.inject body) in
psubst
| PHProd (ptys, pbod), _ ->
let t = CbnClos.force t in
let ntys, _ = EConstr.decompose_prod sigma t in
let na = List.length ntys and np = Array.length ptys in
if np > na then raise PatternFailure;
let ntys, body = EConstr.decompose_prod_n sigma np t in
let ctx' = List.map (fun (n, ty) -> Context.Rel.Declaration.LocalAssum (n, ty)) ntys in
let tys = Array.of_list @@ List.rev_map snd ntys in
let na = Array.length tys in
let contexts_upto = Array.init na (fun i -> List.skipn (na - i) ctx' @ ctx) in
let tys = Array.map CbnClos.inject tys in
let psubst = Array.fold_left3 (fun psubst ctx -> match_arg_pattern whrec env sigma ctx psubst) psubst contexts_upto ptys tys in
let psubst = match_arg_pattern whrec env sigma (ctx' @ ctx) psubst pbod (CbnClos.inject body) in
psubst
| (PHInd _ | PHConstr _ | PHRel _ | PHInt _ | PHFloat _ | PHString _ | PHSort _ | PHSymbol _), _ -> raise PatternFailure
and args n s =
if n = 0 then List.rev args, s else
match Stack.decomp s with
| Some (arg, rest) -> extract_n_stack (arg :: args) (n-1) rest
| None -> raise PatternFailure
and apply_rule whrec env sigma ctx psubst es stk =
match [@ocaml.warning "-4"] es, stk with
| [], _ -> psubst, stk
| Declarations.PEApp pargs :: e, s ->
let np = Array.length pargs in
let pargs = Array.to_list pargs in
let args, s = extract_n_stack [] np s in
let psubst = List.fold_left2 (match_arg_pattern whrec env sigma ctx) psubst pargs args in
apply_rule whrec env sigma ctx psubst e s
| Declarations.PECase (pind, pret, pbrs) :: e, Stack.Case (subs,(ci, _, _, _, _, _ as case), cst_l) :: s ->
if not @@ QInd.equal env pind ci.ci_ind then raise PatternFailure;
let dummy = mkProp in
let (ci, u, pms, p, iv, brs) = CbnClos.force_case subs case in
let (_, _, _, ((ntys_ret, ret), _), _, _, brs) = EConstr.annotate_case env sigma (ci, u, pms, p, iv, dummy, brs) in
let psubst = match_arg_pattern whrec env sigma (ntys_ret @ ctx) psubst pret (CbnClos.inject ret) in
let psubst = Array.fold_left2 (fun psubst pat (ctx', br) -> match_arg_pattern whrec env sigma (ctx' @ ctx) psubst pat (CbnClos.inject br)) psubst pbrs brs in
apply_rule whrec env sigma ctx psubst e s
| Declarations.PEProj proj :: e, Stack.Proj (proj', r, cst_l') :: s ->
if not @@ QProjection.Repr.equal env proj (Projection.repr proj') then raise PatternFailure;
apply_rule whrec env sigma ctx psubst e s
| _, _ -> raise PatternFailure
let rec apply_rules whrec env sigma u r stk =
let open Declarations in
match r with
| [] -> raise PatternFailure
| { lhs_pat = (pu, elims); nvars; rhs } :: rs ->
try
let psubst = Partial_subst.make nvars in
let psubst = match_einstance sigma pu u psubst in
let psubst, stk = apply_rule whrec env sigma [] psubst elims stk in
let subst, qsubst, usubst = Partial_subst.to_arrays psubst in
let usubst = UVars.Instance.of_array (qsubst, usubst) in
let rhsu = subst_instance_constr (EConstr.EInstance.make usubst) (EConstr.of_constr rhs) in
let rhs' = substl (Array.to_list subst) rhsu in
(CbnClos.inject rhs', stk)
with PatternFailure -> apply_rules whrec env sigma u rs stk
let rec is_case sigma x = match CbnClos.kind sigma x with
| (subs, Lambda (_,_, x)) | (subs, LetIn (_,_,_, x)) ->
is_case sigma (CbnClos.mk_clos (Esubst.subs_lift subs) x)
| (subs, Cast (x, _,_)) -> is_case sigma (CbnClos.mk_clos subs x)
| (subs, App (hd, _)) -> is_case sigma (CbnClos.mk_clos subs hd)
| (_, Case _) -> true
| _ -> false
let rec whd_state_gen ?csts flags env sigma =
let open Context.Named.Declaration in
let open ReductionBehaviour in
let rec whrec cst_l (x, stack) =
let () = debug_RAKAM (fun () ->
let open Pp in
let pr c = Termops.Internal.print_constr_env env sigma (CbnClos.force c) in
(h (str "<<" ++ pr x ++
str "|" ++ cut () ++ Cst_stack.pr env sigma pr cst_l ++
str "|" ++ cut () ++ Stack.pr pr stack ++
str ">>")))
in
let reduce_primitive_value () =
match Stack.strip_app stack with
| (_, Stack.Primitive(p,(_,u as kn),rargs,kargs,cst_l')::s) ->
let more_to_reduce = List.exists (fun k -> CPrimitives.Kwhnf = k) kargs in
if more_to_reduce then
let (kargs,o) = Stack.get_next_primitive_args kargs s in
let (before,a,after) = Option.get o in
Some (whrec Cst_stack.empty (a,Stack.Primitive(p,kn,rargs @ Stack.append_app [|x|] before,kargs,cst_l')::after))
else
let n = List.length kargs in
let (args,s) = Stack.strip_app s in
let (args,) =
try List.chop n args
with List.IndexOutOfRange -> (args,[])
in
let s = extra_args @ s in
let args = Option.get (Stack.list_of_app_stack (rargs @ Stack.append_app [|x|] args)) in
let args = Array.of_list args in
Some
(match reduce_array_primitive sigma u p args with
| Some t -> whrec cst_l' (t,s)
| None ->
let args = Array.map CbnClos.force args in
match CredNative.red_prim env sigma p u args with
| Some t -> whrec cst_l' (CbnClos.inject t,s)
| None -> ((CbnClos.inject (mkApp (mkConstU kn, args)), s), cst_l))
| _ -> None
in
let fold () =
let () = debug_RAKAM (fun () ->
Pp.(str "<><><><><>")) in
((x, stack),cst_l)
in
let c0 = CbnClos.kind sigma x in
match c0 with
| _, Rel n when RedFlags.red_set flags RedFlags.fDELTA ->
(match lookup_rel n env with
| LocalDef (_,body,_) -> whrec Cst_stack.empty (CbnClos.lift n (CbnClos.inject body), stack)
| _ -> fold ())
| _, Var id when RedFlags.red_set flags (RedFlags.fVAR id) ->
(match lookup_named id env with
| LocalDef (_,body,_) ->
whrec (Cst_stack.add_cst (mkVar id) cst_l) (CbnClos.inject body, stack)
| _ -> fold ())
| _, (Evar _ | Meta _) -> fold ()
| _, Const (c,u as const) ->
Reductionops.reduction_effect_hook env sigma c
(lazy (Stack.zip sigma (x,fst (Stack.strip_app stack))));
if RedFlags.red_set flags (RedFlags.fCONST c) then
let u' = EInstance.kind sigma u in
match constant_value_in env sigma (c, u) with
| body ->
begin
match ReductionBehaviour.get c with
| None -> whrec (Cst_stack.add_cst (mkConstU const) cst_l) (CbnClos.inject body, stack)
| Some behavior ->
begin match behavior with
| NeverUnfold -> fold ()
| (UnfoldWhen { nargs = Some n } |
UnfoldWhenNoMatch { nargs = Some n } )
when Stack.args_size stack < n ->
fold ()
| UnfoldWhenNoMatch { recargs; nargs } ->
let app_sk,sk = Stack.strip_app stack in
let volatile = Option.has_some nargs in
let (tm',sk'),cst_l' =
match recargs with
| [] ->
let cst_l = Cst_stack.add_cst ~volatile ~refold_after_iota:true
(mkConstU const) cst_l in
whrec cst_l (CbnClos.inject body, app_sk)
| curr :: remains -> match Stack.strip_n_app curr app_sk with
| None -> (x,app_sk), cst_l
| Some (bef,arg,app_sk') ->
let cst_l = Stack.Cst
{ const = Stack.Cst_const (fst const, u');
volatile;
refold_after_iota = true;
curr; remains; params=bef; cst_l;
}
in
whrec Cst_stack.empty (arg,cst_l :: app_sk')
in
let recarg_changed = match recargs with
| [] -> false
| curr :: _ ->
not (CbnClos.equal sigma x tm') ||
match Stack.strip_n_app curr app_sk, Stack.strip_n_app curr sk' with
| Some (_, arg, _), Some (_, arg', _) ->
not (CbnClos.equal sigma arg arg')
| _ -> false
in
if (not recarg_changed && equal_stacks env sigma (x, app_sk) (tm', sk'))
|| Stack.will_expose_iota sk'
|| is_case sigma tm'
then fold ()
else whrec cst_l' (tm', sk' @ sk)
| UnfoldWhen { recargs; nargs } ->
begin match recargs with
| [] ->
whrec cst_l (CbnClos.inject body, stack)
| curr :: remains -> match Stack.strip_n_app curr stack with
| None -> fold ()
| Some (bef,arg,s') ->
let cst_l = Stack.Cst
{ const = Stack.Cst_const (fst const, u');
volatile = Option.has_some nargs;
refold_after_iota = false;
curr; remains; params=bef; cst_l;
}
in
whrec Cst_stack.empty (arg,cst_l::s')
end
end
end
| exception NotEvaluableConst (IsPrimitive (u,p)) when Stack.check_native_args p stack ->
let kargs = CPrimitives.kind p in
let (kargs,o) = Stack.get_next_primitive_args kargs stack in
let (before,a,after) = Option.get o in
whrec Cst_stack.empty (a,Stack.Primitive(p,const,before,kargs,cst_l)::after)
| exception NotEvaluableConst (HasRules (u', b, r)) ->
begin try
let red_fun ctx =
let env = push_rel_context ctx env in
whd_state_gen flags env sigma
in
let rhs_stack = apply_rules red_fun env sigma u r stack in
whrec Cst_stack.empty rhs_stack
with PatternFailure ->
if not b then fold () else
match Stack.strip_app stack with
| args, (Stack.Fix (subs,f,s',cst_l)::s'') when RedFlags.red_set flags RedFlags.fFIX ->
let x' = clos_of_app_stack sigma x args in
let out_sk = s' @ (Stack.append_app [|x'|] s'') in
reduce_and_refold_fix whrec env sigma cst_l subs f out_sk
| _ -> fold ()
end
| exception NotEvaluableConst _ -> fold ()
else fold ()
| subs, Proj (p, r, c) when RedFlags.red_projection flags p ->
(let npars = Projection.npars p in
let c = mk_clos subs c in
match ReductionBehaviour.get (Environ.projection_repr_constant env (Projection.repr p)) with
| None ->
let stack' = (c, Stack.Proj (p, r, cst_l) :: stack) in
let stack'', csts = whrec Cst_stack.empty stack' in
if equal_stacks env sigma stack' stack'' then fold ()
else stack'', csts
| Some behavior ->
begin match behavior with
| NeverUnfold -> fold ()
| (UnfoldWhen { nargs = Some n }
| UnfoldWhenNoMatch { nargs = Some n })
when Stack.args_size stack < n - (npars + 1) -> fold ()
| UnfoldWhen { recargs }
| UnfoldWhenNoMatch { recargs }->
let recargs = List.map_filter (fun x ->
let idx = x - npars in
if idx < 0 then None else Some idx) recargs
in
let volatile = match behavior with
| UnfoldWhen {nargs} -> Option.has_some nargs
| UnfoldWhenNoMatch _ | NeverUnfold -> false
in
match recargs with
| [] ->
let stack' = (c, Stack.Proj (p, r, cst_l) :: stack) in
whrec Cst_stack.empty stack'
| curr :: remains ->
match Stack.strip_n_app curr (Stack.append_app [|c|] stack) with
| None -> fold ()
| Some (bef,arg,s') ->
let cst_l = Stack.Cst
{ const=Stack.Cst_proj (p,r);
curr;
remains;
volatile;
refold_after_iota =
(match behavior with
| UnfoldWhenNoMatch _ -> true
| UnfoldWhen _ | NeverUnfold -> false);
params=bef;
cst_l;
}
in
whrec Cst_stack.empty (arg,cst_l::s')
end)
| subs, LetIn (_,b,_,c) when RedFlags.red_set flags RedFlags.fZETA ->
whrec cst_l (mk_clos (Esubst.subs_cons (mk_clos subs b) subs) c, stack)
| subs, Cast (c,_,_) -> whrec cst_l (mk_clos subs c, stack)
| subs, App (f,cl) ->
let f = mk_clos subs f in
let cl = mk_clos_vect subs cl in
whrec
(Cst_stack.add_args cl cst_l)
(f, Stack.append_app cl stack)
| subs, Lambda (na,t,c) ->
(match Stack.decomp stack with
| Some _ when RedFlags.red_set flags RedFlags.fBETA ->
let (cst_l, p) = apply_subst sigma cst_l x stack in
whrec cst_l p
| _ -> fold ())
| subs, Case (ci,u,pms,p,iv,d,lf) ->
whrec Cst_stack.empty (mk_clos subs d, Stack.Case (subs,(ci,u,pms,p,iv,lf),cst_l) :: stack)
| subs, Fix ((ri,n),_ as f) ->
(match Stack.strip_n_app ri.(n) stack with
|None -> fold ()
|Some (bef,arg,s') ->
whrec Cst_stack.empty (arg, Stack.Fix(subs,f,bef,cst_l)::s'))
| _, Construct (cstr ,u) ->
let use_match = RedFlags.red_set flags RedFlags.fMATCH in
let use_fix = RedFlags.red_set flags RedFlags.fFIX in
if use_match || use_fix then
match Stack.strip_app stack with
|args, (Stack.Case(subs,case,case_cst_l)::s') when use_match ->
let r = apply_branch env sigma cstr args subs case in
whrec Cst_stack.empty (r, s')
|args, (Stack.Proj (p,_,_)::s') when use_match ->
whrec Cst_stack.empty (Stack.nth args (Projection.npars p + Projection.arg p), s')
|args, (Stack.Fix (subs,f,s',cst_l)::s'') when use_fix ->
let x' = clos_of_app_stack sigma x args in
let out_sk = s' @ (Stack.append_app [|x'|] s'') in
reduce_and_refold_fix whrec env sigma cst_l subs f out_sk
|args, (Stack.Cst {const;curr;remains;volatile;refold_after_iota;params=s';cst_l} :: s'') ->
let x' = clos_of_app_stack sigma x args in
begin match remains with
| [] ->
(match const with
| Stack.Cst_const const ->
(match constant_opt_value_in env const with
| None -> fold ()
| Some body ->
let const = (fst const, EInstance.make (snd const)) in
let body = EConstr.of_constr body in
let cst_l = Cst_stack.add_cst ~volatile ~refold_after_iota (mkConstU const) cst_l in
whrec cst_l (CbnClos.inject body, s' @ (Stack.append_app [|x'|] s'')))
| Stack.Cst_proj (p,r) ->
let stack = s' @ (Stack.append_app [|x'|] s'') in
match Stack.strip_n_app 0 stack with
| None -> assert false
| Some (_,arg,s'') ->
whrec Cst_stack.empty (arg, Stack.Proj (p,r,cst_l) :: s''))
| next :: remains' -> match Stack.strip_n_app (next-curr-1) s'' with
| None -> fold ()
| Some (bef,arg,s''') ->
let cst_l = Stack.Cst
{ const;
curr=next;
volatile;
refold_after_iota;
remains=remains';
params=s' @ (Stack.append_app [|x'|] bef);
cst_l;
}
in
whrec Cst_stack.empty (arg, cst_l :: s''')
end
|_, (Stack.App _)::_ -> assert false
|_, _ -> fold ()
else fold ()
| subs, CoFix cofix ->
if RedFlags.red_set flags RedFlags.fCOFIX then
match Stack.strip_app stack with
|args, ((Stack.Case _ |Stack.Proj _)::s') ->
reduce_and_refold_cofix whrec env sigma cst_l subs cofix stack
|_ -> fold ()
else fold ()
| _, (Int _ | Float _ | String _ | Array _) ->
begin match reduce_primitive_value () with
| Some res -> res
| None ->
begin match Stack.strip_app stack with
|args, (Stack.Cst {const;curr;remains;volatile;refold_after_iota;params=s';cst_l} :: s'') ->
let x' = clos_of_app_stack sigma x args in
begin match remains with
| [] ->
(match const with
| Stack.Cst_const const ->
(match constant_opt_value_in env const with
| None -> fold ()
| Some body ->
let const = (fst const, EInstance.make (snd const)) in
let body = EConstr.of_constr body in
let cst_l = Cst_stack.add_cst ~volatile ~refold_after_iota (mkConstU const) cst_l in
whrec cst_l (CbnClos.inject body, s' @ (Stack.append_app [|x'|] s'')))
| Stack.Cst_proj (p,r) ->
let stack = s' @ (Stack.append_app [|x'|] s'') in
match Stack.strip_n_app 0 stack with
| None -> assert false
| Some (_,arg,s'') ->
whrec Cst_stack.empty (arg, Stack.Proj (p,r,cst_l) :: s''))
| next :: remains' -> match Stack.strip_n_app (next-curr-1) s'' with
| None -> fold ()
| Some (bef,arg,s''') ->
let cst_l = Stack.Cst
{ const;
curr=next;
volatile;
refold_after_iota;
remains=remains';
params=s' @ (Stack.append_app [|x'|] bef);
cst_l;
}
in
whrec Cst_stack.empty (arg, cst_l :: s''')
end
| _ -> fold ()
end
end
| _, (Rel _ | Var _ | LetIn _ | Proj _) -> fold ()
| _, (Sort _ | Ind _ | Prod _) -> fold ()
in
fun xs ->
let (s,cst_l) = whrec (Option.default Cst_stack.empty csts) xs in
Stack.best_state sigma s cst_l
let whd_cbn flags env sigma t =
let state = whd_state_gen flags env sigma (CbnClos.inject t, Stack.empty) in
Stack.zip ~refold:true sigma state
let norm_cbn flags env sigma t =
let push_rel_check_zeta d env =
let open RedFlags in
let d = match d with
| LocalDef (na,_,t) when not (red_set flags fZETA) -> LocalAssum (na,t)
| d -> d in
push_rel d env
in
let rec strongrec env t =
Termops.map_constr_with_full_binders env sigma
push_rel_check_zeta strongrec env (whd_cbn flags env sigma t)
in
strongrec env t