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
|
(*i $Id$ i*)
(*i*)
open Pp
open Names
open Term
open Evd
open Environ
open Esubst
(*i*)
(* Flags for profiling reductions. *)
val stats : bool ref
val share : bool ref
val with_stats: 'a Lazy.t -> 'a
type evaluable_global_reference =
| EvalVarRef of identifier
| EvalConstRef of section_path
(*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
| ZETA
| EVAR
| IOTA
| CONST of section_path list
| CONSTBUT of section_path list
| VAR of identifier
| VARBUT of identifier
(* 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 : evaluable_global_reference -> 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
(* Gives the constant list *)
val red_get_const : reds -> bool * (evaluable_global_reference list)
(*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 : evaluable_global_reference -> flags
(***********************************************************************)
type 'a table_key =
| ConstBinding of constant
| EvarBinding of (existential * 'a subs)
| VarBinding of identifier
| FarRelBinding of int
type ('a,'b) infos
val ref_value_cache: ('a,'b) infos -> 'a table_key -> 'a option
val info_flags: ('a,'b) infos -> flags
val infos_under: ('a,'b) infos -> ('a,'b) infos
val create:
(('a,'b) infos -> 'a subs -> constr -> 'a) ->
flags -> env -> 'b evar_map -> ('a,'b) infos
(***********************************************************************)
(*s A [stack] is a context of arguments, arguments are pushed by
[append_stack] one array at a time but popped with [decomp_stack]
one by one *)
type 'a stack
val empty_stack : 'a stack
val append_stack : 'a array -> 'a stack -> 'a stack
val decomp_stack : 'a stack -> ('a * 'a stack) option
val list_of_stack : 'a stack -> 'a list
val array_of_stack : 'a stack -> 'a array
val stack_assign : 'a stack -> int -> 'a -> 'a stack
val stack_args_size : 'a stack -> int
val app_stack : constr * constr stack -> constr
val stack_tail : int -> 'a stack -> 'a stack
val stack_nth : 'a stack -> int -> 'a
(***********************************************************************)
(*s Lazy reduction. *)
(* [fconstr] is the type of frozen constr *)
type fconstr
(* [fconstr] can be accessed by using the function [fterm_of] and by
matching on type [fterm] *)
type fterm =
| FRel of int
| FAtom of constr
| FCast of fconstr * fconstr
| FFlex of freference
| FInd of inductive_path * fconstr array
| FConstruct of constructor_path * fconstr array
| FApp of fconstr * fconstr array
| FFix of (int array * int) * (fconstr array * name list * fconstr array)
* constr array * fconstr subs
| FCoFix of int * (fconstr array * name list * fconstr array)
* constr array * fconstr subs
| FCases of case_info * fconstr * fconstr * fconstr array
| FLambda of name * fconstr * fconstr * constr * fconstr subs
| FProd of name * fconstr * fconstr * constr * fconstr subs
| FLetIn of name * fconstr * fconstr * fconstr * constr * fconstr subs
| FLIFT of int * fconstr
| FCLOS of constr * fconstr subs
and freference =
| FConst of section_path * fconstr array
| FEvar of (existential * fconstr subs)
| FVar of identifier
| FFarRel of int
(* To lazy reduce a constr, create a ['a clos_infos] with
[create_cbv_infos], inject the term to reduce with [inject]; then use
a reduction function *)
val inject : constr -> fconstr
val fterm_of : fconstr -> fterm
val term_of_fconstr : fconstr -> constr
(* Global and local constant cache *)
type 'a clos_infos
val create_clos_infos : flags -> env -> 'a evar_map -> 'a clos_infos
(* Reduction function *)
(* [norm_val] is for strong normalization *)
val norm_val : 'a clos_infos -> fconstr -> constr
(* [whd_val] is for weak head normalization *)
val whd_val : 'a clos_infos -> fconstr -> constr
(* Conversion auxiliary functions to do step by step normalisation *)
(* [fhnf] and [fnf_apply] are for weak head normalization but staying
in [fconstr] world to perform step by step weak head normalization *)
val fhnf: 'a clos_infos -> fconstr -> int * fconstr * fconstr stack
val fhnf_apply : 'a clos_infos ->
int -> fconstr -> fconstr stack -> int * fconstr * fconstr stack
(* [unfold_reference] unfolds references in a [fconstr] *)
val unfold_reference : 'a clos_infos -> freference -> fconstr option
(***********************************************************************)
(*i This is for lazy debug *)
val lift_fconstr : int -> fconstr -> fconstr
val lift_fconstr_vect : int -> fconstr array -> fconstr array
val mk_clos : fconstr subs -> constr -> fconstr
val mk_clos_vect : fconstr subs -> constr array -> fconstr array
val mk_clos_deep :
(fconstr subs -> constr -> fconstr) ->
fconstr subs -> constr -> fconstr
val knr: 'a clos_infos -> fconstr -> fconstr stack ->
fconstr * fconstr stack
val kl: 'a clos_infos -> fconstr -> fconstr
val to_constr :
(lift -> fconstr -> 'a) -> lift -> fconstr -> ('a,'a) kind_of_term
(* End of cbn debug section i*)
|
