blob: 4c18460396aaf10e2f0ab274fb864e1cb0450fb3 (
plain)
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
|
(* $Id$ *)
(*i*)
open Pp
open Names
(* open Generic *)
open Term
open Evd
open Environ
(*i*)
(* Flags for profiling reductions. *)
val stats : bool ref
val share : bool ref
(*s Delta implies all consts (both global (= by
[section_path]) and local (= by [Rel] or [Var])), all evars, and letin's.
Rem: reduction of a Rel/Var bound to a term is Delta, but reduction of
a LetIn expression is Letin reduction *)
type red_kind =
| BETA
| DELTA
| LETIN
| EVAR
| IOTA
| CONST of section_path list
| CONSTBUT of section_path list
(* Sets of reduction kinds. *)
type reds
val no_red : reds
val beta_red : reds
val betaiota_red : reds
val betadeltaiota_red : reds
val unfold_red : section_path -> reds
(* Tests if a reduction kind is set *)
val red_set : reds -> red_kind -> bool
(* Adds a reduction kind to a set *)
val red_add : reds -> red_kind -> reds
(*s Reduction function specification. *)
type red_mode = UNIFORM | SIMPL | WITHBACK
type flags = red_mode * reds
(* [(UNIFORM,r)] == [r]-reduce in any context.
[(SIMPL,r)] == bdi-reduce under cases or fix, [r] otherwise
(like hnf does).
[(WITHBACK,r)] == internal use: means we are under a case
or in rec. arg. of fix. *)
val flags_under : flags -> flags
val red_top : flags -> red_kind -> bool
val red_under : flags -> red_kind -> bool
val no_flag : flags
val beta : flags
val betaiota : flags
val betadeltaiota : flags
val hnf_flags : flags
val unfold_flags : section_path -> flags
(*s Explicit substitutions of type ['a]. [ESID n] = %n~END = bounded identity.
[CONS(t,S)] = $S.t$ i.e. parallel substitution. [SHIFT(n,S)] =
$(\uparrow n~o~S)$ i.e. terms in S are relocated with n vars.
[LIFT(n,S)] = $(\%n~S)$ stands for $((\uparrow n~o~S).n...1)$. *)
type 'a subs =
| ESID of int
| CONS of 'a * 'a subs
| SHIFT of int * 'a subs
| LIFT of int * 'a subs
(*s Call by value functions *)
type cbv_value =
| VAL of int * constr
| LAM of name * constr * constr * cbv_value subs
| FIXP of fixpoint * cbv_value subs * cbv_value list
| COFIXP of cofixpoint * cbv_value subs * cbv_value list
| CONSTR of int * (section_path * int) * cbv_value array * cbv_value list
val shift_value : int -> cbv_value -> cbv_value
(*i Private ??
val contract_fixp : cbv_value subs -> fixpoint -> cbv_value subs * constr
i*)
type stack =
| TOP
| APP of cbv_value list * stack
| CASE of constr * constr array * case_info * cbv_value subs * stack
val stack_app : cbv_value list -> stack -> stack
val under_case_stack : stack -> bool
val strip_appl : cbv_value -> stack -> cbv_value * stack
val red_allowed : flags -> stack -> red_kind -> bool
val reduce_const_body :
(cbv_value -> cbv_value) -> cbv_value -> stack -> cbv_value * stack
(*i Private ??
val fixp_reducible :
(cbv_value -> cbv_value) -> flags -> fixpoint -> stack -> bool
i*)
(* normalization of a constr: the two functions to know... *)
type 'a cbv_infos
val create_cbv_infos : flags -> env -> 'a evar_map -> 'a cbv_infos
val cbv_norm : 'a cbv_infos -> constr -> constr
(* recursive functions... *)
val cbv_stack_term : 'a cbv_infos ->
stack -> cbv_value subs -> constr -> cbv_value
val cbv_norm_term : 'a cbv_infos -> cbv_value subs -> constr -> constr
val cbv_norm_more : 'a cbv_infos -> cbv_value subs -> cbv_value -> cbv_value
val norm_head : 'a cbv_infos ->
cbv_value subs -> constr -> stack -> cbv_value * stack
val apply_stack : 'a cbv_infos -> constr -> stack -> constr
val cbv_norm_value : 'a cbv_infos -> cbv_value -> constr
(*s Lazy reduction. *)
type freeze = {
mutable norm: bool;
mutable term: frterm }
and frterm =
| FRel of int
| FAtom of constr
| FCast of freeze * freeze
| FFlex of frreference * freeze array
| FInd of inductive_path * freeze array
| FConstruct of constructor_path * freeze array
| FApp of freeze * freeze array
| FFix of (int array * int) * (freeze array * name list * freeze array)
* constr array * freeze subs
| FCoFix of int * (freeze array * name list * freeze array)
* constr array * freeze subs
| FCases of case_info * freeze * freeze * freeze array
| FLambda of name * freeze * freeze * constr * freeze subs
| FProd of name * freeze * freeze * constr * freeze subs
| FLetIn of name * freeze * freeze * freeze * constr * freeze subs
| FLIFT of int * freeze
| FFROZEN of constr * freeze subs
and frreference =
| FConst of section_path
| FEvar of existential_key
| FVar of identifier
| FFarRel of int * int
val frterm_of : freeze -> frterm
val is_val : freeze -> bool
val lift_frterm : int -> freeze -> freeze
val lift_freeze : int -> freeze -> freeze
val freeze : freeze subs -> constr -> freeze
val freeze_vect : freeze subs -> constr array -> freeze array
val freeze_list : freeze subs -> constr list -> freeze list
val traverse_term : freeze subs -> constr -> freeze
val lift_term_of_freeze : lift_spec -> freeze -> constr
(* Back to constr *)
val fstrong : (freeze -> freeze) -> lift_spec -> freeze -> constr
val term_of_freeze : freeze -> constr
val applist_of_freeze : freeze array -> constr list
(* contract a substitution *)
val contract_subst : int -> constr -> freeze subs -> freeze -> freeze
(* Global and local constant cache *)
type 'a clos_infos
val create_clos_infos : flags -> env -> 'a evar_map -> 'a clos_infos
val clos_infos_env : 'a clos_infos -> env
(* Calculus of Constructions *)
type fconstr = freeze
val inject : constr -> fconstr
val strip_frterm :
int -> fconstr -> fconstr array list -> int * fconstr * fconstr array
val strip_freeze : fconstr -> int * fconstr * fconstr array
(* Auxiliary functions for (co)fixpoint reduction *)
val contract_fix_vect : frterm -> fconstr
val copy_case : case_info -> fconstr -> fconstr -> fconstr array -> fconstr
(* Iota analysis: reducible ? *)
type case_status =
| CONSTRUCTOR of int * fconstr array
| COFIX of int * int * (fconstr array * name list * fconstr array) *
fconstr array * constr array * freeze subs
| IRREDUCTIBLE
(* Reduction function *)
val norm_val : 'a clos_infos -> fconstr -> constr
val whd_val : 'a clos_infos -> fconstr -> constr
val fhnf: 'a clos_infos -> fconstr -> int * fconstr * fconstr array
val fhnf_apply : 'a clos_infos ->
int -> fconstr -> fconstr array -> int * fconstr * fconstr array
val search_frozen_value :
'a clos_infos -> frreference -> fconstr array -> fconstr option
(* recursive functions... *)
val unfreeze : 'a clos_infos -> fconstr -> fconstr
val whnf_frterm : 'a clos_infos -> fconstr -> fconstr
val whnf_term : 'a clos_infos -> fconstr subs -> constr -> fconstr
val whnf_apply : 'a clos_infos -> fconstr -> fconstr array -> fconstr
|
