author | wenzelm |
Thu, 07 Dec 2023 12:12:13 +0100 | |
changeset 79172 | 0bea00f77ba3 |
parent 79170 | 4affbdbeefd4 |
child 79176 | 51868d951a42 |
permissions | -rw-r--r-- |
9536
b79b002f32ae
added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents:
9319
diff
changeset
|
1 |
(* Title: Pure/term.ML |
b79b002f32ae
added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents:
9319
diff
changeset
|
2 |
Author: Lawrence C Paulson, Cambridge University Computer Laboratory |
29280 | 3 |
Author: Makarius |
1364
8ea1a962ad72
files now define a structure to allow SML/NJ to optimize the code
clasohm
parents:
1029
diff
changeset
|
4 |
|
4444 | 5 |
Simply typed lambda-calculus: types, terms, and basic operations. |
0 | 6 |
*) |
7 |
||
29257
660234d959f7
provide canonical add_tvar_namesT, add_tvar_names, add_tfree_namesT, add_tfree_names, add_free_names;
wenzelm
parents:
29256
diff
changeset
|
8 |
infix 9 $; |
1364
8ea1a962ad72
files now define a structure to allow SML/NJ to optimize the code
clasohm
parents:
1029
diff
changeset
|
9 |
infixr 5 -->; |
4444 | 10 |
infixr --->; |
11 |
infix aconv; |
|
1364
8ea1a962ad72
files now define a structure to allow SML/NJ to optimize the code
clasohm
parents:
1029
diff
changeset
|
12 |
|
4444 | 13 |
signature BASIC_TERM = |
14 |
sig |
|
34922 | 15 |
type indexname = string * int |
16 |
type class = string |
|
17 |
type sort = class list |
|
18 |
type arity = string * sort list * sort |
|
4444 | 19 |
datatype typ = |
20 |
Type of string * typ list | |
|
21 |
TFree of string * sort | |
|
22 |
TVar of indexname * sort |
|
16537 | 23 |
datatype term = |
24 |
Const of string * typ | |
|
25 |
Free of string * typ | |
|
26 |
Var of indexname * typ | |
|
27 |
Bound of int | |
|
28 |
Abs of string * typ * term | |
|
17756 | 29 |
$ of term * term |
16537 | 30 |
exception TYPE of string * typ list * term list |
31 |
exception TERM of string * term list |
|
21353 | 32 |
val dummyS: sort |
16710 | 33 |
val dummyT: typ |
34 |
val no_dummyT: typ -> typ |
|
4444 | 35 |
val --> : typ * typ -> typ |
36 |
val ---> : typ list * typ -> typ |
|
67703 | 37 |
val is_Type: typ -> bool |
38 |
val is_TFree: typ -> bool |
|
39 |
val is_TVar: typ -> bool |
|
16710 | 40 |
val dest_Type: typ -> string * typ list |
67703 | 41 |
val dest_TFree: typ -> string * sort |
16710 | 42 |
val dest_TVar: typ -> indexname * sort |
43 |
val is_Bound: term -> bool |
|
44 |
val is_Const: term -> bool |
|
45 |
val is_Free: term -> bool |
|
46 |
val is_Var: term -> bool |
|
47 |
val dest_Const: term -> string * typ |
|
48 |
val dest_Free: term -> string * typ |
|
49 |
val dest_Var: term -> indexname * typ |
|
35227 | 50 |
val dest_comb: term -> term * term |
4444 | 51 |
val domain_type: typ -> typ |
4480 | 52 |
val range_type: typ -> typ |
40840 | 53 |
val dest_funT: typ -> typ * typ |
4444 | 54 |
val binder_types: typ -> typ list |
55 |
val body_type: typ -> typ |
|
56 |
val strip_type: typ -> typ list * typ |
|
16710 | 57 |
val type_of1: typ list * term -> typ |
4444 | 58 |
val type_of: term -> typ |
16710 | 59 |
val fastype_of1: typ list * term -> typ |
4444 | 60 |
val fastype_of: term -> typ |
18927 | 61 |
val strip_abs: term -> (string * typ) list * term |
4444 | 62 |
val strip_abs_body: term -> term |
63 |
val strip_abs_vars: term -> (string * typ) list |
|
64 |
val strip_qnt_body: string -> term -> term |
|
65 |
val strip_qnt_vars: string -> term -> (string * typ) list |
|
66 |
val list_comb: term * term list -> term |
|
67 |
val strip_comb: term -> term * term list |
|
68 |
val head_of: term -> term |
|
69 |
val size_of_term: term -> int |
|
29882
29154e67731d
New command find_consts searching for constants by type (by Timothy Bourke).
kleing
parents:
29286
diff
changeset
|
70 |
val size_of_typ: typ -> int |
18847 | 71 |
val map_atyps: (typ -> typ) -> typ -> typ |
72 |
val map_aterms: (term -> term) -> term -> term |
|
4444 | 73 |
val map_type_tvar: (indexname * sort -> typ) -> typ -> typ |
74 |
val map_type_tfree: (string * sort -> typ) -> typ -> typ |
|
20548
8ef25fe585a8
renamed Term.map_term_types to Term.map_types (cf. Term.fold_types);
wenzelm
parents:
20531
diff
changeset
|
75 |
val map_types: (typ -> typ) -> term -> term |
16943 | 76 |
val fold_atyps: (typ -> 'a -> 'a) -> typ -> 'a -> 'a |
35986 | 77 |
val fold_atyps_sorts: (typ * sort -> 'a -> 'a) -> typ -> 'a -> 'a |
16943 | 78 |
val fold_aterms: (term -> 'a -> 'a) -> term -> 'a -> 'a |
79 |
val fold_term_types: (term -> typ -> 'a -> 'a) -> term -> 'a -> 'a |
|
80 |
val fold_types: (typ -> 'a -> 'a) -> term -> 'a -> 'a |
|
24483 | 81 |
val burrow_types: (typ list -> typ list) -> term list -> term list |
16710 | 82 |
val aconv: term * term -> bool |
4444 | 83 |
val propT: typ |
84 |
val strip_all_body: term -> term |
|
85 |
val strip_all_vars: term -> (string * typ) list |
|
79172
0bea00f77ba3
minor performance tuning: regular Same.operation;
wenzelm
parents:
79170
diff
changeset
|
86 |
val incr_bv_same: int -> int -> term Same.operation |
79170
4affbdbeefd4
clarified signature: more standard argument order;
wenzelm
parents:
79168
diff
changeset
|
87 |
val incr_bv: int -> int -> term -> term |
4444 | 88 |
val incr_boundvars: int -> term -> term |
89 |
val add_loose_bnos: term * int * int list -> int list |
|
90 |
val loose_bnos: term -> int list |
|
91 |
val loose_bvar: term * int -> bool |
|
92 |
val loose_bvar1: term * int -> bool |
|
93 |
val subst_bounds: term list * term -> term |
|
94 |
val subst_bound: term * term -> term |
|
95 |
val betapply: term * term -> term |
|
18183 | 96 |
val betapplys: term * term list -> term |
4444 | 97 |
val subst_free: (term * term) list -> term -> term |
98 |
val abstract_over: term * term -> term |
|
11922 | 99 |
val lambda: term -> term -> term |
44241 | 100 |
val absfree: string * typ -> term -> term |
101 |
val absdummy: typ -> term -> term |
|
16710 | 102 |
val subst_atomic: (term * term) list -> term -> term |
103 |
val typ_subst_atomic: (typ * typ) list -> typ -> typ |
|
104 |
val subst_atomic_types: (typ * typ) list -> term -> term |
|
105 |
val typ_subst_TVars: (indexname * typ) list -> typ -> typ |
|
106 |
val subst_TVars: (indexname * typ) list -> term -> term |
|
107 |
val subst_Vars: (indexname * term) list -> term -> term |
|
108 |
val subst_vars: (indexname * typ) list * (indexname * term) list -> term -> term |
|
109 |
val is_first_order: string list -> term -> bool |
|
4444 | 110 |
val maxidx_of_typ: typ -> int |
111 |
val maxidx_of_typs: typ list -> int |
|
112 |
val maxidx_of_term: term -> int |
|
61248 | 113 |
val fold_subtypes: (typ -> 'a -> 'a) -> typ -> 'a -> 'a |
19909 | 114 |
val exists_subtype: (typ -> bool) -> typ -> bool |
20531 | 115 |
val exists_type: (typ -> bool) -> term -> bool |
16943 | 116 |
val exists_subterm: (term -> bool) -> term -> bool |
16710 | 117 |
val exists_Const: (string * typ -> bool) -> term -> bool |
76047 | 118 |
val is_schematic: term -> bool |
4444 | 119 |
end; |
0 | 120 |
|
4444 | 121 |
signature TERM = |
122 |
sig |
|
123 |
include BASIC_TERM |
|
19394 | 124 |
val aT: sort -> typ |
125 |
val itselfT: typ -> typ |
|
126 |
val a_itselfT: typ |
|
22908 | 127 |
val argument_type_of: term -> int -> typ |
46219
426ed18eba43
discontinued old-style Term.list_abs in favour of plain Term.abs;
wenzelm
parents:
46218
diff
changeset
|
128 |
val abs: string * typ -> term -> term |
74577
d4829a7333e2
clarified instantiation: local beta reduction after substitution, as for Envir.expand_term_defs;
wenzelm
parents:
74525
diff
changeset
|
129 |
val args_of: term -> term list |
29257
660234d959f7
provide canonical add_tvar_namesT, add_tvar_names, add_tfree_namesT, add_tfree_names, add_free_names;
wenzelm
parents:
29256
diff
changeset
|
130 |
val add_tvar_namesT: typ -> indexname list -> indexname list |
660234d959f7
provide canonical add_tvar_namesT, add_tvar_names, add_tfree_namesT, add_tfree_names, add_free_names;
wenzelm
parents:
29256
diff
changeset
|
131 |
val add_tvar_names: term -> indexname list -> indexname list |
16943 | 132 |
val add_tvarsT: typ -> (indexname * sort) list -> (indexname * sort) list |
133 |
val add_tvars: term -> (indexname * sort) list -> (indexname * sort) list |
|
29257
660234d959f7
provide canonical add_tvar_namesT, add_tvar_names, add_tfree_namesT, add_tfree_names, add_free_names;
wenzelm
parents:
29256
diff
changeset
|
134 |
val add_var_names: term -> indexname list -> indexname list |
16943 | 135 |
val add_vars: term -> (indexname * typ) list -> (indexname * typ) list |
29257
660234d959f7
provide canonical add_tvar_namesT, add_tvar_names, add_tfree_namesT, add_tfree_names, add_free_names;
wenzelm
parents:
29256
diff
changeset
|
136 |
val add_tfree_namesT: typ -> string list -> string list |
660234d959f7
provide canonical add_tvar_namesT, add_tvar_names, add_tfree_namesT, add_tfree_names, add_free_names;
wenzelm
parents:
29256
diff
changeset
|
137 |
val add_tfree_names: term -> string list -> string list |
16943 | 138 |
val add_tfreesT: typ -> (string * sort) list -> (string * sort) list |
139 |
val add_tfrees: term -> (string * sort) list -> (string * sort) list |
|
29257
660234d959f7
provide canonical add_tvar_namesT, add_tvar_names, add_tfree_namesT, add_tfree_names, add_free_names;
wenzelm
parents:
29256
diff
changeset
|
140 |
val add_free_names: term -> string list -> string list |
16943 | 141 |
val add_frees: term -> (string * typ) list -> (string * typ) list |
29286 | 142 |
val add_const_names: term -> string list -> string list |
143 |
val add_consts: term -> (string * typ) list -> (string * typ) list |
|
25050 | 144 |
val hidden_polymorphism: term -> (indexname * sort) list |
29278 | 145 |
val declare_typ_names: typ -> Name.context -> Name.context |
146 |
val declare_term_names: term -> Name.context -> Name.context |
|
147 |
val declare_term_frees: term -> Name.context -> Name.context |
|
148 |
val variant_frees: term -> (string * 'a) list -> (string * 'a) list |
|
149 |
val rename_wrt_term: term -> (string * 'a) list -> (string * 'a) list |
|
29269
5c25a2012975
moved term order operations to structure TermOrd (cf. Pure/term_ord.ML);
wenzelm
parents:
29265
diff
changeset
|
150 |
val eq_ix: indexname * indexname -> bool |
5c25a2012975
moved term order operations to structure TermOrd (cf. Pure/term_ord.ML);
wenzelm
parents:
29265
diff
changeset
|
151 |
val eq_tvar: (indexname * sort) * (indexname * sort) -> bool |
5c25a2012975
moved term order operations to structure TermOrd (cf. Pure/term_ord.ML);
wenzelm
parents:
29265
diff
changeset
|
152 |
val eq_var: (indexname * typ) * (indexname * typ) -> bool |
33537
06c87d2c5b5a
locale_const/target_notation: uniform use of Term.aconv_untyped;
wenzelm
parents:
33063
diff
changeset
|
153 |
val aconv_untyped: term * term -> bool |
29269
5c25a2012975
moved term order operations to structure TermOrd (cf. Pure/term_ord.ML);
wenzelm
parents:
29265
diff
changeset
|
154 |
val could_unify: term * term -> bool |
20109 | 155 |
val strip_abs_eta: int -> term -> (string * typ) list * term |
48263 | 156 |
val match_bvars: (term * term) -> (string * string) list -> (string * string) list |
22031 | 157 |
val map_abs_vars: (string -> string) -> term -> term |
12981 | 158 |
val rename_abs: term -> term -> term -> term option |
42083
e1209fc7ecdc
added Term.is_open and Term.is_dependent convenience, to cover common situations of loose bounds;
wenzelm
parents:
40844
diff
changeset
|
159 |
val is_open: term -> bool |
e1209fc7ecdc
added Term.is_open and Term.is_dependent convenience, to cover common situations of loose bounds;
wenzelm
parents:
40844
diff
changeset
|
160 |
val is_dependent: term -> bool |
61655
f217bbe4e93e
avoid vacuous quantification, as usual for shared variable scope;
wenzelm
parents:
61248
diff
changeset
|
161 |
val term_name: term -> string |
60404
422b63ef0147
clarified abstracted term bindings (again, see c8384ff11711);
wenzelm
parents:
60311
diff
changeset
|
162 |
val dependent_lambda_name: string * term -> term -> term |
32198 | 163 |
val lambda_name: string * term -> term -> term |
25050 | 164 |
val close_schematic_term: term -> term |
16710 | 165 |
val maxidx_typ: typ -> int -> int |
166 |
val maxidx_typs: typ list -> int -> int |
|
167 |
val maxidx_term: term -> int -> int |
|
63619 | 168 |
val could_beta_contract: term -> bool |
169 |
val could_eta_contract: term -> bool |
|
170 |
val could_beta_eta_contract: term -> bool |
|
74446 | 171 |
val used_free: string -> term -> bool |
74525
c960bfcb91db
discontinued Term.dest_abs / Logic.dest_all, which are officially superseded by Variable.dest_abs etc., but there are also Term.dest_abs_global to recover existing tools easily;
wenzelm
parents:
74446
diff
changeset
|
172 |
exception USED_FREE of string * term |
c960bfcb91db
discontinued Term.dest_abs / Logic.dest_all, which are officially superseded by Variable.dest_abs etc., but there are also Term.dest_abs_global to recover existing tools easily;
wenzelm
parents:
74446
diff
changeset
|
173 |
val dest_abs_fresh: string -> term -> (string * typ) * term |
c960bfcb91db
discontinued Term.dest_abs / Logic.dest_all, which are officially superseded by Variable.dest_abs etc., but there are also Term.dest_abs_global to recover existing tools easily;
wenzelm
parents:
74446
diff
changeset
|
174 |
val dest_abs_global: term -> (string * typ) * term |
18253 | 175 |
val dummy_pattern: typ -> term |
45156 | 176 |
val dummy: term |
177 |
val dummy_prop: term |
|
22723 | 178 |
val is_dummy_pattern: term -> bool |
24733 | 179 |
val free_dummy_patterns: term -> Name.context -> term * Name.context |
9536
b79b002f32ae
added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents:
9319
diff
changeset
|
180 |
val no_dummy_patterns: term -> term |
24762 | 181 |
val replace_dummy_patterns: term -> int -> term * int |
16035 | 182 |
val show_dummy_patterns: term -> term |
14786
24a7bc97a27a
moved some sort ops to sorts.ML; added string_of_vname (from Syntax module);
wenzelm
parents:
14695
diff
changeset
|
183 |
val string_of_vname: indexname -> string |
24a7bc97a27a
moved some sort ops to sorts.ML; added string_of_vname (from Syntax module);
wenzelm
parents:
14695
diff
changeset
|
184 |
val string_of_vname': indexname -> string |
4444 | 185 |
end; |
186 |
||
187 |
structure Term: TERM = |
|
1364
8ea1a962ad72
files now define a structure to allow SML/NJ to optimize the code
clasohm
parents:
1029
diff
changeset
|
188 |
struct |
0 | 189 |
|
190 |
(*Indexnames can be quickly renamed by adding an offset to the integer part, |
|
191 |
for resolution.*) |
|
16537 | 192 |
type indexname = string * int; |
0 | 193 |
|
63611 | 194 |
(*Types are classified by sorts.*) |
0 | 195 |
type class = string; |
196 |
type sort = class list; |
|
14829
cfa5fe01a7b7
moved read_int etc. to library.ML; added type 'arity';
wenzelm
parents:
14786
diff
changeset
|
197 |
type arity = string * sort list * sort; |
0 | 198 |
|
63611 | 199 |
(*The sorts attached to TFrees and TVars specify the sort of that variable.*) |
0 | 200 |
datatype typ = Type of string * typ list |
201 |
| TFree of string * sort |
|
9536
b79b002f32ae
added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents:
9319
diff
changeset
|
202 |
| TVar of indexname * sort; |
0 | 203 |
|
6033
c8c69a4a7762
moved dest_Type to term.ML from HOL/Tools/primrec_package
paulson
parents:
5986
diff
changeset
|
204 |
(*Terms. Bound variables are indicated by depth number. |
0 | 205 |
Free variables, (scheme) variables and constants have names. |
4626 | 206 |
An term is "closed" if every bound variable of level "lev" |
13000 | 207 |
is enclosed by at least "lev" abstractions. |
0 | 208 |
|
209 |
It is possible to create meaningless terms containing loose bound vars |
|
210 |
or type mismatches. But such terms are not allowed in rules. *) |
|
211 |
||
13000 | 212 |
datatype term = |
0 | 213 |
Const of string * typ |
13000 | 214 |
| Free of string * typ |
0 | 215 |
| Var of indexname * typ |
216 |
| Bound of int |
|
217 |
| Abs of string*typ*term |
|
3965 | 218 |
| op $ of term*term; |
0 | 219 |
|
16537 | 220 |
(*Errors involving type mismatches*) |
0 | 221 |
exception TYPE of string * typ list * term list; |
222 |
||
16537 | 223 |
(*Errors errors involving terms*) |
0 | 224 |
exception TERM of string * term list; |
225 |
||
226 |
(*Note variable naming conventions! |
|
227 |
a,b,c: string |
|
228 |
f,g,h: functions (including terms of function type) |
|
229 |
i,j,m,n: int |
|
230 |
t,u: term |
|
231 |
v,w: indexnames |
|
232 |
x,y: any |
|
233 |
A,B,C: term (denoting formulae) |
|
234 |
T,U: typ |
|
235 |
*) |
|
236 |
||
237 |
||
6033
c8c69a4a7762
moved dest_Type to term.ML from HOL/Tools/primrec_package
paulson
parents:
5986
diff
changeset
|
238 |
(** Types **) |
c8c69a4a7762
moved dest_Type to term.ML from HOL/Tools/primrec_package
paulson
parents:
5986
diff
changeset
|
239 |
|
21353 | 240 |
(*dummies for type-inference etc.*) |
241 |
val dummyS = [""]; |
|
16537 | 242 |
val dummyT = Type ("dummy", []); |
243 |
||
244 |
fun no_dummyT typ = |
|
245 |
let |
|
246 |
fun check (T as Type ("dummy", _)) = |
|
247 |
raise TYPE ("Illegal occurrence of '_' dummy type", [T], []) |
|
248 |
| check (Type (_, Ts)) = List.app check Ts |
|
249 |
| check _ = (); |
|
250 |
in check typ; typ end; |
|
251 |
||
6033
c8c69a4a7762
moved dest_Type to term.ML from HOL/Tools/primrec_package
paulson
parents:
5986
diff
changeset
|
252 |
fun S --> T = Type("fun",[S,T]); |
c8c69a4a7762
moved dest_Type to term.ML from HOL/Tools/primrec_package
paulson
parents:
5986
diff
changeset
|
253 |
|
c8c69a4a7762
moved dest_Type to term.ML from HOL/Tools/primrec_package
paulson
parents:
5986
diff
changeset
|
254 |
(*handy for multiple args: [T1,...,Tn]--->T gives T1-->(T2--> ... -->T)*) |
15570 | 255 |
val op ---> = Library.foldr (op -->); |
6033
c8c69a4a7762
moved dest_Type to term.ML from HOL/Tools/primrec_package
paulson
parents:
5986
diff
changeset
|
256 |
|
67703 | 257 |
|
258 |
(** Discriminators **) |
|
259 |
||
260 |
fun is_Type (Type _) = true |
|
261 |
| is_Type _ = false; |
|
262 |
||
263 |
fun is_TFree (TFree _) = true |
|
264 |
| is_TFree _ = false; |
|
265 |
||
266 |
fun is_TVar (TVar _) = true |
|
267 |
| is_TVar _ = false; |
|
268 |
||
269 |
||
270 |
(** Destructors **) |
|
271 |
||
6033
c8c69a4a7762
moved dest_Type to term.ML from HOL/Tools/primrec_package
paulson
parents:
5986
diff
changeset
|
272 |
fun dest_Type (Type x) = x |
c8c69a4a7762
moved dest_Type to term.ML from HOL/Tools/primrec_package
paulson
parents:
5986
diff
changeset
|
273 |
| dest_Type T = raise TYPE ("dest_Type", [T], []); |
67703 | 274 |
|
275 |
fun dest_TFree (TFree x) = x |
|
276 |
| dest_TFree T = raise TYPE ("dest_TFree", [T], []); |
|
277 |
||
15914 | 278 |
fun dest_TVar (TVar x) = x |
279 |
| dest_TVar T = raise TYPE ("dest_TVar", [T], []); |
|
6033
c8c69a4a7762
moved dest_Type to term.ML from HOL/Tools/primrec_package
paulson
parents:
5986
diff
changeset
|
280 |
|
16537 | 281 |
|
0 | 282 |
(** Discriminators **) |
283 |
||
7318 | 284 |
fun is_Bound (Bound _) = true |
285 |
| is_Bound _ = false; |
|
286 |
||
0 | 287 |
fun is_Const (Const _) = true |
288 |
| is_Const _ = false; |
|
289 |
||
290 |
fun is_Free (Free _) = true |
|
291 |
| is_Free _ = false; |
|
292 |
||
293 |
fun is_Var (Var _) = true |
|
294 |
| is_Var _ = false; |
|
295 |
||
16537 | 296 |
|
0 | 297 |
(** Destructors **) |
298 |
||
299 |
fun dest_Const (Const x) = x |
|
300 |
| dest_Const t = raise TERM("dest_Const", [t]); |
|
301 |
||
302 |
fun dest_Free (Free x) = x |
|
303 |
| dest_Free t = raise TERM("dest_Free", [t]); |
|
304 |
||
305 |
fun dest_Var (Var x) = x |
|
306 |
| dest_Var t = raise TERM("dest_Var", [t]); |
|
307 |
||
35227 | 308 |
fun dest_comb (t1 $ t2) = (t1, t2) |
309 |
| dest_comb t = raise TERM("dest_comb", [t]); |
|
310 |
||
0 | 311 |
|
40841 | 312 |
fun domain_type (Type ("fun", [T, _])) = T; |
313 |
||
314 |
fun range_type (Type ("fun", [_, U])) = U; |
|
4064 | 315 |
|
40840 | 316 |
fun dest_funT (Type ("fun", [T, U])) = (T, U) |
317 |
| dest_funT T = raise TYPE ("dest_funT", [T], []); |
|
318 |
||
319 |
||
63611 | 320 |
(*maps [T1,...,Tn]--->T to the list [T1,T2,...,Tn]*) |
40841 | 321 |
fun binder_types (Type ("fun", [T, U])) = T :: binder_types U |
322 |
| binder_types _ = []; |
|
0 | 323 |
|
63611 | 324 |
(*maps [T1,...,Tn]--->T to T*) |
40841 | 325 |
fun body_type (Type ("fun", [_, U])) = body_type U |
326 |
| body_type T = T; |
|
0 | 327 |
|
63611 | 328 |
(*maps [T1,...,Tn]--->T to ([T1,T2,...,Tn], T)*) |
40841 | 329 |
fun strip_type T = (binder_types T, body_type T); |
0 | 330 |
|
331 |
||
332 |
(*Compute the type of the term, checking that combinations are well-typed |
|
333 |
Ts = [T0,T1,...] holds types of bound variables 0, 1, ...*) |
|
334 |
fun type_of1 (Ts, Const (_,T)) = T |
|
335 |
| type_of1 (Ts, Free (_,T)) = T |
|
30146 | 336 |
| type_of1 (Ts, Bound i) = (nth Ts i |
43278 | 337 |
handle General.Subscript => raise TYPE("type_of: bound variable", [], [Bound i])) |
0 | 338 |
| type_of1 (Ts, Var (_,T)) = T |
339 |
| type_of1 (Ts, Abs (_,T,body)) = T --> type_of1(T::Ts, body) |
|
13000 | 340 |
| type_of1 (Ts, f$u) = |
0 | 341 |
let val U = type_of1(Ts,u) |
342 |
and T = type_of1(Ts,f) |
|
343 |
in case T of |
|
9536
b79b002f32ae
added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents:
9319
diff
changeset
|
344 |
Type("fun",[T1,T2]) => |
b79b002f32ae
added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents:
9319
diff
changeset
|
345 |
if T1=U then T2 else raise TYPE |
b79b002f32ae
added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents:
9319
diff
changeset
|
346 |
("type_of: type mismatch in application", [T1,U], [f$u]) |
13000 | 347 |
| _ => raise TYPE |
9536
b79b002f32ae
added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents:
9319
diff
changeset
|
348 |
("type_of: function type is expected in application", |
b79b002f32ae
added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents:
9319
diff
changeset
|
349 |
[T,U], [f$u]) |
0 | 350 |
end; |
351 |
||
352 |
fun type_of t : typ = type_of1 ([],t); |
|
353 |
||
73351
88dd8a6a42ba
slightly more efficient Term.fastype_of (only little impact in regular applications);
wenzelm
parents:
67721
diff
changeset
|
354 |
(*Determine the type of a term, with minimal checking*) |
88dd8a6a42ba
slightly more efficient Term.fastype_of (only little impact in regular applications);
wenzelm
parents:
67721
diff
changeset
|
355 |
local |
61 | 356 |
|
73351
88dd8a6a42ba
slightly more efficient Term.fastype_of (only little impact in regular applications);
wenzelm
parents:
67721
diff
changeset
|
357 |
fun fastype_of_term Ts (Abs (_, T, t)) = T --> fastype_of_term (T :: Ts) t |
88dd8a6a42ba
slightly more efficient Term.fastype_of (only little impact in regular applications);
wenzelm
parents:
67721
diff
changeset
|
358 |
| fastype_of_term Ts (t $ _) = range_type_of Ts t |
88dd8a6a42ba
slightly more efficient Term.fastype_of (only little impact in regular applications);
wenzelm
parents:
67721
diff
changeset
|
359 |
| fastype_of_term Ts a = fastype_of_atom Ts a |
88dd8a6a42ba
slightly more efficient Term.fastype_of (only little impact in regular applications);
wenzelm
parents:
67721
diff
changeset
|
360 |
and fastype_of_atom _ (Const (_, T)) = T |
88dd8a6a42ba
slightly more efficient Term.fastype_of (only little impact in regular applications);
wenzelm
parents:
67721
diff
changeset
|
361 |
| fastype_of_atom _ (Free (_, T)) = T |
88dd8a6a42ba
slightly more efficient Term.fastype_of (only little impact in regular applications);
wenzelm
parents:
67721
diff
changeset
|
362 |
| fastype_of_atom _ (Var (_, T)) = T |
88dd8a6a42ba
slightly more efficient Term.fastype_of (only little impact in regular applications);
wenzelm
parents:
67721
diff
changeset
|
363 |
| fastype_of_atom Ts (Bound i) = fastype_of_bound Ts i |
88dd8a6a42ba
slightly more efficient Term.fastype_of (only little impact in regular applications);
wenzelm
parents:
67721
diff
changeset
|
364 |
and fastype_of_bound (T :: Ts) i = if i = 0 then T else fastype_of_bound Ts (i - 1) |
88dd8a6a42ba
slightly more efficient Term.fastype_of (only little impact in regular applications);
wenzelm
parents:
67721
diff
changeset
|
365 |
| fastype_of_bound [] i = raise TERM ("fastype_of: Bound", [Bound i]) |
88dd8a6a42ba
slightly more efficient Term.fastype_of (only little impact in regular applications);
wenzelm
parents:
67721
diff
changeset
|
366 |
and range_type_of Ts (Abs (_, T, u)) = fastype_of_term (T :: Ts) u |
88dd8a6a42ba
slightly more efficient Term.fastype_of (only little impact in regular applications);
wenzelm
parents:
67721
diff
changeset
|
367 |
| range_type_of Ts (t $ u) = range_type_ofT (t $ u) (range_type_of Ts t) |
88dd8a6a42ba
slightly more efficient Term.fastype_of (only little impact in regular applications);
wenzelm
parents:
67721
diff
changeset
|
368 |
| range_type_of Ts a = range_type_ofT a (fastype_of_atom Ts a) |
88dd8a6a42ba
slightly more efficient Term.fastype_of (only little impact in regular applications);
wenzelm
parents:
67721
diff
changeset
|
369 |
and range_type_ofT _ (Type ("fun", [_, T])) = T |
88dd8a6a42ba
slightly more efficient Term.fastype_of (only little impact in regular applications);
wenzelm
parents:
67721
diff
changeset
|
370 |
| range_type_ofT t _ = raise TERM ("fastype_of: expected function type", [t]); |
88dd8a6a42ba
slightly more efficient Term.fastype_of (only little impact in regular applications);
wenzelm
parents:
67721
diff
changeset
|
371 |
|
88dd8a6a42ba
slightly more efficient Term.fastype_of (only little impact in regular applications);
wenzelm
parents:
67721
diff
changeset
|
372 |
in |
88dd8a6a42ba
slightly more efficient Term.fastype_of (only little impact in regular applications);
wenzelm
parents:
67721
diff
changeset
|
373 |
|
88dd8a6a42ba
slightly more efficient Term.fastype_of (only little impact in regular applications);
wenzelm
parents:
67721
diff
changeset
|
374 |
val fastype_of1 = uncurry fastype_of_term; |
88dd8a6a42ba
slightly more efficient Term.fastype_of (only little impact in regular applications);
wenzelm
parents:
67721
diff
changeset
|
375 |
val fastype_of = fastype_of_term []; |
88dd8a6a42ba
slightly more efficient Term.fastype_of (only little impact in regular applications);
wenzelm
parents:
67721
diff
changeset
|
376 |
|
88dd8a6a42ba
slightly more efficient Term.fastype_of (only little impact in regular applications);
wenzelm
parents:
67721
diff
changeset
|
377 |
end; |
0 | 378 |
|
16678 | 379 |
(*Determine the argument type of a function*) |
22908 | 380 |
fun argument_type_of tm k = |
16678 | 381 |
let |
382 |
fun argT i (Type ("fun", [T, U])) = if i = 0 then T else argT (i - 1) U |
|
383 |
| argT _ T = raise TYPE ("argument_type_of", [T], []); |
|
384 |
||
385 |
fun arg 0 _ (Abs (_, T, _)) = T |
|
386 |
| arg i Ts (Abs (_, T, t)) = arg (i - 1) (T :: Ts) t |
|
387 |
| arg i Ts (t $ _) = arg (i + 1) Ts t |
|
388 |
| arg i Ts a = argT i (fastype_of1 (Ts, a)); |
|
22908 | 389 |
in arg k [] tm end; |
16678 | 390 |
|
0 | 391 |
|
46219
426ed18eba43
discontinued old-style Term.list_abs in favour of plain Term.abs;
wenzelm
parents:
46218
diff
changeset
|
392 |
fun abs (x, T) t = Abs (x, T, t); |
10806 | 393 |
|
18927 | 394 |
fun strip_abs (Abs (a, T, t)) = |
395 |
let val (a', t') = strip_abs t |
|
396 |
in ((a, T) :: a', t') end |
|
397 |
| strip_abs t = ([], t); |
|
398 |
||
63611 | 399 |
(*maps (x1,...,xn)t to t*) |
13000 | 400 |
fun strip_abs_body (Abs(_,_,t)) = strip_abs_body t |
0 | 401 |
| strip_abs_body u = u; |
402 |
||
63611 | 403 |
(*maps (x1,...,xn)t to [x1, ..., xn]*) |
13000 | 404 |
fun strip_abs_vars (Abs(a,T,t)) = (a,T) :: strip_abs_vars t |
0 | 405 |
| strip_abs_vars u = [] : (string*typ) list; |
406 |
||
407 |
||
408 |
fun strip_qnt_body qnt = |
|
409 |
let fun strip(tm as Const(c,_)$Abs(_,_,t)) = if c=qnt then strip t else tm |
|
410 |
| strip t = t |
|
411 |
in strip end; |
|
412 |
||
413 |
fun strip_qnt_vars qnt = |
|
414 |
let fun strip(Const(c,_)$Abs(a,T,t)) = if c=qnt then (a,T)::strip t else [] |
|
415 |
| strip t = [] : (string*typ) list |
|
416 |
in strip end; |
|
417 |
||
418 |
||
63611 | 419 |
(*maps (f, [t1,...,tn]) to f(t1,...,tn)*) |
15570 | 420 |
val list_comb : term * term list -> term = Library.foldl (op $); |
0 | 421 |
|
422 |
||
63611 | 423 |
(*maps f(t1,...,tn) to (f, [t1,...,tn]) ; naturally tail-recursive*) |
13000 | 424 |
fun strip_comb u : term * term list = |
0 | 425 |
let fun stripc (f$t, ts) = stripc (f, t::ts) |
13000 | 426 |
| stripc x = x |
0 | 427 |
in stripc(u,[]) end; |
428 |
||
74577
d4829a7333e2
clarified instantiation: local beta reduction after substitution, as for Envir.expand_term_defs;
wenzelm
parents:
74525
diff
changeset
|
429 |
fun args_of u = |
d4829a7333e2
clarified instantiation: local beta reduction after substitution, as for Envir.expand_term_defs;
wenzelm
parents:
74525
diff
changeset
|
430 |
let fun args (f $ x) xs = args f (x :: xs) |
d4829a7333e2
clarified instantiation: local beta reduction after substitution, as for Envir.expand_term_defs;
wenzelm
parents:
74525
diff
changeset
|
431 |
| args _ xs = xs |
d4829a7333e2
clarified instantiation: local beta reduction after substitution, as for Envir.expand_term_defs;
wenzelm
parents:
74525
diff
changeset
|
432 |
in args u [] end; |
0 | 433 |
|
63611 | 434 |
(*maps f(t1,...,tn) to f , which is never a combination*) |
0 | 435 |
fun head_of (f$t) = head_of f |
436 |
| head_of u = u; |
|
437 |
||
16599 | 438 |
(*number of atoms and abstractions in a term*) |
439 |
fun size_of_term tm = |
|
440 |
let |
|
30144
56ae4893e8ae
tuned/unified size_of_term and size_of_typ, eliminated obsolete foldl;
wenzelm
parents:
29882
diff
changeset
|
441 |
fun add_size (t $ u) n = add_size t (add_size u n) |
56ae4893e8ae
tuned/unified size_of_term and size_of_typ, eliminated obsolete foldl;
wenzelm
parents:
29882
diff
changeset
|
442 |
| add_size (Abs (_ ,_, t)) n = add_size t (n + 1) |
56ae4893e8ae
tuned/unified size_of_term and size_of_typ, eliminated obsolete foldl;
wenzelm
parents:
29882
diff
changeset
|
443 |
| add_size _ n = n + 1; |
56ae4893e8ae
tuned/unified size_of_term and size_of_typ, eliminated obsolete foldl;
wenzelm
parents:
29882
diff
changeset
|
444 |
in add_size tm 0 end; |
0 | 445 |
|
30144
56ae4893e8ae
tuned/unified size_of_term and size_of_typ, eliminated obsolete foldl;
wenzelm
parents:
29882
diff
changeset
|
446 |
(*number of atoms and constructors in a type*) |
29882
29154e67731d
New command find_consts searching for constants by type (by Timothy Bourke).
kleing
parents:
29286
diff
changeset
|
447 |
fun size_of_typ ty = |
29154e67731d
New command find_consts searching for constants by type (by Timothy Bourke).
kleing
parents:
29286
diff
changeset
|
448 |
let |
30144
56ae4893e8ae
tuned/unified size_of_term and size_of_typ, eliminated obsolete foldl;
wenzelm
parents:
29882
diff
changeset
|
449 |
fun add_size (Type (_, tys)) n = fold add_size tys (n + 1) |
56ae4893e8ae
tuned/unified size_of_term and size_of_typ, eliminated obsolete foldl;
wenzelm
parents:
29882
diff
changeset
|
450 |
| add_size _ n = n + 1; |
56ae4893e8ae
tuned/unified size_of_term and size_of_typ, eliminated obsolete foldl;
wenzelm
parents:
29882
diff
changeset
|
451 |
in add_size ty 0 end; |
29882
29154e67731d
New command find_consts searching for constants by type (by Timothy Bourke).
kleing
parents:
29286
diff
changeset
|
452 |
|
18847 | 453 |
fun map_atyps f (Type (a, Ts)) = Type (a, map (map_atyps f) Ts) |
18976
4efb82669880
fixed the most silly bug conceivable in map_atyps
haftmann
parents:
18975
diff
changeset
|
454 |
| map_atyps f T = f T; |
18847 | 455 |
|
456 |
fun map_aterms f (t $ u) = map_aterms f t $ map_aterms f u |
|
457 |
| map_aterms f (Abs (a, T, t)) = Abs (a, T, map_aterms f t) |
|
458 |
| map_aterms f t = f t; |
|
459 |
||
18981 | 460 |
fun map_type_tvar f = map_atyps (fn TVar x => f x | T => T); |
461 |
fun map_type_tfree f = map_atyps (fn TFree x => f x | T => T); |
|
949
83c588d6fee9
Changed treatment of during type inference internally generated type
nipkow
parents:
728
diff
changeset
|
462 |
|
20548
8ef25fe585a8
renamed Term.map_term_types to Term.map_types (cf. Term.fold_types);
wenzelm
parents:
20531
diff
changeset
|
463 |
fun map_types f = |
16678 | 464 |
let |
465 |
fun map_aux (Const (a, T)) = Const (a, f T) |
|
466 |
| map_aux (Free (a, T)) = Free (a, f T) |
|
467 |
| map_aux (Var (v, T)) = Var (v, f T) |
|
39293 | 468 |
| map_aux (Bound i) = Bound i |
16678 | 469 |
| map_aux (Abs (a, T, t)) = Abs (a, f T, map_aux t) |
470 |
| map_aux (t $ u) = map_aux t $ map_aux u; |
|
471 |
in map_aux end; |
|
0 | 472 |
|
473 |
||
16943 | 474 |
(* fold types and terms *) |
475 |
||
476 |
fun fold_atyps f (Type (_, Ts)) = fold (fold_atyps f) Ts |
|
477 |
| fold_atyps f T = f T; |
|
478 |
||
35986 | 479 |
fun fold_atyps_sorts f = |
480 |
fold_atyps (fn T as TFree (_, S) => f (T, S) | T as TVar (_, S) => f (T, S)); |
|
481 |
||
16943 | 482 |
fun fold_aterms f (t $ u) = fold_aterms f t #> fold_aterms f u |
483 |
| fold_aterms f (Abs (_, _, t)) = fold_aterms f t |
|
484 |
| fold_aterms f a = f a; |
|
485 |
||
486 |
fun fold_term_types f (t as Const (_, T)) = f t T |
|
487 |
| fold_term_types f (t as Free (_, T)) = f t T |
|
488 |
| fold_term_types f (t as Var (_, T)) = f t T |
|
489 |
| fold_term_types f (Bound _) = I |
|
490 |
| fold_term_types f (t as Abs (_, T, b)) = f t T #> fold_term_types f b |
|
491 |
| fold_term_types f (t $ u) = fold_term_types f t #> fold_term_types f u; |
|
492 |
||
493 |
fun fold_types f = fold_term_types (K f); |
|
494 |
||
24483 | 495 |
fun replace_types (Const (c, _)) (T :: Ts) = (Const (c, T), Ts) |
496 |
| replace_types (Free (x, _)) (T :: Ts) = (Free (x, T), Ts) |
|
497 |
| replace_types (Var (xi, _)) (T :: Ts) = (Var (xi, T), Ts) |
|
498 |
| replace_types (Bound i) Ts = (Bound i, Ts) |
|
499 |
| replace_types (Abs (x, _, b)) (T :: Ts) = |
|
500 |
let val (b', Ts') = replace_types b Ts |
|
501 |
in (Abs (x, T, b'), Ts') end |
|
502 |
| replace_types (t $ u) Ts = |
|
503 |
let |
|
504 |
val (t', Ts') = replace_types t Ts; |
|
505 |
val (u', Ts'') = replace_types u Ts'; |
|
506 |
in (t' $ u', Ts'') end; |
|
507 |
||
508 |
fun burrow_types f ts = |
|
509 |
let |
|
49674
dbadb4d03cbc
report sort assignment of visible type variables;
wenzelm
parents:
48263
diff
changeset
|
510 |
val Ts = rev ((fold o fold_types) cons ts []); |
24483 | 511 |
val Ts' = f Ts; |
512 |
val (ts', []) = fold_map replace_types ts Ts'; |
|
513 |
in ts' end; |
|
514 |
||
16943 | 515 |
(*collect variables*) |
29257
660234d959f7
provide canonical add_tvar_namesT, add_tvar_names, add_tfree_namesT, add_tfree_names, add_free_names;
wenzelm
parents:
29256
diff
changeset
|
516 |
val add_tvar_namesT = fold_atyps (fn TVar (xi, _) => insert (op =) xi | _ => I); |
660234d959f7
provide canonical add_tvar_namesT, add_tvar_names, add_tfree_namesT, add_tfree_names, add_free_names;
wenzelm
parents:
29256
diff
changeset
|
517 |
val add_tvar_names = fold_types add_tvar_namesT; |
16943 | 518 |
val add_tvarsT = fold_atyps (fn TVar v => insert (op =) v | _ => I); |
519 |
val add_tvars = fold_types add_tvarsT; |
|
29257
660234d959f7
provide canonical add_tvar_namesT, add_tvar_names, add_tfree_namesT, add_tfree_names, add_free_names;
wenzelm
parents:
29256
diff
changeset
|
520 |
val add_var_names = fold_aterms (fn Var (xi, _) => insert (op =) xi | _ => I); |
16943 | 521 |
val add_vars = fold_aterms (fn Var v => insert (op =) v | _ => I); |
33697 | 522 |
val add_tfree_namesT = fold_atyps (fn TFree (a, _) => insert (op =) a | _ => I); |
29257
660234d959f7
provide canonical add_tvar_namesT, add_tvar_names, add_tfree_namesT, add_tfree_names, add_free_names;
wenzelm
parents:
29256
diff
changeset
|
523 |
val add_tfree_names = fold_types add_tfree_namesT; |
16943 | 524 |
val add_tfreesT = fold_atyps (fn TFree v => insert (op =) v | _ => I); |
525 |
val add_tfrees = fold_types add_tfreesT; |
|
29257
660234d959f7
provide canonical add_tvar_namesT, add_tvar_names, add_tfree_namesT, add_tfree_names, add_free_names;
wenzelm
parents:
29256
diff
changeset
|
526 |
val add_free_names = fold_aterms (fn Free (x, _) => insert (op =) x | _ => I); |
16943 | 527 |
val add_frees = fold_aterms (fn Free v => insert (op =) v | _ => I); |
29286 | 528 |
val add_const_names = fold_aterms (fn Const (c, _) => insert (op =) c | _ => I); |
529 |
val add_consts = fold_aterms (fn Const c => insert (op =) c | _ => I); |
|
16943 | 530 |
|
25050 | 531 |
(*extra type variables in a term, not covered by its type*) |
532 |
fun hidden_polymorphism t = |
|
21682 | 533 |
let |
25050 | 534 |
val T = fastype_of t; |
21682 | 535 |
val tvarsT = add_tvarsT T []; |
536 |
val extra_tvars = fold_types (fold_atyps |
|
537 |
(fn TVar v => if member (op =) tvarsT v then I else insert (op =) v | _ => I)) t []; |
|
538 |
in extra_tvars end; |
|
539 |
||
16943 | 540 |
|
29278 | 541 |
(* renaming variables *) |
542 |
||
543 |
val declare_typ_names = fold_atyps (fn TFree (a, _) => Name.declare a | _ => I); |
|
544 |
||
545 |
fun declare_term_names tm = |
|
546 |
fold_aterms |
|
30364
577edc39b501
moved basic algebra of long names from structure NameSpace to Long_Name;
wenzelm
parents:
30285
diff
changeset
|
547 |
(fn Const (a, _) => Name.declare (Long_Name.base_name a) |
29278 | 548 |
| Free (a, _) => Name.declare a |
549 |
| _ => I) tm #> |
|
550 |
fold_types declare_typ_names tm; |
|
551 |
||
552 |
val declare_term_frees = fold_aterms (fn Free (x, _) => Name.declare x | _ => I); |
|
553 |
||
554 |
fun variant_frees t frees = |
|
43326
47cf4bc789aa
simplified Name.variant -- discontinued builtin fold_map;
wenzelm
parents:
43324
diff
changeset
|
555 |
fst (fold_map Name.variant (map fst frees) (declare_term_names t Name.context)) ~~ |
47cf4bc789aa
simplified Name.variant -- discontinued builtin fold_map;
wenzelm
parents:
43324
diff
changeset
|
556 |
map snd frees; |
29278 | 557 |
|
558 |
fun rename_wrt_term t frees = rev (variant_frees t frees); (*reversed result!*) |
|
559 |
||
560 |
||
25050 | 561 |
|
29269
5c25a2012975
moved term order operations to structure TermOrd (cf. Pure/term_ord.ML);
wenzelm
parents:
29265
diff
changeset
|
562 |
(** Comparing terms **) |
5c25a2012975
moved term order operations to structure TermOrd (cf. Pure/term_ord.ML);
wenzelm
parents:
29265
diff
changeset
|
563 |
|
5c25a2012975
moved term order operations to structure TermOrd (cf. Pure/term_ord.ML);
wenzelm
parents:
29265
diff
changeset
|
564 |
(* variables *) |
5c25a2012975
moved term order operations to structure TermOrd (cf. Pure/term_ord.ML);
wenzelm
parents:
29265
diff
changeset
|
565 |
|
5c25a2012975
moved term order operations to structure TermOrd (cf. Pure/term_ord.ML);
wenzelm
parents:
29265
diff
changeset
|
566 |
fun eq_ix ((x, i): indexname, (y, j)) = i = j andalso x = y; |
16537 | 567 |
|
29269
5c25a2012975
moved term order operations to structure TermOrd (cf. Pure/term_ord.ML);
wenzelm
parents:
29265
diff
changeset
|
568 |
fun eq_tvar ((xi, S: sort), (xi', S')) = eq_ix (xi, xi') andalso S = S'; |
5c25a2012975
moved term order operations to structure TermOrd (cf. Pure/term_ord.ML);
wenzelm
parents:
29265
diff
changeset
|
569 |
fun eq_var ((xi, T: typ), (xi', T')) = eq_ix (xi, xi') andalso T = T'; |
5c25a2012975
moved term order operations to structure TermOrd (cf. Pure/term_ord.ML);
wenzelm
parents:
29265
diff
changeset
|
570 |
|
5c25a2012975
moved term order operations to structure TermOrd (cf. Pure/term_ord.ML);
wenzelm
parents:
29265
diff
changeset
|
571 |
|
5c25a2012975
moved term order operations to structure TermOrd (cf. Pure/term_ord.ML);
wenzelm
parents:
29265
diff
changeset
|
572 |
(* alpha equivalence *) |
20511 | 573 |
|
574 |
fun tm1 aconv tm2 = |
|
575 |
pointer_eq (tm1, tm2) orelse |
|
576 |
(case (tm1, tm2) of |
|
577 |
(t1 $ u1, t2 $ u2) => t1 aconv t2 andalso u1 aconv u2 |
|
578 |
| (Abs (_, T1, t1), Abs (_, T2, t2)) => t1 aconv t2 andalso T1 = T2 |
|
579 |
| (a1, a2) => a1 = a2); |
|
580 |
||
33537
06c87d2c5b5a
locale_const/target_notation: uniform use of Term.aconv_untyped;
wenzelm
parents:
33063
diff
changeset
|
581 |
fun aconv_untyped (tm1, tm2) = |
06c87d2c5b5a
locale_const/target_notation: uniform use of Term.aconv_untyped;
wenzelm
parents:
33063
diff
changeset
|
582 |
pointer_eq (tm1, tm2) orelse |
06c87d2c5b5a
locale_const/target_notation: uniform use of Term.aconv_untyped;
wenzelm
parents:
33063
diff
changeset
|
583 |
(case (tm1, tm2) of |
06c87d2c5b5a
locale_const/target_notation: uniform use of Term.aconv_untyped;
wenzelm
parents:
33063
diff
changeset
|
584 |
(t1 $ u1, t2 $ u2) => aconv_untyped (t1, t2) andalso aconv_untyped (u1, u2) |
06c87d2c5b5a
locale_const/target_notation: uniform use of Term.aconv_untyped;
wenzelm
parents:
33063
diff
changeset
|
585 |
| (Abs (_, _, t1), Abs (_, _, t2)) => aconv_untyped (t1, t2) |
06c87d2c5b5a
locale_const/target_notation: uniform use of Term.aconv_untyped;
wenzelm
parents:
33063
diff
changeset
|
586 |
| (Const (a, _), Const (b, _)) => a = b |
06c87d2c5b5a
locale_const/target_notation: uniform use of Term.aconv_untyped;
wenzelm
parents:
33063
diff
changeset
|
587 |
| (Free (x, _), Free (y, _)) => x = y |
06c87d2c5b5a
locale_const/target_notation: uniform use of Term.aconv_untyped;
wenzelm
parents:
33063
diff
changeset
|
588 |
| (Var (xi, _), Var (yj, _)) => xi = yj |
06c87d2c5b5a
locale_const/target_notation: uniform use of Term.aconv_untyped;
wenzelm
parents:
33063
diff
changeset
|
589 |
| (Bound i, Bound j) => i = j |
06c87d2c5b5a
locale_const/target_notation: uniform use of Term.aconv_untyped;
wenzelm
parents:
33063
diff
changeset
|
590 |
| _ => false); |
06c87d2c5b5a
locale_const/target_notation: uniform use of Term.aconv_untyped;
wenzelm
parents:
33063
diff
changeset
|
591 |
|
20511 | 592 |
|
29269
5c25a2012975
moved term order operations to structure TermOrd (cf. Pure/term_ord.ML);
wenzelm
parents:
29265
diff
changeset
|
593 |
(*A fast unification filter: true unless the two terms cannot be unified. |
5c25a2012975
moved term order operations to structure TermOrd (cf. Pure/term_ord.ML);
wenzelm
parents:
29265
diff
changeset
|
594 |
Terms must be NORMAL. Treats all Vars as distinct. *) |
5c25a2012975
moved term order operations to structure TermOrd (cf. Pure/term_ord.ML);
wenzelm
parents:
29265
diff
changeset
|
595 |
fun could_unify (t, u) = |
5c25a2012975
moved term order operations to structure TermOrd (cf. Pure/term_ord.ML);
wenzelm
parents:
29265
diff
changeset
|
596 |
let |
5c25a2012975
moved term order operations to structure TermOrd (cf. Pure/term_ord.ML);
wenzelm
parents:
29265
diff
changeset
|
597 |
fun matchrands (f $ t) (g $ u) = could_unify (t, u) andalso matchrands f g |
5c25a2012975
moved term order operations to structure TermOrd (cf. Pure/term_ord.ML);
wenzelm
parents:
29265
diff
changeset
|
598 |
| matchrands _ _ = true; |
5c25a2012975
moved term order operations to structure TermOrd (cf. Pure/term_ord.ML);
wenzelm
parents:
29265
diff
changeset
|
599 |
in |
5c25a2012975
moved term order operations to structure TermOrd (cf. Pure/term_ord.ML);
wenzelm
parents:
29265
diff
changeset
|
600 |
case (head_of t, head_of u) of |
5c25a2012975
moved term order operations to structure TermOrd (cf. Pure/term_ord.ML);
wenzelm
parents:
29265
diff
changeset
|
601 |
(_, Var _) => true |
5c25a2012975
moved term order operations to structure TermOrd (cf. Pure/term_ord.ML);
wenzelm
parents:
29265
diff
changeset
|
602 |
| (Var _, _) => true |
5c25a2012975
moved term order operations to structure TermOrd (cf. Pure/term_ord.ML);
wenzelm
parents:
29265
diff
changeset
|
603 |
| (Const (a, _), Const (b, _)) => a = b andalso matchrands t u |
5c25a2012975
moved term order operations to structure TermOrd (cf. Pure/term_ord.ML);
wenzelm
parents:
29265
diff
changeset
|
604 |
| (Free (a, _), Free (b, _)) => a = b andalso matchrands t u |
5c25a2012975
moved term order operations to structure TermOrd (cf. Pure/term_ord.ML);
wenzelm
parents:
29265
diff
changeset
|
605 |
| (Bound i, Bound j) => i = j andalso matchrands t u |
5c25a2012975
moved term order operations to structure TermOrd (cf. Pure/term_ord.ML);
wenzelm
parents:
29265
diff
changeset
|
606 |
| (Abs _, _) => true (*because of possible eta equality*) |
5c25a2012975
moved term order operations to structure TermOrd (cf. Pure/term_ord.ML);
wenzelm
parents:
29265
diff
changeset
|
607 |
| (_, Abs _) => true |
5c25a2012975
moved term order operations to structure TermOrd (cf. Pure/term_ord.ML);
wenzelm
parents:
29265
diff
changeset
|
608 |
| _ => false |
5c25a2012975
moved term order operations to structure TermOrd (cf. Pure/term_ord.ML);
wenzelm
parents:
29265
diff
changeset
|
609 |
end; |
16678 | 610 |
|
16570 | 611 |
|
16537 | 612 |
|
0 | 613 |
(** Connectives of higher order logic **) |
614 |
||
24850 | 615 |
fun aT S = TFree (Name.aT, S); |
19394 | 616 |
|
375 | 617 |
fun itselfT ty = Type ("itself", [ty]); |
24850 | 618 |
val a_itselfT = itselfT (TFree (Name.aT, [])); |
375 | 619 |
|
46217
7b19666f0e3d
renamed Term.all to Logic.all_const, in accordance to HOLogic.all_const;
wenzelm
parents:
46215
diff
changeset
|
620 |
val propT : typ = Type ("prop",[]); |
0 | 621 |
|
67721 | 622 |
(*maps \<And>x1...xn. t to t*) |
60311 | 623 |
fun strip_all_body (Const ("Pure.all", _) $ Abs (_, _, t)) = strip_all_body t |
624 |
| strip_all_body t = t; |
|
0 | 625 |
|
67721 | 626 |
(*maps \<And>x1...xn. t to [x1, ..., xn]*) |
60311 | 627 |
fun strip_all_vars (Const ("Pure.all", _) $ Abs (a, T, t)) = (a, T) :: strip_all_vars t |
628 |
| strip_all_vars t = []; |
|
0 | 629 |
|
630 |
(*increments a term's non-local bound variables |
|
631 |
required when moving a term within abstractions |
|
632 |
inc is increment for bound variables |
|
633 |
lev is level at which a bound variable is considered 'loose'*) |
|
79172
0bea00f77ba3
minor performance tuning: regular Same.operation;
wenzelm
parents:
79170
diff
changeset
|
634 |
fun incr_bv_same inc = |
0bea00f77ba3
minor performance tuning: regular Same.operation;
wenzelm
parents:
79170
diff
changeset
|
635 |
if inc = 0 then fn _ => Same.same |
0bea00f77ba3
minor performance tuning: regular Same.operation;
wenzelm
parents:
79170
diff
changeset
|
636 |
else |
0bea00f77ba3
minor performance tuning: regular Same.operation;
wenzelm
parents:
79170
diff
changeset
|
637 |
let |
0bea00f77ba3
minor performance tuning: regular Same.operation;
wenzelm
parents:
79170
diff
changeset
|
638 |
fun term lev (Bound i) = if i >= lev then Bound (i + inc) else raise Same.SAME |
0bea00f77ba3
minor performance tuning: regular Same.operation;
wenzelm
parents:
79170
diff
changeset
|
639 |
| term lev (Abs (a, T, t)) = Abs (a, T, term (lev + 1) t) |
0bea00f77ba3
minor performance tuning: regular Same.operation;
wenzelm
parents:
79170
diff
changeset
|
640 |
| term lev (t $ u) = |
0bea00f77ba3
minor performance tuning: regular Same.operation;
wenzelm
parents:
79170
diff
changeset
|
641 |
(term lev t $ Same.commit (term lev) u handle Same.SAME => |
0bea00f77ba3
minor performance tuning: regular Same.operation;
wenzelm
parents:
79170
diff
changeset
|
642 |
t $ term lev u) |
0bea00f77ba3
minor performance tuning: regular Same.operation;
wenzelm
parents:
79170
diff
changeset
|
643 |
| term _ _ = raise Same.SAME; |
0bea00f77ba3
minor performance tuning: regular Same.operation;
wenzelm
parents:
79170
diff
changeset
|
644 |
in term end; |
0 | 645 |
|
79172
0bea00f77ba3
minor performance tuning: regular Same.operation;
wenzelm
parents:
79170
diff
changeset
|
646 |
fun incr_bv inc lev = Same.commit (incr_bv_same inc lev); |
0bea00f77ba3
minor performance tuning: regular Same.operation;
wenzelm
parents:
79170
diff
changeset
|
647 |
|
0bea00f77ba3
minor performance tuning: regular Same.operation;
wenzelm
parents:
79170
diff
changeset
|
648 |
fun incr_boundvars inc = incr_bv inc 0; |
0 | 649 |
|
12981 | 650 |
(*Scan a pair of terms; while they are similar, |
651 |
accumulate corresponding bound vars in "al"*) |
|
652 |
fun match_bvs(Abs(x,_,s),Abs(y,_,t), al) = |
|
653 |
match_bvs(s, t, if x="" orelse y="" then al |
|
654 |
else (x,y)::al) |
|
655 |
| match_bvs(f$s, g$t, al) = match_bvs(f,g,match_bvs(s,t,al)) |
|
656 |
| match_bvs(_,_,al) = al; |
|
657 |
||
658 |
(* strip abstractions created by parameters *) |
|
48263 | 659 |
fun match_bvars (s,t) al = match_bvs(strip_abs_body s, strip_abs_body t, al); |
12981 | 660 |
|
22031 | 661 |
fun map_abs_vars f (t $ u) = map_abs_vars f t $ map_abs_vars f u |
662 |
| map_abs_vars f (Abs (a, T, t)) = Abs (f a, T, map_abs_vars f t) |
|
663 |
| map_abs_vars f t = t; |
|
664 |
||
12981 | 665 |
fun rename_abs pat obj t = |
666 |
let |
|
667 |
val ren = match_bvs (pat, obj, []); |
|
668 |
fun ren_abs (Abs (x, T, b)) = |
|
18942 | 669 |
Abs (the_default x (AList.lookup (op =) ren x), T, ren_abs b) |
12981 | 670 |
| ren_abs (f $ t) = ren_abs f $ ren_abs t |
671 |
| ren_abs t = t |
|
15531 | 672 |
in if null ren then NONE else SOME (ren_abs t) end; |
0 | 673 |
|
674 |
(*Accumulate all 'loose' bound vars referring to level 'lev' or beyond. |
|
675 |
(Bound 0) is loose at level 0 *) |
|
13000 | 676 |
fun add_loose_bnos (Bound i, lev, js) = |
20854 | 677 |
if i<lev then js else insert (op =) (i - lev) js |
0 | 678 |
| add_loose_bnos (Abs (_,_,t), lev, js) = add_loose_bnos (t, lev+1, js) |
679 |
| add_loose_bnos (f$t, lev, js) = |
|
13000 | 680 |
add_loose_bnos (f, lev, add_loose_bnos (t, lev, js)) |
0 | 681 |
| add_loose_bnos (_, _, js) = js; |
682 |
||
683 |
fun loose_bnos t = add_loose_bnos (t, 0, []); |
|
684 |
||
685 |
(* loose_bvar(t,k) iff t contains a 'loose' bound variable referring to |
|
686 |
level k or beyond. *) |
|
687 |
fun loose_bvar(Bound i,k) = i >= k |
|
688 |
| loose_bvar(f$t, k) = loose_bvar(f,k) orelse loose_bvar(t,k) |
|
689 |
| loose_bvar(Abs(_,_,t),k) = loose_bvar(t,k+1) |
|
690 |
| loose_bvar _ = false; |
|
691 |
||
2792 | 692 |
fun loose_bvar1(Bound i,k) = i = k |
693 |
| loose_bvar1(f$t, k) = loose_bvar1(f,k) orelse loose_bvar1(t,k) |
|
694 |
| loose_bvar1(Abs(_,_,t),k) = loose_bvar1(t,k+1) |
|
695 |
| loose_bvar1 _ = false; |
|
0 | 696 |
|
42083
e1209fc7ecdc
added Term.is_open and Term.is_dependent convenience, to cover common situations of loose bounds;
wenzelm
parents:
40844
diff
changeset
|
697 |
fun is_open t = loose_bvar (t, 0); |
e1209fc7ecdc
added Term.is_open and Term.is_dependent convenience, to cover common situations of loose bounds;
wenzelm
parents:
40844
diff
changeset
|
698 |
fun is_dependent t = loose_bvar1 (t, 0); |
e1209fc7ecdc
added Term.is_open and Term.is_dependent convenience, to cover common situations of loose bounds;
wenzelm
parents:
40844
diff
changeset
|
699 |
|
0 | 700 |
(*Substitute arguments for loose bound variables. |
701 |
Beta-reduction of arg(n-1)...arg0 into t replacing (Bound i) with (argi). |
|
67721 | 702 |
Note that for ((\<lambda>x y. c) a b), the bound vars in c are x=1 and y=0 |
9536
b79b002f32ae
added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents:
9319
diff
changeset
|
703 |
and the appropriate call is subst_bounds([b,a], c) . |
0 | 704 |
Loose bound variables >=n are reduced by "n" to |
705 |
compensate for the disappearance of lambdas. |
|
706 |
*) |
|
79168 | 707 |
fun subst_bounds (args: term list, tm) : term = |
19065 | 708 |
let |
709 |
val n = length args; |
|
79168 | 710 |
fun term lev (Bound i) = |
32020 | 711 |
(if i < lev then raise Same.SAME (*var is locally bound*) |
30146 | 712 |
else incr_boundvars lev (nth args (i - lev)) |
43278 | 713 |
handle General.Subscript => Bound (i - n)) (*loose: change it*) |
79168 | 714 |
| term lev (Abs (a, T, t)) = Abs (a, T, term (lev + 1) t) |
715 |
| term lev (t $ u) = |
|
716 |
(term lev t $ Same.commit (term lev) u |
|
717 |
handle Same.SAME => t $ term lev u) |
|
718 |
| term _ _ = raise Same.SAME; |
|
719 |
in if null args then tm else Same.commit (term 0) tm end; |
|
0 | 720 |
|
2192
3bf092b5310b
Optimizations: removal of polymorphic equality; one-argument case
paulson
parents:
2182
diff
changeset
|
721 |
(*Special case: one argument*) |
79168 | 722 |
fun subst_bound (arg, tm) : term = |
19065 | 723 |
let |
79168 | 724 |
fun term lev (Bound i) = |
32020 | 725 |
if i < lev then raise Same.SAME (*var is locally bound*) |
19065 | 726 |
else if i = lev then incr_boundvars lev arg |
727 |
else Bound (i - 1) (*loose: change it*) |
|
79168 | 728 |
| term lev (Abs (a, T, t)) = Abs (a, T, term (lev + 1) t) |
729 |
| term lev (t $ u) = |
|
730 |
(term lev t $ Same.commit (term lev) u |
|
731 |
handle Same.SAME => t $ term lev u) |
|
732 |
| term _ _ = raise Same.SAME; |
|
733 |
in term 0 tm handle Same.SAME => tm end; |
|
2192
3bf092b5310b
Optimizations: removal of polymorphic equality; one-argument case
paulson
parents:
2182
diff
changeset
|
734 |
|
0 | 735 |
(*beta-reduce if possible, else form application*) |
2192
3bf092b5310b
Optimizations: removal of polymorphic equality; one-argument case
paulson
parents:
2182
diff
changeset
|
736 |
fun betapply (Abs(_,_,t), u) = subst_bound (u,t) |
0 | 737 |
| betapply (f,u) = f$u; |
738 |
||
18183 | 739 |
val betapplys = Library.foldl betapply; |
740 |
||
14786
24a7bc97a27a
moved some sort ops to sorts.ML; added string_of_vname (from Syntax module);
wenzelm
parents:
14695
diff
changeset
|
741 |
|
20109 | 742 |
(*unfolding abstractions with substitution |
743 |
of bound variables and implicit eta-expansion*) |
|
744 |
fun strip_abs_eta k t = |
|
745 |
let |
|
29278 | 746 |
val used = fold_aterms declare_term_frees t Name.context; |
20109 | 747 |
fun strip_abs t (0, used) = (([], t), (0, used)) |
748 |
| strip_abs (Abs (v, T, t)) (k, used) = |
|
749 |
let |
|
43326
47cf4bc789aa
simplified Name.variant -- discontinued builtin fold_map;
wenzelm
parents:
43324
diff
changeset
|
750 |
val (v', used') = Name.variant v used; |
21013 | 751 |
val t' = subst_bound (Free (v', T), t); |
20122 | 752 |
val ((vs, t''), (k', used'')) = strip_abs t' (k - 1, used'); |
753 |
in (((v', T) :: vs, t''), (k', used'')) end |
|
20109 | 754 |
| strip_abs t (k, used) = (([], t), (k, used)); |
755 |
fun expand_eta [] t _ = ([], t) |
|
756 |
| expand_eta (T::Ts) t used = |
|
757 |
let |
|
43326
47cf4bc789aa
simplified Name.variant -- discontinued builtin fold_map;
wenzelm
parents:
43324
diff
changeset
|
758 |
val (v, used') = Name.variant "" used; |
20122 | 759 |
val (vs, t') = expand_eta Ts (t $ Free (v, T)) used'; |
20109 | 760 |
in ((v, T) :: vs, t') end; |
761 |
val ((vs1, t'), (k', used')) = strip_abs t (k, used); |
|
40844 | 762 |
val Ts = fst (chop k' (binder_types (fastype_of t'))); |
20109 | 763 |
val (vs2, t'') = expand_eta Ts t' used'; |
764 |
in (vs1 @ vs2, t'') end; |
|
765 |
||
766 |
||
0 | 767 |
(*Substitute new for free occurrences of old in a term*) |
29256 | 768 |
fun subst_free [] = I |
0 | 769 |
| subst_free pairs = |
13000 | 770 |
let fun substf u = |
17314 | 771 |
case AList.lookup (op aconv) pairs u of |
15531 | 772 |
SOME u' => u' |
773 |
| NONE => (case u of Abs(a,T,t) => Abs(a, T, substf t) |
|
9536
b79b002f32ae
added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents:
9319
diff
changeset
|
774 |
| t$u' => substf t $ substf u' |
b79b002f32ae
added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents:
9319
diff
changeset
|
775 |
| _ => u) |
0 | 776 |
in substf end; |
777 |
||
13000 | 778 |
(*Abstraction of the term "body" over its occurrences of v, |
0 | 779 |
which must contain no loose bound variables. |
780 |
The resulting term is ready to become the body of an Abs.*) |
|
16882 | 781 |
fun abstract_over (v, body) = |
782 |
let |
|
16990 | 783 |
fun abs lev tm = |
784 |
if v aconv tm then Bound lev |
|
16882 | 785 |
else |
16990 | 786 |
(case tm of |
787 |
Abs (a, T, t) => Abs (a, T, abs (lev + 1) t) |
|
32020 | 788 |
| t $ u => |
789 |
(abs lev t $ (abs lev u handle Same.SAME => u) |
|
790 |
handle Same.SAME => t $ abs lev u) |
|
791 |
| _ => raise Same.SAME); |
|
792 |
in abs 0 body handle Same.SAME => body end; |
|
0 | 793 |
|
32198 | 794 |
fun term_name (Const (x, _)) = Long_Name.base_name x |
795 |
| term_name (Free (x, _)) = x |
|
796 |
| term_name (Var ((x, _), _)) = x |
|
797 |
| term_name _ = Name.uu; |
|
798 |
||
60404
422b63ef0147
clarified abstracted term bindings (again, see c8384ff11711);
wenzelm
parents:
60311
diff
changeset
|
799 |
fun dependent_lambda_name (x, v) t = |
422b63ef0147
clarified abstracted term bindings (again, see c8384ff11711);
wenzelm
parents:
60311
diff
changeset
|
800 |
let val t' = abstract_over (v, t) |
422b63ef0147
clarified abstracted term bindings (again, see c8384ff11711);
wenzelm
parents:
60311
diff
changeset
|
801 |
in if is_dependent t' then Abs (if x = "" then term_name v else x, fastype_of v, t') else t end; |
422b63ef0147
clarified abstracted term bindings (again, see c8384ff11711);
wenzelm
parents:
60311
diff
changeset
|
802 |
|
32198 | 803 |
fun lambda_name (x, v) t = |
804 |
Abs (if x = "" then term_name v else x, fastype_of v, abstract_over (v, t)); |
|
805 |
||
806 |
fun lambda v t = lambda_name ("", v) t; |
|
0 | 807 |
|
44241 | 808 |
fun absfree (a, T) body = Abs (a, T, abstract_over (Free (a, T), body)); |
809 |
fun absdummy T body = Abs (Name.uu_, T, body); |
|
0 | 810 |
|
16678 | 811 |
(*Replace the ATOMIC term ti by ui; inst = [(t1,u1), ..., (tn,un)]. |
0 | 812 |
A simultaneous substitution: [ (a,b), (b,a) ] swaps a and b. *) |
16678 | 813 |
fun subst_atomic [] tm = tm |
814 |
| subst_atomic inst tm = |
|
815 |
let |
|
816 |
fun subst (Abs (a, T, body)) = Abs (a, T, subst body) |
|
817 |
| subst (t $ u) = subst t $ subst u |
|
18942 | 818 |
| subst t = the_default t (AList.lookup (op aconv) inst t); |
16678 | 819 |
in subst tm end; |
0 | 820 |
|
16678 | 821 |
(*Replace the ATOMIC type Ti by Ui; inst = [(T1,U1), ..., (Tn,Un)].*) |
822 |
fun typ_subst_atomic [] ty = ty |
|
823 |
| typ_subst_atomic inst ty = |
|
824 |
let |
|
825 |
fun subst (Type (a, Ts)) = Type (a, map subst Ts) |
|
18942 | 826 |
| subst T = the_default T (AList.lookup (op = : typ * typ -> bool) inst T); |
16678 | 827 |
in subst ty end; |
15797 | 828 |
|
16678 | 829 |
fun subst_atomic_types [] tm = tm |
20548
8ef25fe585a8
renamed Term.map_term_types to Term.map_types (cf. Term.fold_types);
wenzelm
parents:
20531
diff
changeset
|
830 |
| subst_atomic_types inst tm = map_types (typ_subst_atomic inst) tm; |
16678 | 831 |
|
832 |
fun typ_subst_TVars [] ty = ty |
|
833 |
| typ_subst_TVars inst ty = |
|
834 |
let |
|
835 |
fun subst (Type (a, Ts)) = Type (a, map subst Ts) |
|
18942 | 836 |
| subst (T as TVar (xi, _)) = the_default T (AList.lookup (op =) inst xi) |
16678 | 837 |
| subst T = T; |
838 |
in subst ty end; |
|
0 | 839 |
|
16678 | 840 |
fun subst_TVars [] tm = tm |
20548
8ef25fe585a8
renamed Term.map_term_types to Term.map_types (cf. Term.fold_types);
wenzelm
parents:
20531
diff
changeset
|
841 |
| subst_TVars inst tm = map_types (typ_subst_TVars inst) tm; |
0 | 842 |
|
16678 | 843 |
fun subst_Vars [] tm = tm |
844 |
| subst_Vars inst tm = |
|
845 |
let |
|
18942 | 846 |
fun subst (t as Var (xi, _)) = the_default t (AList.lookup (op =) inst xi) |
16678 | 847 |
| subst (Abs (a, T, t)) = Abs (a, T, subst t) |
848 |
| subst (t $ u) = subst t $ subst u |
|
849 |
| subst t = t; |
|
850 |
in subst tm end; |
|
0 | 851 |
|
16678 | 852 |
fun subst_vars ([], []) tm = tm |
853 |
| subst_vars ([], inst) tm = subst_Vars inst tm |
|
854 |
| subst_vars (instT, inst) tm = |
|
855 |
let |
|
856 |
fun subst (Const (a, T)) = Const (a, typ_subst_TVars instT T) |
|
857 |
| subst (Free (a, T)) = Free (a, typ_subst_TVars instT T) |
|
32784 | 858 |
| subst (Var (xi, T)) = |
17271 | 859 |
(case AList.lookup (op =) inst xi of |
16678 | 860 |
NONE => Var (xi, typ_subst_TVars instT T) |
861 |
| SOME t => t) |
|
862 |
| subst (t as Bound _) = t |
|
863 |
| subst (Abs (a, T, t)) = Abs (a, typ_subst_TVars instT T, subst t) |
|
864 |
| subst (t $ u) = subst t $ subst u; |
|
865 |
in subst tm end; |
|
0 | 866 |
|
25050 | 867 |
fun close_schematic_term t = |
868 |
let |
|
56243 | 869 |
val extra_types = map (fn v => Const ("Pure.type", itselfT (TVar v))) (hidden_polymorphism t); |
30285
a135bfab6e83
close_schematic_term: uniform order of types/terms;
wenzelm
parents:
30280
diff
changeset
|
870 |
val extra_terms = map Var (add_vars t []); |
a135bfab6e83
close_schematic_term: uniform order of types/terms;
wenzelm
parents:
30280
diff
changeset
|
871 |
in fold lambda (extra_terms @ extra_types) t end; |
25050 | 872 |
|
873 |
||
0 | 874 |
|
15573 | 875 |
(** Identifying first-order terms **) |
876 |
||
20199 | 877 |
(*Differs from proofterm/is_fun in its treatment of TVar*) |
29256 | 878 |
fun is_funtype (Type ("fun", [_, _])) = true |
20199 | 879 |
| is_funtype _ = false; |
880 |
||
15573 | 881 |
(*Argument Ts is a reverse list of binder types, needed if term t contains Bound vars*) |
29256 | 882 |
fun has_not_funtype Ts t = not (is_funtype (fastype_of1 (Ts, t))); |
15573 | 883 |
|
16537 | 884 |
(*First order means in all terms of the form f(t1,...,tn) no argument has a |
16589 | 885 |
function type. The supplied quantifiers are excluded: their argument always |
886 |
has a function type through a recursive call into its body.*) |
|
16667 | 887 |
fun is_first_order quants = |
16589 | 888 |
let fun first_order1 Ts (Abs (_,T,body)) = first_order1 (T::Ts) body |
16667 | 889 |
| first_order1 Ts (Const(q,_) $ Abs(a,T,body)) = |
20664 | 890 |
member (op =) quants q andalso (*it is a known quantifier*) |
16589 | 891 |
not (is_funtype T) andalso first_order1 (T::Ts) body |
16667 | 892 |
| first_order1 Ts t = |
893 |
case strip_comb t of |
|
894 |
(Var _, ts) => forall (first_order1 Ts andf has_not_funtype Ts) ts |
|
895 |
| (Free _, ts) => forall (first_order1 Ts andf has_not_funtype Ts) ts |
|
896 |
| (Const _, ts) => forall (first_order1 Ts andf has_not_funtype Ts) ts |
|
897 |
| (Bound _, ts) => forall (first_order1 Ts andf has_not_funtype Ts) ts |
|
898 |
| (Abs _, ts) => false (*not in beta-normal form*) |
|
899 |
| _ => error "first_order: unexpected case" |
|
16589 | 900 |
in first_order1 [] end; |
15573 | 901 |
|
16710 | 902 |
|
16990 | 903 |
(* maximum index of typs and terms *) |
0 | 904 |
|
16710 | 905 |
fun maxidx_typ (TVar ((_, j), _)) i = Int.max (i, j) |
906 |
| maxidx_typ (Type (_, Ts)) i = maxidx_typs Ts i |
|
907 |
| maxidx_typ (TFree _) i = i |
|
908 |
and maxidx_typs [] i = i |
|
909 |
| maxidx_typs (T :: Ts) i = maxidx_typs Ts (maxidx_typ T i); |
|
0 | 910 |
|
16710 | 911 |
fun maxidx_term (Var ((_, j), T)) i = maxidx_typ T (Int.max (i, j)) |
912 |
| maxidx_term (Const (_, T)) i = maxidx_typ T i |
|
913 |
| maxidx_term (Free (_, T)) i = maxidx_typ T i |
|
914 |
| maxidx_term (Bound _) i = i |
|
915 |
| maxidx_term (Abs (_, T, t)) i = maxidx_term t (maxidx_typ T i) |
|
916 |
| maxidx_term (t $ u) i = maxidx_term u (maxidx_term t i); |
|
0 | 917 |
|
16710 | 918 |
fun maxidx_of_typ T = maxidx_typ T ~1; |
919 |
fun maxidx_of_typs Ts = maxidx_typs Ts ~1; |
|
920 |
fun maxidx_of_term t = maxidx_term t ~1; |
|
13665 | 921 |
|
0 | 922 |
|
923 |
||
29270
0eade173f77e
moved old add_type_XXX, add_term_XXX etc. to structure OldTerm;
wenzelm
parents:
29269
diff
changeset
|
924 |
(** misc syntax operations **) |
0 | 925 |
|
19909 | 926 |
(* substructure *) |
4017
63878e2587a7
add_typ_classes, add_typ_tycons, add_term_classes, add_term_tycons,
wenzelm
parents:
3965
diff
changeset
|
927 |
|
61248 | 928 |
fun fold_subtypes f = |
929 |
let |
|
930 |
fun iter ty = |
|
931 |
(case ty of Type (_, Ts) => f ty #> fold iter Ts | _ => f ty); |
|
932 |
in iter end; |
|
933 |
||
19909 | 934 |
fun exists_subtype P = |
935 |
let |
|
936 |
fun ex ty = P ty orelse |
|
937 |
(case ty of Type (_, Ts) => exists ex Ts | _ => false); |
|
938 |
in ex end; |
|
13646 | 939 |
|
20531 | 940 |
fun exists_type P = |
941 |
let |
|
942 |
fun ex (Const (_, T)) = P T |
|
943 |
| ex (Free (_, T)) = P T |
|
944 |
| ex (Var (_, T)) = P T |
|
945 |
| ex (Bound _) = false |
|
946 |
| ex (Abs (_, T, t)) = P T orelse ex t |
|
947 |
| ex (t $ u) = ex t orelse ex u; |
|
948 |
in ex end; |
|
949 |
||
16943 | 950 |
fun exists_subterm P = |
951 |
let |
|
952 |
fun ex tm = P tm orelse |
|
953 |
(case tm of |
|
954 |
t $ u => ex t orelse ex u |
|
955 |
| Abs (_, _, t) => ex t |
|
956 |
| _ => false); |
|
957 |
in ex end; |
|
16108
cf468b93a02e
Implement cycle-free overloading, so that definitions cannot harm consistency any more (except of course via interaction with axioms).
obua
parents:
16035
diff
changeset
|
958 |
|
29270
0eade173f77e
moved old add_type_XXX, add_term_XXX etc. to structure OldTerm;
wenzelm
parents:
29269
diff
changeset
|
959 |
fun exists_Const P = exists_subterm (fn Const c => P c | _ => false); |
0eade173f77e
moved old add_type_XXX, add_term_XXX etc. to structure OldTerm;
wenzelm
parents:
29269
diff
changeset
|
960 |
|
76047 | 961 |
fun is_schematic t = |
962 |
exists_subterm is_Var t orelse |
|
963 |
(exists_type o exists_subtype) is_TVar t; |
|
964 |
||
63619 | 965 |
|
966 |
(* contraction *) |
|
967 |
||
968 |
fun could_beta_contract (Abs _ $ _) = true |
|
969 |
| could_beta_contract (t $ u) = could_beta_contract t orelse could_beta_contract u |
|
970 |
| could_beta_contract (Abs (_, _, b)) = could_beta_contract b |
|
971 |
| could_beta_contract _ = false; |
|
972 |
||
973 |
fun could_eta_contract (Abs (_, _, _ $ Bound 0)) = true |
|
974 |
| could_eta_contract (Abs (_, _, b)) = could_eta_contract b |
|
975 |
| could_eta_contract (t $ u) = could_eta_contract t orelse could_eta_contract u |
|
976 |
| could_eta_contract _ = false; |
|
977 |
||
978 |
fun could_beta_eta_contract (Abs _ $ _) = true |
|
979 |
| could_beta_eta_contract (Abs (_, _, _ $ Bound 0)) = true |
|
980 |
| could_beta_eta_contract (Abs (_, _, b)) = could_beta_eta_contract b |
|
981 |
| could_beta_eta_contract (t $ u) = could_beta_eta_contract t orelse could_beta_eta_contract u |
|
982 |
| could_beta_eta_contract _ = false; |
|
24671 | 983 |
|
984 |
||
20199 | 985 |
(* dest abstraction *) |
0 | 986 |
|
74525
c960bfcb91db
discontinued Term.dest_abs / Logic.dest_all, which are officially superseded by Variable.dest_abs etc., but there are also Term.dest_abs_global to recover existing tools easily;
wenzelm
parents:
74446
diff
changeset
|
987 |
(*ASSUMPTION: x is fresh wrt. the current context, but the check |
c960bfcb91db
discontinued Term.dest_abs / Logic.dest_all, which are officially superseded by Variable.dest_abs etc., but there are also Term.dest_abs_global to recover existing tools easily;
wenzelm
parents:
74446
diff
changeset
|
988 |
of used_free merely guards against gross mistakes*) |
c960bfcb91db
discontinued Term.dest_abs / Logic.dest_all, which are officially superseded by Variable.dest_abs etc., but there are also Term.dest_abs_global to recover existing tools easily;
wenzelm
parents:
74446
diff
changeset
|
989 |
|
74407 | 990 |
fun used_free x = |
16678 | 991 |
let |
74407 | 992 |
fun used (Free (y, _)) = (x = y) |
993 |
| used (t $ u) = used t orelse used u |
|
994 |
| used (Abs (_, _, t)) = used t |
|
995 |
| used _ = false; |
|
996 |
in used end; |
|
997 |
||
74525
c960bfcb91db
discontinued Term.dest_abs / Logic.dest_all, which are officially superseded by Variable.dest_abs etc., but there are also Term.dest_abs_global to recover existing tools easily;
wenzelm
parents:
74446
diff
changeset
|
998 |
exception USED_FREE of string * term; |
c960bfcb91db
discontinued Term.dest_abs / Logic.dest_all, which are officially superseded by Variable.dest_abs etc., but there are also Term.dest_abs_global to recover existing tools easily;
wenzelm
parents:
74446
diff
changeset
|
999 |
|
c960bfcb91db
discontinued Term.dest_abs / Logic.dest_all, which are officially superseded by Variable.dest_abs etc., but there are also Term.dest_abs_global to recover existing tools easily;
wenzelm
parents:
74446
diff
changeset
|
1000 |
fun subst_abs v b = (v, subst_bound (Free v, b)); |
c960bfcb91db
discontinued Term.dest_abs / Logic.dest_all, which are officially superseded by Variable.dest_abs etc., but there are also Term.dest_abs_global to recover existing tools easily;
wenzelm
parents:
74446
diff
changeset
|
1001 |
|
c960bfcb91db
discontinued Term.dest_abs / Logic.dest_all, which are officially superseded by Variable.dest_abs etc., but there are also Term.dest_abs_global to recover existing tools easily;
wenzelm
parents:
74446
diff
changeset
|
1002 |
fun dest_abs_fresh x t = |
c960bfcb91db
discontinued Term.dest_abs / Logic.dest_all, which are officially superseded by Variable.dest_abs etc., but there are also Term.dest_abs_global to recover existing tools easily;
wenzelm
parents:
74446
diff
changeset
|
1003 |
(case t of |
c960bfcb91db
discontinued Term.dest_abs / Logic.dest_all, which are officially superseded by Variable.dest_abs etc., but there are also Term.dest_abs_global to recover existing tools easily;
wenzelm
parents:
74446
diff
changeset
|
1004 |
Abs (_, T, b) => |
c960bfcb91db
discontinued Term.dest_abs / Logic.dest_all, which are officially superseded by Variable.dest_abs etc., but there are also Term.dest_abs_global to recover existing tools easily;
wenzelm
parents:
74446
diff
changeset
|
1005 |
if used_free x b then raise USED_FREE (x, t) |
c960bfcb91db
discontinued Term.dest_abs / Logic.dest_all, which are officially superseded by Variable.dest_abs etc., but there are also Term.dest_abs_global to recover existing tools easily;
wenzelm
parents:
74446
diff
changeset
|
1006 |
else subst_abs (x, T) b |
c960bfcb91db
discontinued Term.dest_abs / Logic.dest_all, which are officially superseded by Variable.dest_abs etc., but there are also Term.dest_abs_global to recover existing tools easily;
wenzelm
parents:
74446
diff
changeset
|
1007 |
| _ => raise TERM ("dest_abs", [t])); |
c960bfcb91db
discontinued Term.dest_abs / Logic.dest_all, which are officially superseded by Variable.dest_abs etc., but there are also Term.dest_abs_global to recover existing tools easily;
wenzelm
parents:
74446
diff
changeset
|
1008 |
|
c960bfcb91db
discontinued Term.dest_abs / Logic.dest_all, which are officially superseded by Variable.dest_abs etc., but there are also Term.dest_abs_global to recover existing tools easily;
wenzelm
parents:
74446
diff
changeset
|
1009 |
fun dest_abs_global t = |
c960bfcb91db
discontinued Term.dest_abs / Logic.dest_all, which are officially superseded by Variable.dest_abs etc., but there are also Term.dest_abs_global to recover existing tools easily;
wenzelm
parents:
74446
diff
changeset
|
1010 |
(case t of |
c960bfcb91db
discontinued Term.dest_abs / Logic.dest_all, which are officially superseded by Variable.dest_abs etc., but there are also Term.dest_abs_global to recover existing tools easily;
wenzelm
parents:
74446
diff
changeset
|
1011 |
Abs (x, T, b) => |
c960bfcb91db
discontinued Term.dest_abs / Logic.dest_all, which are officially superseded by Variable.dest_abs etc., but there are also Term.dest_abs_global to recover existing tools easily;
wenzelm
parents:
74446
diff
changeset
|
1012 |
if used_free x b then |
c960bfcb91db
discontinued Term.dest_abs / Logic.dest_all, which are officially superseded by Variable.dest_abs etc., but there are also Term.dest_abs_global to recover existing tools easily;
wenzelm
parents:
74446
diff
changeset
|
1013 |
let |
c960bfcb91db
discontinued Term.dest_abs / Logic.dest_all, which are officially superseded by Variable.dest_abs etc., but there are also Term.dest_abs_global to recover existing tools easily;
wenzelm
parents:
74446
diff
changeset
|
1014 |
val used = Name.build_context (declare_term_frees b); |
c960bfcb91db
discontinued Term.dest_abs / Logic.dest_all, which are officially superseded by Variable.dest_abs etc., but there are also Term.dest_abs_global to recover existing tools easily;
wenzelm
parents:
74446
diff
changeset
|
1015 |
val x' = #1 (Name.variant x used); |
c960bfcb91db
discontinued Term.dest_abs / Logic.dest_all, which are officially superseded by Variable.dest_abs etc., but there are also Term.dest_abs_global to recover existing tools easily;
wenzelm
parents:
74446
diff
changeset
|
1016 |
in subst_abs (x', T) b end |
c960bfcb91db
discontinued Term.dest_abs / Logic.dest_all, which are officially superseded by Variable.dest_abs etc., but there are also Term.dest_abs_global to recover existing tools easily;
wenzelm
parents:
74446
diff
changeset
|
1017 |
else subst_abs (x, T) b |
c960bfcb91db
discontinued Term.dest_abs / Logic.dest_all, which are officially superseded by Variable.dest_abs etc., but there are also Term.dest_abs_global to recover existing tools easily;
wenzelm
parents:
74446
diff
changeset
|
1018 |
| _ => raise TERM ("dest_abs", [t])); |
16678 | 1019 |
|
20160 | 1020 |
|
9536
b79b002f32ae
added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents:
9319
diff
changeset
|
1021 |
(* dummy patterns *) |
b79b002f32ae
added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents:
9319
diff
changeset
|
1022 |
|
56241 | 1023 |
fun dummy_pattern T = Const ("Pure.dummy_pattern", T); |
45156 | 1024 |
val dummy = dummy_pattern dummyT; |
1025 |
val dummy_prop = dummy_pattern propT; |
|
18253 | 1026 |
|
56241 | 1027 |
fun is_dummy_pattern (Const ("Pure.dummy_pattern", _)) = true |
9536
b79b002f32ae
added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents:
9319
diff
changeset
|
1028 |
| is_dummy_pattern _ = false; |
b79b002f32ae
added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents:
9319
diff
changeset
|
1029 |
|
b79b002f32ae
added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents:
9319
diff
changeset
|
1030 |
fun no_dummy_patterns tm = |
16787 | 1031 |
if not (fold_aterms (fn t => fn b => b orelse is_dummy_pattern t) tm false) then tm |
9536
b79b002f32ae
added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents:
9319
diff
changeset
|
1032 |
else raise TERM ("Illegal occurrence of '_' dummy pattern", [tm]); |
b79b002f32ae
added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents:
9319
diff
changeset
|
1033 |
|
56241 | 1034 |
fun free_dummy_patterns (Const ("Pure.dummy_pattern", T)) used = |
43329
84472e198515
tuned signature: Name.invent and Name.invent_names;
wenzelm
parents:
43326
diff
changeset
|
1035 |
let val [x] = Name.invent used Name.uu 1 |
24733 | 1036 |
in (Free (Name.internal x, T), Name.declare x used) end |
1037 |
| free_dummy_patterns (Abs (x, T, b)) used = |
|
1038 |
let val (b', used') = free_dummy_patterns b used |
|
1039 |
in (Abs (x, T, b'), used') end |
|
1040 |
| free_dummy_patterns (t $ u) used = |
|
1041 |
let |
|
1042 |
val (t', used') = free_dummy_patterns t used; |
|
1043 |
val (u', used'') = free_dummy_patterns u used'; |
|
1044 |
in (t' $ u', used'') end |
|
1045 |
| free_dummy_patterns a used = (a, used); |
|
1046 |
||
56241 | 1047 |
fun replace_dummy Ts (Const ("Pure.dummy_pattern", T)) i = |
33063 | 1048 |
(list_comb (Var (("_dummy_", i), Ts ---> T), map_range Bound (length Ts)), i + 1) |
24762 | 1049 |
| replace_dummy Ts (Abs (x, T, t)) i = |
1050 |
let val (t', i') = replace_dummy (T :: Ts) t i |
|
1051 |
in (Abs (x, T, t'), i') end |
|
1052 |
| replace_dummy Ts (t $ u) i = |
|
1053 |
let |
|
1054 |
val (t', i') = replace_dummy Ts t i; |
|
1055 |
val (u', i'') = replace_dummy Ts u i'; |
|
1056 |
in (t' $ u', i'') end |
|
1057 |
| replace_dummy _ a i = (a, i); |
|
11903 | 1058 |
|
1059 |
val replace_dummy_patterns = replace_dummy []; |
|
9536
b79b002f32ae
added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents:
9319
diff
changeset
|
1060 |
|
45156 | 1061 |
fun show_dummy_patterns (Var (("_dummy_", _), T)) = dummy_pattern T |
16035 | 1062 |
| show_dummy_patterns (t $ u) = show_dummy_patterns t $ show_dummy_patterns u |
1063 |
| show_dummy_patterns (Abs (x, T, t)) = Abs (x, T, show_dummy_patterns t) |
|
1064 |
| show_dummy_patterns a = a; |
|
1065 |
||
13484 | 1066 |
|
20100 | 1067 |
(* display variables *) |
1068 |
||
14786
24a7bc97a27a
moved some sort ops to sorts.ML; added string_of_vname (from Syntax module);
wenzelm
parents:
14695
diff
changeset
|
1069 |
fun string_of_vname (x, i) = |
24a7bc97a27a
moved some sort ops to sorts.ML; added string_of_vname (from Syntax module);
wenzelm
parents:
14695
diff
changeset
|
1070 |
let |
15986 | 1071 |
val idx = string_of_int i; |
1072 |
val dot = |
|
1073 |
(case rev (Symbol.explode x) of |
|
62529
8b7bdfc09f3b
clarified treatment of fragments of Isabelle symbols during bootstrap;
wenzelm
parents:
61655
diff
changeset
|
1074 |
_ :: "\<^sub>" :: _ => false |
15986 | 1075 |
| c :: _ => Symbol.is_digit c |
1076 |
| _ => true); |
|
14786
24a7bc97a27a
moved some sort ops to sorts.ML; added string_of_vname (from Syntax module);
wenzelm
parents:
14695
diff
changeset
|
1077 |
in |
38980
af73cf0dc31f
turned show_question_marks into proper configuration option;
wenzelm
parents:
35986
diff
changeset
|
1078 |
if dot then "?" ^ x ^ "." ^ idx |
af73cf0dc31f
turned show_question_marks into proper configuration option;
wenzelm
parents:
35986
diff
changeset
|
1079 |
else if i <> 0 then "?" ^ x ^ idx |
af73cf0dc31f
turned show_question_marks into proper configuration option;
wenzelm
parents:
35986
diff
changeset
|
1080 |
else "?" ^ x |
14786
24a7bc97a27a
moved some sort ops to sorts.ML; added string_of_vname (from Syntax module);
wenzelm
parents:
14695
diff
changeset
|
1081 |
end; |
24a7bc97a27a
moved some sort ops to sorts.ML; added string_of_vname (from Syntax module);
wenzelm
parents:
14695
diff
changeset
|
1082 |
|
24a7bc97a27a
moved some sort ops to sorts.ML; added string_of_vname (from Syntax module);
wenzelm
parents:
14695
diff
changeset
|
1083 |
fun string_of_vname' (x, ~1) = x |
24a7bc97a27a
moved some sort ops to sorts.ML; added string_of_vname (from Syntax module);
wenzelm
parents:
14695
diff
changeset
|
1084 |
| string_of_vname' xi = string_of_vname xi; |
24a7bc97a27a
moved some sort ops to sorts.ML; added string_of_vname (from Syntax module);
wenzelm
parents:
14695
diff
changeset
|
1085 |
|
1364
8ea1a962ad72
files now define a structure to allow SML/NJ to optimize the code
clasohm
parents:
1029
diff
changeset
|
1086 |
end; |
8ea1a962ad72
files now define a structure to allow SML/NJ to optimize the code
clasohm
parents:
1029
diff
changeset
|
1087 |
|
40841 | 1088 |
structure Basic_Term: BASIC_TERM = Term; |
1089 |
open Basic_Term; |