author | wenzelm |
Sun, 12 Sep 2010 22:28:59 +0200 | |
changeset 39292 | 6f085332c7d3 |
parent 39291 | 4b632bb847a8 |
child 39294 | 27fae73fe769 |
permissions | -rw-r--r-- |
2957
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
1 |
(* Title: Pure/type_infer.ML |
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
2 |
Author: Stefan Berghofer and Markus Wenzel, TU Muenchen |
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
3 |
|
22698 | 4 |
Simple type inference. |
2957
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
5 |
*) |
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
6 |
|
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
7 |
signature TYPE_INFER = |
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
8 |
sig |
8087 | 9 |
val anyT: sort -> typ |
24504 | 10 |
val is_param: indexname -> bool |
14788
9776f0c747c8
incorporate type inference interface from type.ML;
wenzelm
parents:
14695
diff
changeset
|
11 |
val param: int -> string * sort -> typ |
22771 | 12 |
val paramify_vars: typ -> typ |
18339 | 13 |
val paramify_dummies: typ -> int -> typ * int |
24764 | 14 |
val fixate_params: Name.context -> term list -> term list |
39290
44e4d8dfd6bf
load type_infer.ML later -- proper context for Type_Infer.infer_types;
wenzelm
parents:
39289
diff
changeset
|
15 |
val infer_types: Proof.context -> (string -> typ option) -> (indexname -> typ option) -> |
27263 | 16 |
term list -> term list |
2957
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
17 |
end; |
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
18 |
|
37145
01aa36932739
renamed structure TypeInfer to Type_Infer, keeping the old name as legacy alias for some time;
wenzelm
parents:
35013
diff
changeset
|
19 |
structure Type_Infer: TYPE_INFER = |
2957
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
20 |
struct |
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
21 |
|
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
22 |
|
22698 | 23 |
(** type parameters and constraints **) |
2957
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
24 |
|
22698 | 25 |
fun anyT S = TFree ("'_dummy_", S); |
2957
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
26 |
|
22698 | 27 |
|
39286 | 28 |
(* type inference parameters -- may get instantiated *) |
2957
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
29 |
|
24504 | 30 |
fun is_param (x, _: int) = String.isPrefix "?" x; |
22698 | 31 |
fun param i (x, S) = TVar (("?" ^ x, i), S); |
32 |
||
32002
1a35de4112bb
tuned paramify_vars: Term_Subst.map_atypsT_option;
wenzelm
parents:
31977
diff
changeset
|
33 |
val paramify_vars = |
32146 | 34 |
Same.commit |
35 |
(Term_Subst.map_atypsT_same |
|
36 |
(fn TVar ((x, i), S) => (param i (x, S)) | _ => raise Same.SAME)); |
|
22771 | 37 |
|
22698 | 38 |
val paramify_dummies = |
39 |
let |
|
40 |
fun dummy S maxidx = (param (maxidx + 1) ("'dummy", S), maxidx + 1); |
|
2957
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
41 |
|
22698 | 42 |
fun paramify (TFree ("'_dummy_", S)) maxidx = dummy S maxidx |
43 |
| paramify (Type ("dummy", _)) maxidx = dummy [] maxidx |
|
44 |
| paramify (Type (a, Ts)) maxidx = |
|
45 |
let val (Ts', maxidx') = fold_map paramify Ts maxidx |
|
46 |
in (Type (a, Ts'), maxidx') end |
|
47 |
| paramify T maxidx = (T, maxidx); |
|
48 |
in paramify end; |
|
2957
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
49 |
|
24764 | 50 |
fun fixate_params name_context ts = |
51 |
let |
|
52 |
fun subst_param (xi, S) (inst, used) = |
|
53 |
if is_param xi then |
|
54 |
let |
|
24848 | 55 |
val [a] = Name.invents used Name.aT 1; |
24764 | 56 |
val used' = Name.declare a used; |
57 |
in (((xi, S), TFree (a, S)) :: inst, used') end |
|
58 |
else (inst, used); |
|
59 |
val name_context' = (fold o fold_types) Term.declare_typ_names ts name_context; |
|
60 |
val (inst, _) = fold_rev subst_param (fold Term.add_tvars ts []) ([], name_context'); |
|
31977 | 61 |
in (map o map_types) (Term_Subst.instantiateT inst) ts end; |
24764 | 62 |
|
2957
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
63 |
|
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
64 |
|
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
65 |
(** pretyps and preterms **) |
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
66 |
|
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
67 |
datatype pretyp = |
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
68 |
PType of string * pretyp list | |
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
69 |
PTFree of string * sort | |
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
70 |
PTVar of indexname * sort | |
32141 | 71 |
Param of int * sort; |
2957
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
72 |
|
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
73 |
datatype preterm = |
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
74 |
PConst of string * pretyp | |
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
75 |
PFree of string * pretyp | |
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
76 |
PVar of indexname * pretyp | |
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
77 |
PBound of int | |
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
78 |
PAbs of string * pretyp * preterm | |
39292
6f085332c7d3
Type_Infer.preterm: eliminated separate Constraint;
wenzelm
parents:
39291
diff
changeset
|
79 |
PAppl of preterm * preterm; |
2957
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
80 |
|
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
81 |
|
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
82 |
(* utils *) |
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
83 |
|
32146 | 84 |
fun deref tye (T as Param (i, S)) = |
85 |
(case Inttab.lookup tye i of |
|
86 |
NONE => T |
|
87 |
| SOME U => deref tye U) |
|
32141 | 88 |
| deref tye T = T; |
2957
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
89 |
|
16195 | 90 |
fun fold_pretyps f (PConst (_, T)) x = f T x |
91 |
| fold_pretyps f (PFree (_, T)) x = f T x |
|
92 |
| fold_pretyps f (PVar (_, T)) x = f T x |
|
93 |
| fold_pretyps _ (PBound _) x = x |
|
94 |
| fold_pretyps f (PAbs (_, T, t)) x = fold_pretyps f t (f T x) |
|
39292
6f085332c7d3
Type_Infer.preterm: eliminated separate Constraint;
wenzelm
parents:
39291
diff
changeset
|
95 |
| fold_pretyps f (PAppl (t, u)) x = fold_pretyps f u (fold_pretyps f t x); |
2957
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
96 |
|
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
97 |
|
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
98 |
|
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
99 |
(** raw typs/terms to pretyps/preterms **) |
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
100 |
|
20668 | 101 |
(* pretyp_of *) |
2957
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
102 |
|
39287 | 103 |
fun pretyp_of typ params_idx = |
2957
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
104 |
let |
32141 | 105 |
val (params', idx) = fold_atyps |
20668 | 106 |
(fn TVar (xi as (x, _), S) => |
32141 | 107 |
(fn ps_idx as (ps, idx) => |
39287 | 108 |
if is_param xi andalso not (Vartab.defined ps xi) |
32141 | 109 |
then (Vartab.update (xi, Param (idx, S)) ps, idx + 1) else ps_idx) |
110 |
| _ => I) typ params_idx; |
|
2957
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
111 |
|
32141 | 112 |
fun pre_of (TVar (v as (xi, _))) idx = |
20735 | 113 |
(case Vartab.lookup params' xi of |
15531 | 114 |
NONE => PTVar v |
32141 | 115 |
| SOME p => p, idx) |
116 |
| pre_of (TFree ("'_dummy_", S)) idx = (Param (idx, S), idx + 1) |
|
117 |
| pre_of (TFree v) idx = (PTFree v, idx) |
|
118 |
| pre_of (T as Type (a, Ts)) idx = |
|
119 |
if T = dummyT then (Param (idx, []), idx + 1) |
|
120 |
else |
|
121 |
let val (Ts', idx') = fold_map pre_of Ts idx |
|
122 |
in (PType (a, Ts'), idx') end; |
|
123 |
||
124 |
val (ptyp, idx') = pre_of typ idx; |
|
125 |
in (ptyp, (params', idx')) end; |
|
2957
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
126 |
|
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
127 |
|
20668 | 128 |
(* preterm_of *) |
2957
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
129 |
|
39287 | 130 |
fun preterm_of const_type tm (vparams, params, idx) = |
2957
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
131 |
let |
32141 | 132 |
fun add_vparm xi (ps_idx as (ps, idx)) = |
20735 | 133 |
if not (Vartab.defined ps xi) then |
32141 | 134 |
(Vartab.update (xi, Param (idx, [])) ps, idx + 1) |
135 |
else ps_idx; |
|
2957
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
136 |
|
32141 | 137 |
val (vparams', idx') = fold_aterms |
20668 | 138 |
(fn Var (_, Type ("_polymorphic_", _)) => I |
139 |
| Var (xi, _) => add_vparm xi |
|
140 |
| Free (x, _) => add_vparm (x, ~1) |
|
141 |
| _ => I) |
|
32141 | 142 |
tm (vparams, idx); |
20735 | 143 |
fun var_param xi = the (Vartab.lookup vparams' xi); |
2957
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
144 |
|
39287 | 145 |
fun polyT_of T idx = apsnd snd (pretyp_of (paramify_vars T) (Vartab.empty, idx)); |
2957
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
146 |
|
22698 | 147 |
fun constraint T t ps = |
20668 | 148 |
if T = dummyT then (t, ps) |
2957
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
149 |
else |
39287 | 150 |
let val (T', ps') = pretyp_of T ps |
39292
6f085332c7d3
Type_Infer.preterm: eliminated separate Constraint;
wenzelm
parents:
39291
diff
changeset
|
151 |
in (PAppl (PConst ("_type_constraint_", PType ("fun", [T', T'])), t), ps') end; |
2957
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
152 |
|
32141 | 153 |
fun pre_of (Const (c, T)) (ps, idx) = |
2957
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
154 |
(case const_type c of |
32141 | 155 |
SOME U => |
156 |
let val (pU, idx') = polyT_of U idx |
|
157 |
in constraint T (PConst (c, pU)) (ps, idx') end |
|
39291
4b632bb847a8
Type_Infer.infer_types: plain error instead of kernel exception TYPE;
wenzelm
parents:
39290
diff
changeset
|
158 |
| NONE => error ("Undeclared constant: " ^ quote c)) |
39292
6f085332c7d3
Type_Infer.preterm: eliminated separate Constraint;
wenzelm
parents:
39291
diff
changeset
|
159 |
| pre_of (Const ("_type_constraint_", T) $ t) ps_idx = |
6f085332c7d3
Type_Infer.preterm: eliminated separate Constraint;
wenzelm
parents:
39291
diff
changeset
|
160 |
let |
6f085332c7d3
Type_Infer.preterm: eliminated separate Constraint;
wenzelm
parents:
39291
diff
changeset
|
161 |
val (T', ps_idx') = pretyp_of T ps_idx; |
6f085332c7d3
Type_Infer.preterm: eliminated separate Constraint;
wenzelm
parents:
39291
diff
changeset
|
162 |
val (t', ps_idx'') = pre_of t ps_idx'; |
6f085332c7d3
Type_Infer.preterm: eliminated separate Constraint;
wenzelm
parents:
39291
diff
changeset
|
163 |
in (PAppl (PConst ("_type_constraint_", T'), t'), ps_idx'') end |
32141 | 164 |
| pre_of (Var (xi, Type ("_polymorphic_", [T]))) (ps, idx) = |
165 |
let val (pT, idx') = polyT_of T idx |
|
166 |
in (PVar (xi, pT), (ps, idx')) end |
|
167 |
| pre_of (Var (xi, T)) ps_idx = constraint T (PVar (xi, var_param xi)) ps_idx |
|
168 |
| pre_of (Free (x, T)) ps_idx = constraint T (PFree (x, var_param (x, ~1))) ps_idx |
|
169 |
| pre_of (Bound i) ps_idx = (PBound i, ps_idx) |
|
170 |
| pre_of (Abs (x, T, t)) ps_idx = |
|
2957
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
171 |
let |
39287 | 172 |
val (T', ps_idx') = pretyp_of T ps_idx; |
32141 | 173 |
val (t', ps_idx'') = pre_of t ps_idx'; |
174 |
in (PAbs (x, T', t'), ps_idx'') end |
|
175 |
| pre_of (t $ u) ps_idx = |
|
2957
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
176 |
let |
32141 | 177 |
val (t', ps_idx') = pre_of t ps_idx; |
178 |
val (u', ps_idx'') = pre_of u ps_idx'; |
|
179 |
in (PAppl (t', u'), ps_idx'') end; |
|
2957
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
180 |
|
32141 | 181 |
val (tm', (params', idx'')) = pre_of tm (params, idx'); |
182 |
in (tm', (vparams', params', idx'')) end; |
|
2957
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
183 |
|
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
184 |
|
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
185 |
|
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
186 |
(** pretyps/terms to typs/terms **) |
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
187 |
|
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
188 |
(* add_parms *) |
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
189 |
|
32146 | 190 |
fun add_parmsT tye T = |
191 |
(case deref tye T of |
|
32141 | 192 |
PType (_, Ts) => fold (add_parmsT tye) Ts |
193 |
| Param (i, _) => insert (op =) i |
|
32146 | 194 |
| _ => I); |
2957
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
195 |
|
32141 | 196 |
fun add_parms tye = fold_pretyps (add_parmsT tye); |
2957
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
197 |
|
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
198 |
|
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
199 |
(* add_names *) |
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
200 |
|
32146 | 201 |
fun add_namesT tye T = |
202 |
(case deref tye T of |
|
32141 | 203 |
PType (_, Ts) => fold (add_namesT tye) Ts |
204 |
| PTFree (x, _) => Name.declare x |
|
205 |
| PTVar ((x, _), _) => Name.declare x |
|
32146 | 206 |
| Param _ => I); |
2957
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
207 |
|
32141 | 208 |
fun add_names tye = fold_pretyps (add_namesT tye); |
2957
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
209 |
|
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
210 |
|
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
211 |
(* simple_typ/term_of *) |
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
212 |
|
32146 | 213 |
fun simple_typ_of tye f T = |
214 |
(case deref tye T of |
|
32141 | 215 |
PType (a, Ts) => Type (a, map (simple_typ_of tye f) Ts) |
216 |
| PTFree v => TFree v |
|
217 |
| PTVar v => TVar v |
|
32146 | 218 |
| Param (i, S) => TVar (f i, S)); |
2957
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
219 |
|
32141 | 220 |
fun simple_term_of tye f (PConst (c, T)) = Const (c, simple_typ_of tye f T) |
221 |
| simple_term_of tye f (PFree (x, T)) = Free (x, simple_typ_of tye f T) |
|
222 |
| simple_term_of tye f (PVar (xi, T)) = Var (xi, simple_typ_of tye f T) |
|
223 |
| simple_term_of tye f (PBound i) = Bound i |
|
224 |
| simple_term_of tye f (PAbs (x, T, t)) = |
|
225 |
Abs (x, simple_typ_of tye f T, simple_term_of tye f t) |
|
226 |
| simple_term_of tye f (PAppl (t, u)) = |
|
39292
6f085332c7d3
Type_Infer.preterm: eliminated separate Constraint;
wenzelm
parents:
39291
diff
changeset
|
227 |
simple_term_of tye f t $ simple_term_of tye f u; |
2957
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
228 |
|
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
229 |
|
32141 | 230 |
(* typs_terms_of *) |
2957
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
231 |
|
39290
44e4d8dfd6bf
load type_infer.ML later -- proper context for Type_Infer.infer_types;
wenzelm
parents:
39289
diff
changeset
|
232 |
fun typs_terms_of ctxt tye (Ts, ts) = |
2957
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
233 |
let |
39290
44e4d8dfd6bf
load type_infer.ML later -- proper context for Type_Infer.infer_types;
wenzelm
parents:
39289
diff
changeset
|
234 |
val used = fold (add_names tye) ts (fold (add_namesT tye) Ts (Variable.names_of ctxt)); |
32141 | 235 |
val parms = rev (fold (add_parms tye) ts (fold (add_parmsT tye) Ts [])); |
39290
44e4d8dfd6bf
load type_infer.ML later -- proper context for Type_Infer.infer_types;
wenzelm
parents:
39289
diff
changeset
|
236 |
val names = Name.invents used ("?" ^ Name.aT) (length parms); |
32141 | 237 |
val tab = Inttab.make (parms ~~ names); |
39290
44e4d8dfd6bf
load type_infer.ML later -- proper context for Type_Infer.infer_types;
wenzelm
parents:
39289
diff
changeset
|
238 |
|
44e4d8dfd6bf
load type_infer.ML later -- proper context for Type_Infer.infer_types;
wenzelm
parents:
39289
diff
changeset
|
239 |
val maxidx = Variable.maxidx_of ctxt; |
32141 | 240 |
fun f i = (the (Inttab.lookup tab i), maxidx + 1); |
39292
6f085332c7d3
Type_Infer.preterm: eliminated separate Constraint;
wenzelm
parents:
39291
diff
changeset
|
241 |
in (map (simple_typ_of tye f) Ts, map (Type.strip_constraints o simple_term_of tye f) ts) end; |
2957
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
242 |
|
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
243 |
|
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
244 |
|
32141 | 245 |
(** order-sorted unification of types **) |
2957
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
246 |
|
32141 | 247 |
exception NO_UNIFIER of string * pretyp Inttab.table; |
2957
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
248 |
|
39290
44e4d8dfd6bf
load type_infer.ML later -- proper context for Type_Infer.infer_types;
wenzelm
parents:
39289
diff
changeset
|
249 |
fun unify ctxt pp = |
2957
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
250 |
let |
39290
44e4d8dfd6bf
load type_infer.ML later -- proper context for Type_Infer.infer_types;
wenzelm
parents:
39289
diff
changeset
|
251 |
val thy = ProofContext.theory_of ctxt; |
44e4d8dfd6bf
load type_infer.ML later -- proper context for Type_Infer.infer_types;
wenzelm
parents:
39289
diff
changeset
|
252 |
val arity_sorts = Type.arity_sorts pp (Sign.tsig_of thy); |
44e4d8dfd6bf
load type_infer.ML later -- proper context for Type_Infer.infer_types;
wenzelm
parents:
39289
diff
changeset
|
253 |
|
44e4d8dfd6bf
load type_infer.ML later -- proper context for Type_Infer.infer_types;
wenzelm
parents:
39289
diff
changeset
|
254 |
|
2957
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
255 |
(* adjust sorts of parameters *) |
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
256 |
|
19465 | 257 |
fun not_of_sort x S' S = |
39290
44e4d8dfd6bf
load type_infer.ML later -- proper context for Type_Infer.infer_types;
wenzelm
parents:
39289
diff
changeset
|
258 |
"Variable " ^ x ^ "::" ^ Syntax.string_of_sort ctxt S' ^ " not of sort " ^ |
44e4d8dfd6bf
load type_infer.ML later -- proper context for Type_Infer.infer_types;
wenzelm
parents:
39289
diff
changeset
|
259 |
Syntax.string_of_sort ctxt S; |
2957
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
260 |
|
32141 | 261 |
fun meet (_, []) tye_idx = tye_idx |
262 |
| meet (Param (i, S'), S) (tye_idx as (tye, idx)) = |
|
39290
44e4d8dfd6bf
load type_infer.ML later -- proper context for Type_Infer.infer_types;
wenzelm
parents:
39289
diff
changeset
|
263 |
if Sign.subsort thy (S', S) then tye_idx |
32141 | 264 |
else (Inttab.update_new (i, |
39290
44e4d8dfd6bf
load type_infer.ML later -- proper context for Type_Infer.infer_types;
wenzelm
parents:
39289
diff
changeset
|
265 |
Param (idx, Sign.inter_sort thy (S', S))) tye, idx + 1) |
32141 | 266 |
| meet (PType (a, Ts), S) (tye_idx as (tye, _)) = |
39291
4b632bb847a8
Type_Infer.infer_types: plain error instead of kernel exception TYPE;
wenzelm
parents:
39290
diff
changeset
|
267 |
meets (Ts, arity_sorts a S handle ERROR msg => raise NO_UNIFIER (msg, tye)) tye_idx |
32141 | 268 |
| meet (PTFree (x, S'), S) (tye_idx as (tye, _)) = |
39290
44e4d8dfd6bf
load type_infer.ML later -- proper context for Type_Infer.infer_types;
wenzelm
parents:
39289
diff
changeset
|
269 |
if Sign.subsort thy (S', S) then tye_idx |
32141 | 270 |
else raise NO_UNIFIER (not_of_sort x S' S, tye) |
271 |
| meet (PTVar (xi, S'), S) (tye_idx as (tye, _)) = |
|
39290
44e4d8dfd6bf
load type_infer.ML later -- proper context for Type_Infer.infer_types;
wenzelm
parents:
39289
diff
changeset
|
272 |
if Sign.subsort thy (S', S) then tye_idx |
32141 | 273 |
else raise NO_UNIFIER (not_of_sort (Term.string_of_vname xi) S' S, tye) |
274 |
and meets (T :: Ts, S :: Ss) (tye_idx as (tye, _)) = |
|
275 |
meets (Ts, Ss) (meet (deref tye T, S) tye_idx) |
|
276 |
| meets _ tye_idx = tye_idx; |
|
2957
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
277 |
|
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
278 |
|
35013 | 279 |
(* occurs check and assignment *) |
2957
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
280 |
|
32141 | 281 |
fun occurs_check tye i (Param (i', S)) = |
282 |
if i = i' then raise NO_UNIFIER ("Occurs check!", tye) |
|
32146 | 283 |
else |
284 |
(case Inttab.lookup tye i' of |
|
32141 | 285 |
NONE => () |
286 |
| SOME T => occurs_check tye i T) |
|
287 |
| occurs_check tye i (PType (_, Ts)) = List.app (occurs_check tye i) Ts |
|
288 |
| occurs_check _ _ _ = (); |
|
2957
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
289 |
|
37235
cafcc42bae77
assign now applies meet before update_new to avoid misleading error message.
berghofe
parents:
35013
diff
changeset
|
290 |
fun assign i (T as Param (i', _)) S tye_idx = |
32141 | 291 |
if i = i' then tye_idx |
37235
cafcc42bae77
assign now applies meet before update_new to avoid misleading error message.
berghofe
parents:
35013
diff
changeset
|
292 |
else tye_idx |> meet (T, S) |>> Inttab.update_new (i, T) |
cafcc42bae77
assign now applies meet before update_new to avoid misleading error message.
berghofe
parents:
35013
diff
changeset
|
293 |
| assign i T S (tye_idx as (tye, _)) = |
cafcc42bae77
assign now applies meet before update_new to avoid misleading error message.
berghofe
parents:
35013
diff
changeset
|
294 |
(occurs_check tye i T; tye_idx |> meet (T, S) |>> Inttab.update_new (i, T)); |
2957
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
295 |
|
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
296 |
|
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
297 |
(* unification *) |
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
298 |
|
39286 | 299 |
fun show_tycon (a, Ts) = |
39290
44e4d8dfd6bf
load type_infer.ML later -- proper context for Type_Infer.infer_types;
wenzelm
parents:
39289
diff
changeset
|
300 |
quote (Syntax.string_of_typ ctxt (Type (a, replicate (length Ts) dummyT))); |
39286 | 301 |
|
32146 | 302 |
fun unif (T1, T2) (tye_idx as (tye, idx)) = |
303 |
(case (deref tye T1, deref tye T2) of |
|
32141 | 304 |
(Param (i, S), T) => assign i T S tye_idx |
305 |
| (T, Param (i, S)) => assign i T S tye_idx |
|
306 |
| (PType (a, Ts), PType (b, Us)) => |
|
2979 | 307 |
if a <> b then |
39286 | 308 |
raise NO_UNIFIER |
309 |
("Clash of types " ^ show_tycon (a, Ts) ^ " and " ^ show_tycon (b, Us), tye) |
|
32141 | 310 |
else fold unif (Ts ~~ Us) tye_idx |
32146 | 311 |
| (T, U) => if T = U then tye_idx else raise NO_UNIFIER ("", tye)); |
2957
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
312 |
|
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
313 |
in unif end; |
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
314 |
|
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
315 |
|
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
316 |
|
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
317 |
(** type inference **) |
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
318 |
|
32141 | 319 |
(* infer *) |
2957
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
320 |
|
39290
44e4d8dfd6bf
load type_infer.ML later -- proper context for Type_Infer.infer_types;
wenzelm
parents:
39289
diff
changeset
|
321 |
fun infer ctxt = |
2957
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
322 |
let |
39290
44e4d8dfd6bf
load type_infer.ML later -- proper context for Type_Infer.infer_types;
wenzelm
parents:
39289
diff
changeset
|
323 |
val pp = Syntax.pp ctxt; |
44e4d8dfd6bf
load type_infer.ML later -- proper context for Type_Infer.infer_types;
wenzelm
parents:
39289
diff
changeset
|
324 |
|
44e4d8dfd6bf
load type_infer.ML later -- proper context for Type_Infer.infer_types;
wenzelm
parents:
39289
diff
changeset
|
325 |
|
2979 | 326 |
(* errors *) |
2957
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
327 |
|
32141 | 328 |
fun prep_output tye bs ts Ts = |
2957
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
329 |
let |
39290
44e4d8dfd6bf
load type_infer.ML later -- proper context for Type_Infer.infer_types;
wenzelm
parents:
39289
diff
changeset
|
330 |
val (Ts_bTs', ts') = typs_terms_of ctxt tye (Ts @ map snd bs, ts); |
19012 | 331 |
val (Ts', Ts'') = chop (length Ts) Ts_bTs'; |
27263 | 332 |
fun prep t = |
333 |
let val xs = rev (Term.variant_frees t (rev (map fst bs ~~ Ts''))) |
|
334 |
in Term.subst_bounds (map Syntax.mark_boundT xs, t) end; |
|
335 |
in (map prep ts', Ts') end; |
|
2979 | 336 |
|
39291
4b632bb847a8
Type_Infer.infer_types: plain error instead of kernel exception TYPE;
wenzelm
parents:
39290
diff
changeset
|
337 |
fun err_loose i = error ("Loose bound variable: B." ^ string_of_int i); |
2979 | 338 |
|
39289
92b50c8bb67b
common Type.appl_error, which also covers explicit constraints;
wenzelm
parents:
39288
diff
changeset
|
339 |
fun unif_failed msg = |
92b50c8bb67b
common Type.appl_error, which also covers explicit constraints;
wenzelm
parents:
39288
diff
changeset
|
340 |
"Type unification failed" ^ (if msg = "" then "" else ": " ^ msg) ^ "\n\n"; |
92b50c8bb67b
common Type.appl_error, which also covers explicit constraints;
wenzelm
parents:
39288
diff
changeset
|
341 |
|
32141 | 342 |
fun err_appl msg tye bs t T u U = |
39291
4b632bb847a8
Type_Infer.infer_types: plain error instead of kernel exception TYPE;
wenzelm
parents:
39290
diff
changeset
|
343 |
let val ([t', u'], [T', U']) = prep_output tye bs [t, u] [T, U] |
4b632bb847a8
Type_Infer.infer_types: plain error instead of kernel exception TYPE;
wenzelm
parents:
39290
diff
changeset
|
344 |
in error (unif_failed msg ^ Type.appl_error pp t' T' u' U' ^ "\n") end; |
2979 | 345 |
|
346 |
||
347 |
(* main *) |
|
348 |
||
32141 | 349 |
fun inf _ (PConst (_, T)) tye_idx = (T, tye_idx) |
350 |
| inf _ (PFree (_, T)) tye_idx = (T, tye_idx) |
|
351 |
| inf _ (PVar (_, T)) tye_idx = (T, tye_idx) |
|
352 |
| inf bs (PBound i) tye_idx = |
|
353 |
(snd (nth bs i handle Subscript => err_loose i), tye_idx) |
|
354 |
| inf bs (PAbs (x, T, t)) tye_idx = |
|
355 |
let val (U, tye_idx') = inf ((x, T) :: bs) t tye_idx |
|
356 |
in (PType ("fun", [T, U]), tye_idx') end |
|
357 |
| inf bs (PAppl (t, u)) tye_idx = |
|
2957
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
358 |
let |
32141 | 359 |
val (T, tye_idx') = inf bs t tye_idx; |
360 |
val (U, (tye, idx)) = inf bs u tye_idx'; |
|
361 |
val V = Param (idx, []); |
|
2957
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
362 |
val U_to_V = PType ("fun", [U, V]); |
39290
44e4d8dfd6bf
load type_infer.ML later -- proper context for Type_Infer.infer_types;
wenzelm
parents:
39289
diff
changeset
|
363 |
val tye_idx'' = unify ctxt pp (U_to_V, T) (tye, idx + 1) |
32141 | 364 |
handle NO_UNIFIER (msg, tye') => err_appl msg tye' bs t T u U; |
39292
6f085332c7d3
Type_Infer.preterm: eliminated separate Constraint;
wenzelm
parents:
39291
diff
changeset
|
365 |
in (V, tye_idx'') end; |
2957
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
366 |
|
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
367 |
in inf [] end; |
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
368 |
|
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
369 |
|
22698 | 370 |
(* infer_types *) |
2957
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
371 |
|
39290
44e4d8dfd6bf
load type_infer.ML later -- proper context for Type_Infer.infer_types;
wenzelm
parents:
39289
diff
changeset
|
372 |
fun infer_types ctxt const_type var_type raw_ts = |
2957
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
373 |
let |
22698 | 374 |
(*constrain vars*) |
375 |
val get_type = the_default dummyT o var_type; |
|
376 |
val constrain_vars = Term.map_aterms |
|
39288 | 377 |
(fn Free (x, T) => Type.constraint T (Free (x, get_type (x, ~1))) |
378 |
| Var (xi, T) => Type.constraint T (Var (xi, get_type xi)) |
|
22698 | 379 |
| t => t); |
380 |
||
27263 | 381 |
(*convert to preterms*) |
39290
44e4d8dfd6bf
load type_infer.ML later -- proper context for Type_Infer.infer_types;
wenzelm
parents:
39289
diff
changeset
|
382 |
val ts = burrow_types (Syntax.check_typs ctxt) raw_ts; |
32141 | 383 |
val (ts', (_, _, idx)) = |
39287 | 384 |
fold_map (preterm_of const_type o constrain_vars) ts |
32141 | 385 |
(Vartab.empty, Vartab.empty, 0); |
2957
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
386 |
|
27263 | 387 |
(*do type inference*) |
39290
44e4d8dfd6bf
load type_infer.ML later -- proper context for Type_Infer.infer_types;
wenzelm
parents:
39289
diff
changeset
|
388 |
val (tye, _) = fold (snd oo infer ctxt) ts' (Inttab.empty, idx); |
44e4d8dfd6bf
load type_infer.ML later -- proper context for Type_Infer.infer_types;
wenzelm
parents:
39289
diff
changeset
|
389 |
in #2 (typs_terms_of ctxt tye ([], ts')) end; |
14788
9776f0c747c8
incorporate type inference interface from type.ML;
wenzelm
parents:
14695
diff
changeset
|
390 |
|
2957
d35fca99b3be
Type inference (isolated from type.ML, completely reimplemented).
wenzelm
parents:
diff
changeset
|
391 |
end; |