author | wenzelm |
Sun, 08 Mar 2009 17:26:14 +0100 | |
changeset 30364 | 577edc39b501 |
parent 29565 | 3f8b24fcfbd6 |
child 32784 | 1a5dde5079ac |
permissions | -rw-r--r-- |
18 | 1 |
(* Title: Pure/Syntax/type_ext.ML |
0 | 2 |
Author: Tobias Nipkow and Markus Wenzel, TU Muenchen |
3 |
||
8895 | 4 |
Utilities for input and output of types. Also the concrete syntax of |
5 |
types, which is required to bootstrap Pure. |
|
0 | 6 |
*) |
7 |
||
8 |
signature TYPE_EXT0 = |
|
2584 | 9 |
sig |
22704 | 10 |
val sort_of_term: (sort -> sort) -> term -> sort |
11 |
val term_sorts: (sort -> sort) -> term -> (indexname * sort) list |
|
12317 | 12 |
val typ_of_term: (indexname -> sort) -> (sort -> sort) -> term -> typ |
27266
a2db1e379778
added type_constraint (formerly in type_infer.ML, which is now loaded later);
wenzelm
parents:
27197
diff
changeset
|
13 |
val type_constraint: typ -> term -> term |
22764 | 14 |
val decode_term: (((string * int) * sort) list -> string * int -> sort) -> |
27197
d1b8b6938b23
map_const: soft version, no failure here (recovers hiding of consts, because a hidden name is illegal and rejected later);
wenzelm
parents:
26708
diff
changeset
|
15 |
(string -> bool * string) -> (string -> string option) -> |
22704 | 16 |
(typ -> typ) -> (sort -> sort) -> term -> term |
6901 | 17 |
val term_of_typ: bool -> typ -> term |
10572 | 18 |
val no_brackets: unit -> bool |
16614 | 19 |
val no_type_brackets: unit -> bool |
2584 | 20 |
end; |
0 | 21 |
|
22 |
signature TYPE_EXT = |
|
2584 | 23 |
sig |
0 | 24 |
include TYPE_EXT0 |
2584 | 25 |
val term_of_sort: sort -> term |
1511 | 26 |
val tappl_ast_tr': Ast.ast * Ast.ast list -> Ast.ast |
8895 | 27 |
val sortT: typ |
1511 | 28 |
val type_ext: SynExt.syn_ext |
2584 | 29 |
end; |
0 | 30 |
|
15750 | 31 |
structure TypeExt: TYPE_EXT = |
0 | 32 |
struct |
2584 | 33 |
|
34 |
(** input utils **) |
|
0 | 35 |
|
8895 | 36 |
(* sort_of_term *) |
2584 | 37 |
|
22704 | 38 |
fun sort_of_term (map_sort: sort -> sort) tm = |
557
9d386e6c02b7
added raw_term_sorts and changed typ_of_term accordingly (part of fix
wenzelm
parents:
347
diff
changeset
|
39 |
let |
18 | 40 |
fun classes (Const (c, _)) = [c] |
41 |
| classes (Free (c, _)) = [c] |
|
26039 | 42 |
| classes (Const ("_class", _) $ Free (c, _)) = [c] |
3778 | 43 |
| classes (Const ("_classes", _) $ Const (c, _) $ cs) = c :: classes cs |
44 |
| classes (Const ("_classes", _) $ Free (c, _) $ cs) = c :: classes cs |
|
26039 | 45 |
| classes (Const ("_classes", _) $ (Const ("_class", _) $ Free (c, _)) $ cs) = c :: classes cs |
8895 | 46 |
| classes tm = raise TERM ("sort_of_term: bad encoding of classes", [tm]); |
0 | 47 |
|
2584 | 48 |
fun sort (Const ("_topsort", _)) = [] |
49 |
| sort (Const (c, _)) = [c] |
|
50 |
| sort (Free (c, _)) = [c] |
|
26039 | 51 |
| sort (Const ("_class", _) $ Free (c, _)) = [c] |
3778 | 52 |
| sort (Const ("_sort", _) $ cs) = classes cs |
8895 | 53 |
| sort tm = raise TERM ("sort_of_term: bad encoding of sort", [tm]); |
22704 | 54 |
in map_sort (sort tm) end; |
8895 | 55 |
|
2584 | 56 |
|
22704 | 57 |
(* term_sorts *) |
8895 | 58 |
|
22704 | 59 |
fun term_sorts map_sort tm = |
8895 | 60 |
let |
22704 | 61 |
val sort_of = sort_of_term map_sort; |
62 |
||
63 |
fun add_env (Const ("_ofsort", _) $ Free (x, _) $ cs) = |
|
64 |
insert (op =) ((x, ~1), sort_of cs) |
|
65 |
| add_env (Const ("_ofsort", _) $ (Const ("_tfree", _) $ Free (x, _)) $ cs) = |
|
66 |
insert (op =) ((x, ~1), sort_of cs) |
|
67 |
| add_env (Const ("_ofsort", _) $ Var (xi, _) $ cs) = |
|
68 |
insert (op =) (xi, sort_of cs) |
|
69 |
| add_env (Const ("_ofsort", _) $ (Const ("_tvar", _) $ Var (xi, _)) $ cs) = |
|
70 |
insert (op =) (xi, sort_of cs) |
|
71 |
| add_env (Abs (_, _, t)) = add_env t |
|
72 |
| add_env (t1 $ t2) = add_env t1 #> add_env t2 |
|
73 |
| add_env _ = I; |
|
8895 | 74 |
in add_env tm [] end; |
557
9d386e6c02b7
added raw_term_sorts and changed typ_of_term accordingly (part of fix
wenzelm
parents:
347
diff
changeset
|
75 |
|
9d386e6c02b7
added raw_term_sorts and changed typ_of_term accordingly (part of fix
wenzelm
parents:
347
diff
changeset
|
76 |
|
2584 | 77 |
(* typ_of_term *) |
0 | 78 |
|
12317 | 79 |
fun typ_of_term get_sort map_sort t = |
557
9d386e6c02b7
added raw_term_sorts and changed typ_of_term accordingly (part of fix
wenzelm
parents:
347
diff
changeset
|
80 |
let |
9d386e6c02b7
added raw_term_sorts and changed typ_of_term accordingly (part of fix
wenzelm
parents:
347
diff
changeset
|
81 |
fun typ_of (Free (x, _)) = |
5690 | 82 |
if Lexicon.is_tid x then TFree (x, get_sort (x, ~1)) |
557
9d386e6c02b7
added raw_term_sorts and changed typ_of_term accordingly (part of fix
wenzelm
parents:
347
diff
changeset
|
83 |
else Type (x, []) |
9d386e6c02b7
added raw_term_sorts and changed typ_of_term accordingly (part of fix
wenzelm
parents:
347
diff
changeset
|
84 |
| typ_of (Var (xi, _)) = TVar (xi, get_sort xi) |
14255 | 85 |
| typ_of (Const ("_tfree",_) $ (t as Free x)) = typ_of t |
86 |
| typ_of (Const ("_tvar",_) $ (t as Var x)) = typ_of t |
|
12317 | 87 |
| typ_of (Const ("_ofsort", _) $ Free (x, _) $ _) = TFree (x, get_sort (x, ~1)) |
16614 | 88 |
| typ_of (Const ("_ofsort", _) $ (Const ("_tfree",_) $ Free (x, _)) $ _) = |
89 |
TFree (x, get_sort (x, ~1)) |
|
12317 | 90 |
| typ_of (Const ("_ofsort", _) $ Var (xi, _) $ _) = TVar (xi, get_sort xi) |
16614 | 91 |
| typ_of (Const ("_ofsort", _) $ (Const ("_tvar",_) $ Var (xi, _)) $ _) = |
92 |
TVar (xi, get_sort xi) |
|
22704 | 93 |
| typ_of (Const ("_dummy_ofsort", _) $ t) = TFree ("'_dummy_", sort_of_term map_sort t) |
557
9d386e6c02b7
added raw_term_sorts and changed typ_of_term accordingly (part of fix
wenzelm
parents:
347
diff
changeset
|
94 |
| typ_of tm = |
0 | 95 |
let |
16614 | 96 |
val (t, ts) = Term.strip_comb tm; |
0 | 97 |
val a = |
18 | 98 |
(case t of |
0 | 99 |
Const (x, _) => x |
100 |
| Free (x, _) => x |
|
3778 | 101 |
| _ => raise TERM ("typ_of_term: bad encoding of type", [tm])); |
12317 | 102 |
in Type (a, map typ_of ts) end; |
8895 | 103 |
in typ_of t end; |
0 | 104 |
|
105 |
||
22764 | 106 |
(* decode_term -- transform parse tree into raw term *) |
22704 | 107 |
|
27266
a2db1e379778
added type_constraint (formerly in type_infer.ML, which is now loaded later);
wenzelm
parents:
27197
diff
changeset
|
108 |
fun type_constraint T t = |
a2db1e379778
added type_constraint (formerly in type_infer.ML, which is now loaded later);
wenzelm
parents:
27197
diff
changeset
|
109 |
if T = dummyT then t |
a2db1e379778
added type_constraint (formerly in type_infer.ML, which is now loaded later);
wenzelm
parents:
27197
diff
changeset
|
110 |
else Const ("_type_constraint_", T --> T) $ t; |
a2db1e379778
added type_constraint (formerly in type_infer.ML, which is now loaded later);
wenzelm
parents:
27197
diff
changeset
|
111 |
|
22764 | 112 |
fun decode_term get_sort map_const map_free map_type map_sort tm = |
22704 | 113 |
let |
114 |
val sort_env = term_sorts map_sort tm; |
|
115 |
val decodeT = map_type o typ_of_term (get_sort sort_env) map_sort; |
|
116 |
||
117 |
fun decode (Const ("_constrain", _) $ t $ typ) = |
|
27266
a2db1e379778
added type_constraint (formerly in type_infer.ML, which is now loaded later);
wenzelm
parents:
27197
diff
changeset
|
118 |
type_constraint (decodeT typ) (decode t) |
22704 | 119 |
| decode (Const ("_constrainAbs", _) $ (Abs (x, T, t)) $ typ) = |
120 |
if T = dummyT then Abs (x, decodeT typ, decode t) |
|
27266
a2db1e379778
added type_constraint (formerly in type_infer.ML, which is now loaded later);
wenzelm
parents:
27197
diff
changeset
|
121 |
else type_constraint (decodeT typ --> dummyT) (Abs (x, map_type T, decode t)) |
22704 | 122 |
| decode (Abs (x, T, t)) = Abs (x, map_type T, decode t) |
123 |
| decode (t $ u) = decode t $ decode u |
|
124 |
| decode (Const (a, T)) = |
|
125 |
let val c = |
|
27197
d1b8b6938b23
map_const: soft version, no failure here (recovers hiding of consts, because a hidden name is illegal and rejected later);
wenzelm
parents:
26708
diff
changeset
|
126 |
(case try (unprefix Lexicon.constN) a of SOME c => c | NONE => snd (map_const a)) |
22704 | 127 |
in Const (c, map_type T) end |
128 |
| decode (Free (a, T)) = |
|
129 |
(case (map_free a, map_const a) of |
|
130 |
(SOME x, _) => Free (x, map_type T) |
|
27197
d1b8b6938b23
map_const: soft version, no failure here (recovers hiding of consts, because a hidden name is illegal and rejected later);
wenzelm
parents:
26708
diff
changeset
|
131 |
| (_, (true, c)) => Const (c, map_type T) |
30364
577edc39b501
moved basic algebra of long names from structure NameSpace to Long_Name;
wenzelm
parents:
29565
diff
changeset
|
132 |
| (_, (false, c)) => (if Long_Name.is_qualified c then Const else Free) (c, map_type T)) |
22704 | 133 |
| decode (Var (xi, T)) = Var (xi, map_type T) |
134 |
| decode (t as Bound _) = t; |
|
135 |
in decode tm end; |
|
136 |
||
137 |
||
0 | 138 |
|
2584 | 139 |
(** output utils **) |
140 |
||
2699 | 141 |
(* term_of_sort *) |
2584 | 142 |
|
143 |
fun term_of_sort S = |
|
144 |
let |
|
5690 | 145 |
fun class c = Lexicon.const "_class" $ Lexicon.free c; |
2584 | 146 |
|
147 |
fun classes [] = sys_error "term_of_sort" |
|
148 |
| classes [c] = class c |
|
5690 | 149 |
| classes (c :: cs) = Lexicon.const "_classes" $ class c $ classes cs; |
2584 | 150 |
in |
151 |
(case S of |
|
5690 | 152 |
[] => Lexicon.const "_topsort" |
2584 | 153 |
| [c] => class c |
5690 | 154 |
| cs => Lexicon.const "_sort" $ classes cs) |
2584 | 155 |
end; |
156 |
||
157 |
||
158 |
(* term_of_typ *) |
|
0 | 159 |
|
160 |
fun term_of_typ show_sorts ty = |
|
161 |
let |
|
2584 | 162 |
fun of_sort t S = |
5690 | 163 |
if show_sorts then Lexicon.const "_ofsort" $ t $ term_of_sort S |
2584 | 164 |
else t; |
0 | 165 |
|
16614 | 166 |
fun term_of (Type (a, Ts)) = Term.list_comb (Lexicon.const a, map term_of Ts) |
5690 | 167 |
| term_of (TFree (x, S)) = of_sort (Lexicon.const "_tfree" $ Lexicon.free x) S |
168 |
| term_of (TVar (xi, S)) = of_sort (Lexicon.const "_tvar" $ Lexicon.var xi) S; |
|
8895 | 169 |
in term_of ty end; |
0 | 170 |
|
171 |
||
172 |
||
173 |
(** the type syntax **) |
|
174 |
||
10572 | 175 |
(* print mode *) |
176 |
||
177 |
val bracketsN = "brackets"; |
|
178 |
val no_bracketsN = "no_brackets"; |
|
179 |
||
180 |
fun no_brackets () = |
|
24613 | 181 |
find_first (fn mode => mode = bracketsN orelse mode = no_bracketsN) |
182 |
(print_mode_value ()) = SOME no_bracketsN; |
|
11312 | 183 |
|
184 |
val type_bracketsN = "type_brackets"; |
|
185 |
val no_type_bracketsN = "no_type_brackets"; |
|
186 |
||
187 |
fun no_type_brackets () = |
|
24613 | 188 |
find_first (fn mode => mode = type_bracketsN orelse mode = no_type_bracketsN) |
189 |
(print_mode_value ()) <> SOME type_bracketsN; |
|
10572 | 190 |
|
191 |
||
18 | 192 |
(* parse ast translations *) |
0 | 193 |
|
5690 | 194 |
fun tapp_ast_tr (*"_tapp"*) [ty, f] = Ast.Appl [f, ty] |
195 |
| tapp_ast_tr (*"_tapp"*) asts = raise Ast.AST ("tapp_ast_tr", asts); |
|
347
cd41a57221d0
changed translation of type applications according to new grammar;
wenzelm
parents:
330
diff
changeset
|
196 |
|
cd41a57221d0
changed translation of type applications according to new grammar;
wenzelm
parents:
330
diff
changeset
|
197 |
fun tappl_ast_tr (*"_tappl"*) [ty, tys, f] = |
5690 | 198 |
Ast.Appl (f :: ty :: Ast.unfold_ast "_types" tys) |
199 |
| tappl_ast_tr (*"_tappl"*) asts = raise Ast.AST ("tappl_ast_tr", asts); |
|
0 | 200 |
|
201 |
fun bracket_ast_tr (*"_bracket"*) [dom, cod] = |
|
5690 | 202 |
Ast.fold_ast_p "fun" (Ast.unfold_ast "_types" dom, cod) |
203 |
| bracket_ast_tr (*"_bracket"*) asts = raise Ast.AST ("bracket_ast_tr", asts); |
|
0 | 204 |
|
205 |
||
18 | 206 |
(* print ast translations *) |
0 | 207 |
|
5690 | 208 |
fun tappl_ast_tr' (f, []) = raise Ast.AST ("tappl_ast_tr'", [f]) |
209 |
| tappl_ast_tr' (f, [ty]) = Ast.Appl [Ast.Constant "_tapp", ty, f] |
|
347
cd41a57221d0
changed translation of type applications according to new grammar;
wenzelm
parents:
330
diff
changeset
|
210 |
| tappl_ast_tr' (f, ty :: tys) = |
5690 | 211 |
Ast.Appl [Ast.Constant "_tappl", ty, Ast.fold_ast "_types" tys, f]; |
0 | 212 |
|
213 |
fun fun_ast_tr' (*"fun"*) asts = |
|
16614 | 214 |
if no_brackets () orelse no_type_brackets () then raise Match |
10572 | 215 |
else |
216 |
(case Ast.unfold_ast_p "fun" (Ast.Appl (Ast.Constant "fun" :: asts)) of |
|
217 |
(dom as _ :: _ :: _, cod) |
|
218 |
=> Ast.Appl [Ast.Constant "_bracket", Ast.fold_ast "_types" dom, cod] |
|
219 |
| _ => raise Match); |
|
0 | 220 |
|
221 |
||
222 |
(* type_ext *) |
|
223 |
||
224 |
val sortT = Type ("sort", []); |
|
225 |
val classesT = Type ("classes", []); |
|
226 |
val typesT = Type ("types", []); |
|
227 |
||
5690 | 228 |
local open Lexicon SynExt in |
229 |
||
14903 | 230 |
val type_ext = syn_ext' false (K false) |
347
cd41a57221d0
changed translation of type applications according to new grammar;
wenzelm
parents:
330
diff
changeset
|
231 |
[Mfix ("_", tidT --> typeT, "", [], max_pri), |
239 | 232 |
Mfix ("_", tvarT --> typeT, "", [], max_pri), |
233 |
Mfix ("_", idT --> typeT, "", [], max_pri), |
|
3829 | 234 |
Mfix ("_", longidT --> typeT, "", [], max_pri), |
330
2fda15dd1e0f
changed the way a grammar is generated to allow the new parser to work;
clasohm
parents:
258
diff
changeset
|
235 |
Mfix ("_::_", [tidT, sortT] ---> typeT, "_ofsort", [max_pri, 0], max_pri), |
239 | 236 |
Mfix ("_::_", [tvarT, sortT] ---> typeT, "_ofsort", [max_pri, 0], max_pri), |
14838 | 237 |
Mfix ("'_()::_", sortT --> typeT, "_dummy_ofsort", [0], max_pri), |
239 | 238 |
Mfix ("_", idT --> sortT, "", [], max_pri), |
3829 | 239 |
Mfix ("_", longidT --> sortT, "", [], max_pri), |
2584 | 240 |
Mfix ("{}", sortT, "_topsort", [], max_pri), |
239 | 241 |
Mfix ("{_}", classesT --> sortT, "_sort", [], max_pri), |
242 |
Mfix ("_", idT --> classesT, "", [], max_pri), |
|
3829 | 243 |
Mfix ("_", longidT --> classesT, "", [], max_pri), |
239 | 244 |
Mfix ("_,_", [idT, classesT] ---> classesT, "_classes", [], max_pri), |
3829 | 245 |
Mfix ("_,_", [longidT, classesT] ---> classesT, "_classes", [], max_pri), |
330
2fda15dd1e0f
changed the way a grammar is generated to allow the new parser to work;
clasohm
parents:
258
diff
changeset
|
246 |
Mfix ("_ _", [typeT, idT] ---> typeT, "_tapp", [max_pri, 0], max_pri), |
3829 | 247 |
Mfix ("_ _", [typeT, longidT] ---> typeT, "_tapp", [max_pri, 0], max_pri), |
9067 | 248 |
Mfix ("((1'(_,/ _')) _)", [typeT, typesT, idT] ---> typeT, "_tappl", [], max_pri), |
249 |
Mfix ("((1'(_,/ _')) _)", [typeT, typesT, longidT] ---> typeT, "_tappl", [], max_pri), |
|
239 | 250 |
Mfix ("_", typeT --> typesT, "", [], max_pri), |
251 |
Mfix ("_,/ _", [typeT, typesT] ---> typesT, "_types", [], max_pri), |
|
252 |
Mfix ("(_/ => _)", [typeT, typeT] ---> typeT, "fun", [1, 0], 0), |
|
624 | 253 |
Mfix ("([_]/ => _)", [typesT, typeT] ---> typeT, "_bracket", [0, 0], 0), |
2678 | 254 |
Mfix ("'(_')", typeT --> typeT, "", [0], max_pri), |
255 |
Mfix ("'_", typeT, "dummy", [], max_pri)] |
|
258 | 256 |
[] |
15750 | 257 |
(map SynExt.mk_trfun |
16614 | 258 |
[("_tapp", K tapp_ast_tr), ("_tappl", K tappl_ast_tr), ("_bracket", K bracket_ast_tr)], |
239 | 259 |
[], |
260 |
[], |
|
16614 | 261 |
map SynExt.mk_trfun [("fun", K fun_ast_tr')]) |
26708
fc2e7d2f763d
moved default token translations to proof_context.ML, if all fails the pretty printer falls back on plain output;
wenzelm
parents:
26039
diff
changeset
|
262 |
[] |
239 | 263 |
([], []); |
0 | 264 |
|
265 |
end; |
|
5690 | 266 |
|
267 |
end; |