-
Notifications
You must be signed in to change notification settings - Fork 632
/
inductive.ml
1641 lines (1455 loc) · 66 KB
/
inductive.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) *)
(************************************************************************)
open CErrors
open Util
open Names
open Univ
open UVars
open Constr
open Vars
open Declarations
open Declareops
open Environ
open Reduction
open Type_errors
open Context.Rel.Declaration
(* raises an anomaly if not an inductive type *)
let lookup_mind_specif env (kn,tyi) =
let mib = Environ.lookup_mind kn env in
if tyi >= Array.length mib.mind_packets then
user_err Pp.(str "Inductive.lookup_mind_specif: invalid inductive index");
(mib, mib.mind_packets.(tyi))
let find_rectype env c =
let (t, l) = decompose_app_list (whd_all env c) in
match kind t with
| Ind ind -> (ind, l)
| _ -> raise Not_found
let find_inductive env c =
let (t, l) = decompose_app_list (whd_all env c) in
match kind t with
| Ind ind
when (fst (lookup_mind_specif env (out_punivs ind))).mind_finite <> CoFinite -> (ind, l)
| _ -> raise Not_found
let find_coinductive env c =
let (t, l) = decompose_app_list (whd_all env c) in
match kind t with
| Ind ind
when (fst (lookup_mind_specif env (out_punivs ind))).mind_finite == CoFinite -> (ind, l)
| _ -> raise Not_found
let inductive_params (mib,_) = mib.mind_nparams
let inductive_paramdecls (mib,u) =
Vars.subst_instance_context u mib.mind_params_ctxt
let inductive_nonrec_rec_paramdecls (mib,u) =
let nnonrecparamdecls = mib.mind_nparams - mib.mind_nparams_rec in
let paramdecls = inductive_paramdecls (mib,u) in
Context.Rel.chop_nhyps nnonrecparamdecls paramdecls
let instantiate_inductive_constraints mib u =
UVars.AbstractContext.instantiate u (Declareops.inductive_polymorphic_context mib)
(************************************************************************)
let instantiate_params t u args sign =
let fail () =
anomaly ~label:"instantiate_params" (Pp.str "type, ctxt and args mismatch.") in
let (rem_args, subs, ty) =
Context.Rel.fold_outside
(fun decl (largs,subs,ty) ->
match (decl, largs, kind ty) with
| (LocalAssum _, a::args, Prod(_,_,t)) -> (args, a::subs, t)
| (LocalDef (_,b,_), _, LetIn(_,_,_,t)) ->
(largs, (substl subs (subst_instance_constr u b))::subs, t)
| _ -> fail ())
sign
~init:(args,[],t)
in
let () = if not (List.is_empty rem_args) then fail () in
substl subs ty
let full_constructor_instantiate (_,u,(mib,_),params) t =
let inst_ind = subst_instance_constr u t in
instantiate_params inst_ind u params mib.mind_params_ctxt
(************************************************************************)
(************************************************************************)
(* Functions to build standard types related to inductive *)
(*
Computing the actual sort of an applied or partially applied inductive type:
I_i: forall uniformparams:utyps, forall otherparams:otyps, Type(a)
uniformargs : utyps
otherargs : otyps
I_1:forall ...,s_1;...I_n:forall ...,s_n |- sort(C_kj(uniformargs)) = s_kj
s'_k = max(..s_kj..)
merge(..s'_k..) = ..s''_k..
--------------------------------------------------------------------
Gamma |- I_i uniformargs otherargs : phi(s''_i)
where
- if p=0, phi() = Prop
- if p=1, phi(s) = s
- if p<>1, phi(s) = sup(Set,s)
Remark: Set (predicative) is encoded as Type(0)
*)
(* Template polymorphism *)
let no_sort_variable () =
CErrors.anomaly (Pp.str "A sort variable was sent to the kernel")
type template_univ =
| TemplateProp
| TemplateUniv of Universe.t
let max_template_universe u v = match u, v with
| TemplateProp, x | x, TemplateProp -> x
| TemplateUniv u, TemplateUniv v -> TemplateUniv (Universe.sup u v)
(* cons_subst add the mapping [u |-> su] in subst if [u] is not *)
(* in the domain or add [u |-> sup x su] if [u] is already mapped *)
(* to [x]. *)
let cons_subst u su subst =
try
Univ.Level.Map.add u (max_template_universe su (Univ.Level.Map.find u subst)) subst
with Not_found -> Univ.Level.Map.add u su subst
(* remember_subst updates the mapping [u |-> x] by [u |-> sup x u] *)
(* if it is presents and returns the substitution unchanged if not.*)
let remember_subst u subst =
try
let su = TemplateUniv (Universe.make u) in
Univ.Level.Map.add u (max_template_universe su (Univ.Level.Map.find u subst)) subst
with Not_found -> subst
type param_univs = (expected:Univ.Level.t -> template_univ) list
(* Bind expected levels of parameters to actual levels *)
(* Propagate the new levels in the signature *)
let make_subst =
let rec make subst = function
| LocalDef _ :: sign, exp, args ->
make subst (sign, exp, args)
| _d::sign, None::exp, args ->
let args = match args with _::args -> args | [] -> [] in
make subst (sign, exp, args)
| _d::sign, Some u::exp, a::args ->
(* We recover the level of the argument, but we don't change the *)
(* level in the corresponding type in the arity; this level in the *)
(* arity is a global level which, at typing time, will be enforce *)
(* to be greater than the level of the argument; this is probably *)
(* a useless extra constraint *)
let s = a ~expected:u in
make (cons_subst u s subst) (sign, exp, args)
| LocalAssum (_na,_t) :: sign, Some u::exp, [] ->
(* No more argument here: we add the remaining universes to the *)
(* substitution (when [u] is distinct from all other universes in the *)
(* template, it is identity substitution otherwise (ie. when u is *)
(* already in the domain of the substitution) [remember_subst] will *)
(* update its image [x] by [sup x u] in order not to forget the *)
(* dependency in [u] that remains to be fulfilled. *)
make (remember_subst u subst) (sign, exp, [])
| _sign, [], _ ->
(* Uniform parameters are exhausted *)
subst
| [], _, _ ->
assert false
in
make Univ.Level.Map.empty
exception SingletonInductiveBecomesProp of Id.t
let subst_univs_sort subs = function
| Sorts.QSort _ -> no_sort_variable ()
| Sorts.Prop | Sorts.Set | Sorts.SProp as s -> s
| Sorts.Type u ->
(* We implement by hand a max on universes that handles Prop *)
let u = Universe.repr u in
let supern u n = iterate Universe.super n u in
let map (u, n) =
if Level.is_set u then Some (Universe.type0, n)
else match Level.Map.find u subs with
| TemplateProp ->
if Int.equal n 0 then
(* This is an instantiation of a template universe by Prop, ignore it *)
None
else
(* Prop + S n actually means Set + S n *)
Some (Universe.type0, n)
| TemplateUniv v -> Some (v,n)
| exception Not_found ->
(* Either an unbound template universe due to missing arguments, or a
global one appearing in the inductive arity. *)
Some (Universe.make u, n)
in
let u = List.filter_map map u in
match u with
| [] ->
(* No constraints, fall in Prop *)
Sorts.prop
| (u,n) :: rest ->
let fold accu (u, n) = Universe.sup accu (supern u n) in
Sorts.sort_of_univ (List.fold_left fold (supern u n) rest)
let instantiate_universes ctx (templ, ar) args =
let subst = make_subst (ctx,templ.template_param_levels,args) in
let ty = subst_univs_sort subst ar.template_level in
(ctx, ty)
(* Type of an inductive type *)
let relevance_of_ind_body mip u =
UVars.subst_instance_relevance u mip.mind_relevance
let relevance_of_inductive env (ind,u) =
let _, mip = lookup_mind_specif env ind in
relevance_of_ind_body mip u
let check_instance mib u =
if not (match mib.mind_universes with
| Monomorphic -> Instance.is_empty u
| Polymorphic uctx -> Instance.length u = AbstractContext.size uctx)
then CErrors.anomaly Pp.(str "bad instance length on mutind.")
let type_of_inductive_gen ?(polyprop=true) ((mib,mip),u) paramtyps =
check_instance mib u;
match mip.mind_arity with
| RegularArity a -> subst_instance_constr u a.mind_user_arity
| TemplateArity ar ->
let templ = match mib.mind_template with
| None -> assert false
| Some t -> t
in
let ctx = List.rev mip.mind_arity_ctxt in
let ctx,s = instantiate_universes ctx (templ, ar) paramtyps in
(* The Ocaml extraction cannot handle (yet?) "Prop-polymorphism", i.e.
the situation where a non-Prop singleton inductive becomes Prop
when applied to Prop params *)
if not polyprop && not (Sorts.is_prop ar.template_level) && Sorts.is_prop s
then raise (SingletonInductiveBecomesProp mip.mind_typename);
Term.mkArity (List.rev ctx,s)
let type_of_inductive pind =
type_of_inductive_gen pind []
let constrained_type_of_inductive ((mib,_mip),u as pind) =
let ty = type_of_inductive pind in
let cst = instantiate_inductive_constraints mib u in
(ty, cst)
let constrained_type_of_inductive_knowing_parameters ((mib,_mip),u as pind) args =
let ty = type_of_inductive_gen pind args in
let cst = instantiate_inductive_constraints mib u in
(ty, cst)
let type_of_inductive_knowing_parameters ?(polyprop=true) mip args =
type_of_inductive_gen ~polyprop mip args
(************************************************************************)
(* Type of a constructor *)
let type_of_constructor (cstr, u) (mib,mip) =
check_instance mib u;
let i = index_of_constructor cstr in
let nconstr = Array.length mip.mind_consnames in
if i > nconstr then user_err Pp.(str "Not enough constructors in the type.");
subst_instance_constr u mip.mind_user_lc.(i-1)
let constrained_type_of_constructor (_cstr,u as cstru) (mib,_mip as ind) =
let ty = type_of_constructor cstru ind in
let cst = instantiate_inductive_constraints mib u in
(ty, cst)
let arities_of_constructors (_,u) (_,mip) =
let map (ctx, c) =
let cty = Term.it_mkProd_or_LetIn c ctx in
subst_instance_constr u cty
in
Array.map map mip.mind_nf_lc
let type_of_constructors (_,u) (_,mip) =
Array.map (subst_instance_constr u) mip.mind_user_lc
let abstract_constructor_type_relatively_to_inductive_types_context ntyps mind t =
let rec replace_ind k c =
let hd, args = decompose_app c in
match kind hd with
| Ind ((mind',i),_) when MutInd.CanOrd.equal mind mind' ->
mkApp (mkRel (ntyps+k-i), Array.map (replace_ind k) args)
| _ -> map_with_binders succ replace_ind k c
in
replace_ind 0 t
(************************************************************************)
(* Type of case predicates *)
(* Get type of inductive, with parameters instantiated *)
(* XXX questionable for sort poly inductives *)
let inductive_sort_family mip =
match mip.mind_arity with
| RegularArity s -> Sorts.family s.mind_sort
| TemplateArity _ -> Sorts.InType
let quality_leq q q' =
let open Sorts.Quality in
match q, q' with
| QVar q, QVar q' -> Sorts.QVar.equal q q'
| QConstant q, QConstant q' ->
begin match q, q' with
| QSProp, _
| _, QType
| QProp, QProp
-> true
| (QProp|QType), _ -> false
end
| (QVar _|QConstant _), _ -> false
type squash = SquashToSet | SquashToQuality of Sorts.Quality.t
let is_squashed ((_,mip),u) =
match mip.mind_arity with
| TemplateArity _ -> None (* template is never squashed *)
| RegularArity a ->
match mip.mind_squashed with
| None -> None
| Some squash ->
let indq = Sorts.quality (UVars.subst_instance_sort u a.mind_sort) in
match squash with
| AlwaysSquashed -> begin match a.mind_sort with
| Sorts.Set -> Some SquashToSet
| _ -> Some (SquashToQuality indq)
end
| SometimesSquashed squash ->
(* impredicative set squashes are always AlwaysSquashed,
so here if inds=Set it is a sort poly squash (see "foo6" in test sort_poly.v) *)
if Sorts.Quality.Set.for_all (fun q ->
let q = UVars.subst_instance_quality u q in
quality_leq q indq)
squash
then None
else Some (SquashToQuality indq)
let is_allowed_elimination specifu s =
let open Sorts in
match is_squashed specifu with
| None -> true
| Some SquashToSet ->
begin match s with
| SProp|Prop|Set -> true
| QSort _ | Type _ ->
(* XXX in [Type u] case, should we check [u == set] in the ugraph? *)
false
end
| Some (SquashToQuality indq) -> quality_leq (Sorts.quality s) indq
let is_private (mib,_) = mib.mind_private = Some true
let is_primitive_record (mib,_) =
match mib.mind_record with
| PrimRecord _ -> true
| NotRecord | FakeRecord -> false
(** {6 Changes of representation of Case nodes} *)
(** Provided:
- a universe instance [u]
- a term substitution [subst]
- name replacements [nas]
[instantiate_context u subst nas ctx] applies both [u] and [subst] to [ctx]
while replacing names using [nas] (order reversed)
*)
let instantiate_context u subst nas ctx =
let rec instantiate i ctx = match ctx with
| [] -> assert (Int.equal i (-1)); []
| LocalAssum (na, ty) :: ctx ->
let ctx = instantiate (pred i) ctx in
let ty = substnl subst i (subst_instance_constr u ty) in
let na = Context.map_annot (fun _ -> Context.binder_name nas.(i)) na in
LocalAssum (na, ty) :: ctx
| LocalDef (na, ty, bdy) :: ctx ->
let ctx = instantiate (pred i) ctx in
let ty = substnl subst i (subst_instance_constr u ty) in
let bdy = substnl subst i (subst_instance_constr u bdy) in
let na = Context.map_annot (fun _ -> Context.binder_name nas.(i)) na in
LocalDef (na, ty, bdy) :: ctx
in
instantiate (Array.length nas - 1) ctx
let expand_arity (mib, mip) (ind, u) params nas =
let paramdecl = Vars.subst_instance_context u mib.mind_params_ctxt in
let params = Vars.subst_of_rel_context_instance paramdecl params in
let realdecls, _ = List.chop mip.mind_nrealdecls mip.mind_arity_ctxt in
let self =
let u = Instance.abstract_instance (Instance.length u) in
let args = Context.Rel.instance mkRel 0 mip.mind_arity_ctxt in
mkApp (mkIndU (ind, u), args)
in
let na = Context.make_annot Anonymous (relevance_of_ind_body mip u) in
let realdecls = LocalAssum (na, self) :: realdecls in
instantiate_context u params nas realdecls
type ('constr,'types) pexpanded_case =
(case_info * ('constr * Sorts.relevance) * 'constr pcase_invert * 'constr * 'constr array)
type expanded_case = (constr,types) pexpanded_case
let expand_case_specif mib (ci, u, params, (p,rp), iv, c, br) =
(* Γ ⊢ c : I@{u} params args *)
(* Γ, indices, self : I@{u} params indices ⊢ p : Type *)
let mip = mib.mind_packets.(snd ci.ci_ind) in
let paramdecl = Vars.subst_instance_context u mib.mind_params_ctxt in
let paramsubst = Vars.subst_of_rel_context_instance paramdecl params in
(* Expand the return clause *)
let ep =
let (nas, p) = p in
let realdecls = expand_arity (mib, mip) (ci.ci_ind, u) params nas in
Term.it_mkLambda_or_LetIn p realdecls
in
(* Expand the branches *)
let ebr =
let build_one_branch i (nas, br) (ctx, _) =
let ctx, _ = List.chop mip.mind_consnrealdecls.(i) ctx in
let ctx = instantiate_context u paramsubst nas ctx in
Term.it_mkLambda_or_LetIn br ctx
in
Array.map2_i build_one_branch br mip.mind_nf_lc
in
(ci, (ep,rp), iv, c, ebr)
let expand_case env (ci, _, _, _, _, _, _ as case) =
let specif = Environ.lookup_mind (fst ci.ci_ind) env in
expand_case_specif specif case
let contract_case env (ci, (p,rp), iv, c, br) =
let (mib, mip) = lookup_mind_specif env ci.ci_ind in
let (arity, p) = Term.decompose_lambda_n_decls (mip.mind_nrealdecls + 1) p in
let (u, pms) = match arity with
| LocalAssum (_, ty) :: _ ->
(** Last binder is the self binder for the term being eliminated *)
let (ind, args) = decompose_app ty in
let (ind, u) = destInd ind in
let () = assert (QInd.equal env ind ci.ci_ind) in
let pms = Array.sub args 0 mib.mind_nparams in
(** Unlift the parameters from under the index binders *)
let dummy = List.make mip.mind_nrealdecls mkProp in
let pms = Array.map (fun c -> Vars.substl dummy c) pms in
(u, pms)
| _ -> assert false
in
let p =
let nas = Array.of_list (List.rev_map get_annot arity) in
((nas, p),rp)
in
let map i br =
let (ctx, br) = Term.decompose_lambda_n_decls mip.mind_consnrealdecls.(i) br in
let nas = Array.of_list (List.rev_map get_annot ctx) in
(nas, br)
in
(ci, u, pms, p, iv, c, Array.mapi map br)
(************************************************************************)
(* Type of case branches *)
(* [p] is the predicate, [i] is the constructor number (starting from 0),
and [cty] is the type of the constructor (params not instantiated) *)
let build_branches_type (ind,u) (_,mip as specif) params p =
let build_one_branch i (ctx, c) =
let cty = Term.it_mkProd_or_LetIn c ctx in
let typi = full_constructor_instantiate (ind,u,specif,params) cty in
let (cstrsign,ccl) = Term.decompose_prod_decls typi in
let nargs = Context.Rel.length cstrsign in
let (_,allargs) = decompose_app_list ccl in
let (lparams,vargs) = List.chop (inductive_params specif) allargs in
let cargs =
let cstr = ith_constructor_of_inductive ind (i+1) in
let dep_cstr = Term.applist (mkConstructU (cstr,u),lparams@(Context.Rel.instance_list mkRel 0 cstrsign)) in
vargs @ [dep_cstr] in
let base = Term.lambda_appvect_decls (mip.mind_nrealdecls+1) (lift nargs p) (Array.of_list cargs) in
Term.it_mkProd_or_LetIn base cstrsign in
Array.mapi build_one_branch mip.mind_nf_lc
(************************************************************************)
(* Checking the case annotation is relevant *)
let check_case_info env (indsp,u) ci =
let (mib,mip as spec) = lookup_mind_specif env indsp in
if
not (QInd.equal env indsp ci.ci_ind) ||
not (Int.equal mib.mind_nparams ci.ci_npar) ||
not (Array.equal Int.equal mip.mind_consnrealdecls ci.ci_cstr_ndecls) ||
not (Array.equal Int.equal mip.mind_consnrealargs ci.ci_cstr_nargs) ||
is_primitive_record spec
then raise (TypeError(env,WrongCaseInfo((indsp,u),ci)))
(************************************************************************)
(************************************************************************)
let apply_branch ((_, i), _u) args ci lf =
let args = List.skipn ci.ci_npar args in
let br = lf.(i - 1) in
let ctx, br = Term.decompose_lambda_n_decls ci.ci_cstr_ndecls.(i - 1) br in
let subst = subst_of_rel_context_instance_list ctx args in
Vars.substl subst br
let contract_fix ((recindices,bodynum),(_,_,bodies as typedbodies)) =
let nbodies = Array.length bodies in
let make_Fi j =
let ind = nbodies-j-1 in
mkFix ((recindices,ind),typedbodies)
in
let closure = List.init nbodies make_Fi in
substl closure bodies.(bodynum)
let contract_cofix (bodynum,(_,_,bodies as typedbodies)) =
let nbodies = Array.length bodies in
let make_Fi j =
let coind = nbodies-j-1 in
mkCoFix (coind,typedbodies)
in
let closure = List.init nbodies make_Fi in
substl closure bodies.(bodynum)
(************************************************************************)
(************************************************************************)
(* Guard conditions for fix and cofix-points *)
(* Check if t is a subterm of Rel n, and gives its specification,
assuming lst already gives index of
subterms with corresponding specifications of recursive arguments *)
(* A powerful notion of subterm *)
(* To each inductive definition corresponds an array describing the
structure of recursive arguments for each constructor, we call it
the recursive spec of the type (it has type recargs vect). For
checking the guard, we start from the decreasing argument (Rel n)
with its recursive spec. During checking the guardness condition,
we collect patterns variables corresponding to subterms of n, each
of them with its recursive spec. They are organised in a list lst
of type (int * recargs) list which is sorted with respect to the
first argument.
*)
(*************************************************************)
(* Environment annotated with marks on recursive arguments *)
(* tells whether it is a strict or loose subterm *)
type size = Large | Strict
(* merging information *)
let size_glb s1 s2 =
match s1,s2 with
Strict, Strict -> Strict
| _ -> Large
(* possible specifications for a term:
- Not_subterm: when the size of a term is not related to the
recursive argument of the fixpoint
- Internally_bound_subterm: when the recursive call is in a subterm
of a redex and the recursive argument is bound to a variable
which will be instantiated by reducing the redex; the integers
refer to the number of redexes stacked, with 1 counting for the
variables bound at head in the body of the fix (as e.g. [x] in
[fix f n := fun x => f x]); there may be several such indices
because [match] subterms may have combine several results;
- Subterm: when the term is a subterm of the recursive argument
the wf_paths argument specifies which subterms are recursive;
the [int list] is used in the [match] case where one branch of
the [match] might be a subterm but (an arbitrary number of)
others are calls to bound variables
- Dead_code: when the term has been built by elimination over an
empty type
*)
type subterm_spec =
Subterm of (Int.Set.t * size * wf_paths)
| Dead_code
| Not_subterm
| Internally_bound_subterm of Int.Set.t
let eq_wf_paths = Rtree.equal Declareops.eq_recarg
let inter_recarg r1 r2 = match r1, r2 with
| Norec, Norec -> Some r1
| Norec, _ -> None
| Mrec i1, Mrec i2
| Nested (NestedInd i1), Nested (NestedInd i2)
| Mrec i1, (Nested (NestedInd i2)) -> if Names.Ind.CanOrd.equal i1 i2 then Some r1 else None
| Mrec _, _ -> None
| Nested (NestedInd i1), Mrec i2 -> if Names.Ind.CanOrd.equal i1 i2 then Some r2 else None
| Nested (NestedInd _), _ -> None
| Nested (NestedPrimitive c1), Nested (NestedPrimitive c2) ->
if Names.Constant.CanOrd.equal c1 c2 then Some r1 else None
| Nested (NestedPrimitive _), _ -> None
let inter_wf_paths = Rtree.inter Declareops.eq_recarg inter_recarg Norec
let incl_wf_paths = Rtree.incl Declareops.eq_recarg inter_recarg Norec
let spec_of_tree t =
if eq_wf_paths t mk_norec
then Not_subterm
else Subterm (Int.Set.empty, Strict, t)
let merge_internal_subterms l1 l2 =
Int.Set.union l1 l2
let inter_spec s1 s2 =
match s1, s2 with
| _, Dead_code -> s1
| Dead_code, _ -> s2
| Not_subterm, _ -> s1
| _, Not_subterm -> s2
| Internally_bound_subterm l1, Internally_bound_subterm l2 -> Internally_bound_subterm (merge_internal_subterms l1 l2)
| Subterm (l1,a1,t1), Internally_bound_subterm l2 -> Subterm (merge_internal_subterms l1 l2,a1,t1)
| Internally_bound_subterm l1, Subterm (l2,a2,t2) -> Subterm (merge_internal_subterms l1 l2,a2,t2)
| Subterm (l1,a1,t1), Subterm (l2,a2,t2) ->
Subterm (merge_internal_subterms l1 l2, size_glb a1 a2, inter_wf_paths t1 t2)
let subterm_spec_glb =
Array.fold_left inter_spec Dead_code
type guard_env =
{ env : env;
(* dB of last fixpoint *)
rel_min : int;
(* dB of variables denoting subterms *)
genv : subterm_spec Lazy.t list;
}
let make_renv env recarg tree =
{ env = env;
rel_min = recarg+2; (* recarg = 0 ==> Rel 1 -> recarg; Rel 2 -> fix *)
genv = [Lazy.from_val(Subterm(Int.Set.empty, Large,tree))] }
let push_var renv (x,ty,spec) =
{ env = push_rel (LocalAssum (x,ty)) renv.env;
rel_min = renv.rel_min+1;
genv = spec:: renv.genv }
let push_let renv (x,c,ty,spec) =
{ env = push_rel (LocalDef (x,c,ty)) renv.env;
rel_min = renv.rel_min+1;
genv = spec:: renv.genv }
let assign_var_spec renv (i,spec) =
{ renv with genv = List.assign renv.genv (i-1) spec }
let push_var_renv renv n (x,ty) =
let spec = Lazy.from_val (if n >= 1 then Internally_bound_subterm (Int.Set.singleton n) else Not_subterm) in
push_var renv (x,ty,spec)
(* Fetch recursive information about a variable p *)
let subterm_var p renv =
try Lazy.force (List.nth renv.genv (p-1))
with Failure _ | Invalid_argument _ -> (* outside context of the fixpoint *) Not_subterm
let push_ctxt_renv renv ctxt =
let n = Context.Rel.length ctxt in
{ env = push_rel_context ctxt renv.env;
rel_min = renv.rel_min+n;
genv = iterate (fun ge -> lazy Not_subterm::ge) n renv.genv }
let push_fix_renv renv (_,v,_ as recdef) =
let n = Array.length v in
{ env = push_rec_types recdef renv.env;
rel_min = renv.rel_min+n;
genv = iterate (fun ge -> lazy Not_subterm::ge) n renv.genv }
type fix_check_result =
| NeedReduce of env * fix_guard_error
| NoNeedReduce
(* Definition and manipulation of the stack *)
type stack_element =
(* arguments in the evaluation stack *)
(* [constr] is typed in [guard_env] and [int] is the number of
binders added in the current env on top of [guard_env.env] *)
| SClosure of fix_check_result * guard_env * int * constr
(* arguments applied to a "match": only their spec traverse the match *)
| SArg of subterm_spec Lazy.t
let needreduce_of_stack = function
| [] | SArg _ :: _ -> NoNeedReduce
| SClosure (needreduce,_,_,_) :: _ -> needreduce
let (|||) x y = match x with
| NeedReduce _ -> x
| NoNeedReduce -> y
let redex_level rs = List.length rs
let push_stack_closure renv needreduce c stack =
(* In (f a b), if b requires reduction, than a has to require too *)
let needreduce' = needreduce ||| needreduce_of_stack stack in
(SClosure (needreduce', renv, 0, c)) :: stack
let push_stack_closures renv l stack =
List.fold_right (push_stack_closure renv NoNeedReduce) l stack
let push_stack_args l stack =
List.fold_right (fun spec stack -> SArg spec :: stack) l stack
let lift_stack =
List.map (function
| SClosure (needreduce,s,n,c) -> SClosure (needreduce,s,n+1,c)
| x -> x)
(******************************)
(* {6 Computing the recursive subterms of a term (propagation of size
information through Cases).} *)
let lookup_subterms env ind =
let (_,mip) = lookup_mind_specif env ind in
mip.mind_recargs
let match_inductive ind ra =
match ra with
| Mrec i | Nested (NestedInd i) -> Ind.CanOrd.equal ind i
| Norec | Nested (NestedPrimitive _) -> false
(* In {match c as z in ci y_s return P with | C_i x_s => t end}
[branches_specif renv c_spec ci] returns an array of x_s specs knowing
c_spec. *)
let branches_specif renv c_spec ci =
let car =
(* We fetch the regular tree associated to the inductive of the match.
This is just to get the number of constructors (and constructor
arities) that fit the match branches without forcing c_spec.
Note that c_spec might be more precise than [v] below, because of
nested inductive types. *)
let (_,mip) = lookup_mind_specif renv.env ci.ci_ind in
let v = dest_subterms mip.mind_recargs in
Array.map List.length v in
Array.mapi
(fun i nca -> (* i+1-th cstructor has arity nca *)
let lvra = lazy
(match Lazy.force c_spec with
Subterm (_,_,t) when match_inductive ci.ci_ind (dest_recarg t) ->
let vra = Array.of_list (dest_subterms t).(i) in
assert (Int.equal nca (Array.length vra));
Array.map spec_of_tree vra
| Dead_code -> Array.make nca Dead_code
| Internally_bound_subterm _ as x -> Array.make nca x
| Subterm _ | Not_subterm -> Array.make nca Not_subterm) in
List.init nca (fun j -> lazy (Lazy.force lvra).(j)))
car
let check_inductive_codomain env p =
let absctx, ar = whd_decompose_lambda_decls env p in
let env = push_rel_context absctx env in
let arctx, s = whd_decompose_prod_decls env ar in
let env = push_rel_context arctx env in
let i,_l' = decompose_app (whd_all env s) in
isInd i
(* The following functions are almost duplicated from indtypes.ml, except
that they carry here a poorer environment (containing less information). *)
let ienv_push_var (env, lra) (x,a,ra) =
(push_rel (LocalAssum (x,a)) env, (Norec,ra)::lra)
let ienv_push_inductive (env, ra_env) ((mind,u),lpar) =
let mib = Environ.lookup_mind mind env in
let ntypes = mib.mind_ntypes in
let push_ind mip env =
let r = relevance_of_ind_body mip u in
let anon = Context.make_annot Anonymous r in
let decl = LocalAssum (anon, hnf_prod_applist env (type_of_inductive ((mib,mip),u)) lpar) in
push_rel decl env
in
let env = Array.fold_right push_ind mib.mind_packets env in
let rc = Array.mapi (fun j t -> (Nested (NestedInd (mind,j)),t)) (Rtree.mk_rec_calls ntypes) in
let lra_ind = Array.rev_to_list rc in
let ra_env = List.map (fun (r,t) -> (r,Rtree.lift ntypes t)) ra_env in
(env, lra_ind @ ra_env)
let rec ienv_decompose_prod (env,_ as ienv) n c =
if Int.equal n 0 then (ienv,c) else
let c' = whd_all env c in
match kind c' with
Prod(na,a,b) ->
let ienv' = ienv_push_var ienv (na,a,mk_norec) in
ienv_decompose_prod ienv' (n-1) b
| _ -> assert false
(* This removes global parameters of the inductive types in lc (for
nested inductive types only ) *)
let dummy_univ = Level.(make (UGlobal.make (DirPath.make [Id.of_string "implicit"]) "" 0))
let dummy_implicit_sort = mkType (Universe.make dummy_univ)
let lambda_implicit n a =
let anon = Context.make_annot Anonymous Sorts.Relevant in
let lambda_implicit a = mkLambda (anon, dummy_implicit_sort, a) in
iterate lambda_implicit n a
let abstract_mind_lc ntyps npars mind lc =
let lc = Array.map (fun (ctx, c) -> Term.it_mkProd_or_LetIn c ctx) lc in
let rec replace_ind k c =
let hd, args = decompose_app_list c in
match kind hd with
| Ind ((mind',i),_) when MutInd.CanOrd.equal mind mind' ->
let rec drop_params n = function
| _ :: args when n > 0 -> drop_params (n-1) args
| args -> lambda_implicit n (Term.applist (mkRel (ntyps+n+k-i), List.Smart.map (replace_ind (n+k)) args))
in
drop_params npars args
| _ -> map_with_binders succ replace_ind k c
in
Array.map (replace_ind 0) lc
let is_primitive_positive_container env c =
match env.retroknowledge.Retroknowledge.retro_array with
| Some c' when QConstant.equal env c c' -> true
| _ -> false
(* [get_recargs_approx env tree ind args] builds an approximation of the recargs
tree for ind, knowing args. The argument tree is used to know when candidate
nested types should be traversed, pruning the tree otherwise. This code is very
close to check_positive in indtypes.ml, but does no positivity check and does not
compute the number of recursive arguments. *)
let get_recargs_approx env tree ind args =
let rec build_recargs (env, ra_env as ienv) tree c =
let x,largs = decompose_app_list (whd_all env c) in
match kind x with
| Prod (na,b,d) ->
assert (List.is_empty largs);
build_recargs (ienv_push_var ienv (na, b, mk_norec)) tree d
| Rel k ->
(* Free variables are allowed and assigned Norec *)
(try snd (List.nth ra_env (k-1))
with Failure _ | Invalid_argument _ -> mk_norec)
| Ind ind_kn ->
(* When the inferred tree allows it, we consider that we have a potential
nested inductive type *)
begin match dest_recarg tree with
| Nested (NestedInd kn') | Mrec kn' when QInd.equal env (fst ind_kn) kn' ->
build_recargs_nested ienv tree (ind_kn, largs)
| _ -> mk_norec
end
| Const (c,_) when is_primitive_positive_container env c ->
begin match dest_recarg tree with
| Nested (NestedPrimitive c') when QConstant.equal env c c' ->
build_recargs_nested_primitive ienv tree (c, largs)
| _ -> mk_norec
end
| _err ->
mk_norec
and build_recargs_nested (env,_ra_env as ienv) tree (((mind,i),u), largs) =
(* If the inferred tree already disallows recursion, no need to go further *)
if eq_wf_paths tree mk_norec then tree
else
let mib = Environ.lookup_mind mind env in
let auxnpar = mib.mind_nparams_rec in
let nonrecpar = mib.mind_nparams - auxnpar in
let (lpar,_) = List.chop auxnpar largs in
let auxntyp = mib.mind_ntypes in
(* Extends the environment with a variable corresponding to
the inductive def *)
let (env',_ as ienv') = ienv_push_inductive ienv ((mind,u),lpar) in
(* Parameters expressed in env' *)
let lpar' = List.map (lift auxntyp) lpar in
(* In case of mutual inductive types, we use the recargs tree which was
computed statically. This is fine because nested inductive types with
mutually recursive containers are not supported. *)
let trees =
if Int.equal auxntyp 1 then [|dest_subterms tree|]
else Array.map (fun mip -> dest_subterms mip.mind_recargs) mib.mind_packets
in
let mk_irecargs j mip =
(* The nested inductive type with parameters removed *)
let auxlcvect = abstract_mind_lc auxntyp auxnpar mind mip.mind_nf_lc in
let paths = Array.mapi
(fun k c ->
let c' = hnf_prod_applist env' c lpar' in
(* skip non-recursive parameters *)
let (ienv',c') = ienv_decompose_prod ienv' nonrecpar c' in
build_recargs_constructors ienv' trees.(j).(k) c')
auxlcvect
in
mk_paths (Nested (NestedInd (mind,j))) paths
in
let irecargs = Array.mapi mk_irecargs mib.mind_packets in
(Rtree.mk_rec irecargs).(i)
and build_recargs_nested_primitive (env, ra_env) tree (c, largs) =
if eq_wf_paths tree mk_norec then tree
else
let ntypes = 1 in (* Primitive types are modelled by non-mutual inductive types *)
let ra_env = List.map (fun (r,t) -> (r,Rtree.lift ntypes t)) ra_env in
let ienv = (env, ra_env) in
let paths = List.map2 (build_recargs ienv) (dest_subterms tree).(0) largs in
let recargs = [| mk_paths (Nested (NestedPrimitive c)) [| paths |] |] in
(Rtree.mk_rec recargs).(0)
and build_recargs_constructors ienv trees c =
let rec recargs_constr_rec (env,_ra_env as ienv) trees lrec c =
let x,largs = decompose_app_list (whd_all env c) in
match kind x with
| Prod (na,b,d) ->
let () = assert (List.is_empty largs) in
let recarg = build_recargs ienv (List.hd trees) b in
let ienv' = ienv_push_var ienv (na,b,mk_norec) in
recargs_constr_rec ienv' (List.tl trees) (recarg::lrec) d
| _hd ->
List.rev lrec
in
recargs_constr_rec ienv trees [] c
in
(* starting with ra_env = [] seems safe because any unbounded Rel will be
assigned Norec *)
build_recargs_nested (env,[]) tree (ind, args)
(* [restrict_spec env spec p] restricts the size information in spec to what is
allowed to flow through a match with predicate p in environment env. *)
let restrict_spec env spec p =
match spec with
| Not_subterm | Internally_bound_subterm _ -> spec
| _ ->
let absctx, ar = whd_decompose_lambda_decls env p in
(* Optimization: if the predicate is not dependent, no restriction is needed
and we avoid building the recargs tree. *)
if noccur_with_meta 1 (Context.Rel.length absctx) ar then spec
else
let env = push_rel_context absctx env in
let arctx, s = whd_decompose_prod_decls env ar in
let env = push_rel_context arctx env in
let i,args = decompose_app_list (whd_all env s) in
match kind i with
| Ind i ->
begin match spec with
| Dead_code -> spec
| Subterm(l,st,tree) ->
let recargs = get_recargs_approx env tree i args in
let recargs = inter_wf_paths tree recargs in
Subterm(l,st,recargs)
| _ -> assert false
end
| _ -> Not_subterm
(* [subterm_specif renv t] computes the recursive structure of [t] and
compare its size with the size of the initial recursive argument of
the fixpoint we are checking. [renv] collects such information
about variables.
*)
let rec subterm_specif renv stack t =
(* maybe reduction is not always necessary! *)
let f,l = decompose_app_list (whd_all renv.env t) in
match kind f with
| Rel k -> subterm_var k renv
| Case (ci, u, pms, p, iv, c, lbr) -> (* iv ignored: it's just a cache *)
let (ci, (p,_), _iv, c, lbr) = expand_case renv.env (ci, u, pms, p, iv, c, lbr) in
let stack' = push_stack_closures renv l stack in
let cases_spec =
branches_specif renv (lazy_subterm_specif renv [] c) ci
in
let stl =
Array.mapi (fun i br' ->
let stack_br = push_stack_args (cases_spec.(i)) stack' in
subterm_specif renv stack_br br')
lbr in
let spec = subterm_spec_glb stl in
restrict_spec renv.env spec p
| Fix ((recindxs,i),(_,typarray,bodies as recdef)) ->
(* when proving that the fixpoint f(x)=e is less than n, it is enough
to prove that e is less than n assuming f is less than n
furthermore when f is applied to a term which is strictly less than
n, one may assume that x itself is strictly less than n
*)
if not (check_inductive_codomain renv.env typarray.(i)) then Not_subterm
else
let (ctxt,clfix) = whd_decompose_prod renv.env typarray.(i) in
let oind =
let env' = push_rel_context ctxt renv.env in
try Some(fst(find_inductive env' clfix))
with Not_found -> None in
(match oind with
None -> Not_subterm (* happens if fix is polymorphic *)
| Some (ind, _) ->
let nbfix = Array.length typarray in
let recargs = lookup_subterms renv.env ind in
(* pushing the fixpoints *)
let renv' = push_fix_renv renv recdef in
let renv' =
(* Why Strict here ? To be general, it could also be
Large... *)
assign_var_spec renv'
(nbfix-i, lazy (Subterm(Int.Set.empty,Strict,recargs))) in