author | skalberg |
Thu, 03 Mar 2005 12:43:01 +0100 | |
changeset 15570 | 8d8c70b41bab |
parent 15531 | 08c8dad8e399 |
child 16612 | 48be8ef738df |
permissions | -rw-r--r-- |
548 | 1 |
(* Title: Pure/Syntax/syn_trans.ML |
2 |
ID: $Id$ |
|
3 |
Author: Tobias Nipkow and Markus Wenzel, TU Muenchen |
|
4 |
||
5 |
Syntax translation functions. |
|
6 |
*) |
|
7 |
||
8 |
signature SYN_TRANS0 = |
|
2698 | 9 |
sig |
548 | 10 |
val eta_contract: bool ref |
13762 | 11 |
val atomic_abs_tr': string * typ * term -> term * term |
548 | 12 |
val mk_binder_tr: string * string -> string * (term list -> term) |
13 |
val mk_binder_tr': string * string -> string * (term list -> term) |
|
14 |
val dependent_tr': string * string -> term list -> term |
|
8577 | 15 |
val antiquote_tr: string -> term -> term |
16 |
val quote_tr: string -> term -> term |
|
5084 | 17 |
val quote_antiquote_tr: string -> string -> string -> string * (term list -> term) |
8577 | 18 |
val antiquote_tr': string -> term -> term |
19 |
val quote_tr': string -> term -> term |
|
5084 | 20 |
val quote_antiquote_tr': string -> string -> string -> string * (term list -> term) |
2698 | 21 |
val mark_bound: string -> term |
22 |
val mark_boundT: string * typ -> term |
|
23 |
val variant_abs': string * typ * term -> string * term |
|
24 |
end; |
|
548 | 25 |
|
26 |
signature SYN_TRANS1 = |
|
2698 | 27 |
sig |
548 | 28 |
include SYN_TRANS0 |
14647 | 29 |
val non_typed_tr': (term list -> term) -> bool -> typ -> term list -> term |
30 |
val non_typed_tr'': ('a -> term list -> term) -> 'a -> bool -> typ -> term list -> term |
|
1511 | 31 |
val constrainAbsC: string |
32 |
val pure_trfuns: |
|
33 |
(string * (Ast.ast list -> Ast.ast)) list * |
|
548 | 34 |
(string * (term list -> term)) list * |
35 |
(string * (term list -> term)) list * |
|
1511 | 36 |
(string * (Ast.ast list -> Ast.ast)) list |
4148 | 37 |
val pure_trfunsT: (string * (bool -> typ -> term list -> term)) list |
14697 | 38 |
val struct_trfuns: string list -> |
39 |
(string * (Ast.ast list -> Ast.ast)) list * |
|
40 |
(string * (term list -> term)) list * |
|
41 |
(string * (bool -> typ -> term list -> term)) list * |
|
42 |
(string * (Ast.ast list -> Ast.ast)) list |
|
2698 | 43 |
end; |
548 | 44 |
|
45 |
signature SYN_TRANS = |
|
2698 | 46 |
sig |
548 | 47 |
include SYN_TRANS1 |
1511 | 48 |
val abs_tr': term -> term |
4148 | 49 |
val prop_tr': term -> term |
1511 | 50 |
val appl_ast_tr': Ast.ast * Ast.ast list -> Ast.ast |
51 |
val applC_ast_tr': Ast.ast * Ast.ast list -> Ast.ast |
|
14798
702cb4859cab
Modified functions pt_to_ast and ast_to_term to improve handling
berghofe
parents:
14697
diff
changeset
|
52 |
val pts_to_asts: (string -> (Ast.ast list -> Ast.ast) option) -> Parser.parsetree list -> Ast.ast list |
702cb4859cab
Modified functions pt_to_ast and ast_to_term to improve handling
berghofe
parents:
14697
diff
changeset
|
53 |
val asts_to_terms: (string -> (term list -> term) option) -> Ast.ast list -> term list |
2698 | 54 |
end; |
548 | 55 |
|
2698 | 56 |
structure SynTrans: SYN_TRANS = |
548 | 57 |
struct |
2698 | 58 |
|
59 |
||
548 | 60 |
(** parse (ast) translations **) |
61 |
||
11491 | 62 |
(* constify *) |
63 |
||
64 |
fun constify_ast_tr [Ast.Variable c] = Ast.Constant c |
|
65 |
| constify_ast_tr asts = raise Ast.AST ("constify_ast_tr", asts); |
|
66 |
||
67 |
||
548 | 68 |
(* application *) |
69 |
||
5690 | 70 |
fun appl_ast_tr [f, args] = Ast.Appl (f :: Ast.unfold_ast "_args" args) |
71 |
| appl_ast_tr asts = raise Ast.AST ("appl_ast_tr", asts); |
|
922
196ca0973a6d
added CPure (curried functions) and ProtoPure (ancestor of Pure and CPure)
clasohm
parents:
639
diff
changeset
|
72 |
|
5690 | 73 |
fun applC_ast_tr [f, args] = Ast.Appl (f :: Ast.unfold_ast "_cargs" args) |
74 |
| applC_ast_tr asts = raise Ast.AST ("applC_ast_tr", asts); |
|
548 | 75 |
|
76 |
||
77 |
(* abstraction *) |
|
78 |
||
5690 | 79 |
fun idtyp_ast_tr (*"_idtyp"*) [x, ty] = Ast.Appl [Ast.Constant SynExt.constrainC, x, ty] |
80 |
| idtyp_ast_tr (*"_idtyp"*) asts = raise Ast.AST ("idtyp_ast_tr", asts); |
|
548 | 81 |
|
3691
f0396ac63e12
tuned lambda_ast_tr, idtyp_ast_tr' to accomodate fix of idt/idts
wenzelm
parents:
2698
diff
changeset
|
82 |
fun lambda_ast_tr (*"_lambda"*) [pats, body] = |
5690 | 83 |
Ast.fold_ast_p "_abs" (Ast.unfold_ast "_pttrns" pats, body) |
84 |
| lambda_ast_tr (*"_lambda"*) asts = raise Ast.AST ("lambda_ast_tr", asts); |
|
548 | 85 |
|
86 |
val constrainAbsC = "_constrainAbs"; |
|
87 |
||
5690 | 88 |
fun abs_tr (*"_abs"*) [Free (x, T), body] = Term.absfree (x, T, body) |
548 | 89 |
| abs_tr (*"_abs"*) (ts as [Const (c, _) $ Free (x, T) $ tT, body]) = |
5690 | 90 |
if c = SynExt.constrainC |
91 |
then Lexicon.const constrainAbsC $ Term.absfree (x, T, body) $ tT |
|
3777 | 92 |
else raise TERM ("abs_tr", ts) |
93 |
| abs_tr (*"_abs"*) ts = raise TERM ("abs_tr", ts); |
|
548 | 94 |
|
95 |
||
96 |
(* nondependent abstraction *) |
|
97 |
||
5690 | 98 |
fun k_tr (*"_K"*) [t] = Abs ("uu", dummyT, Term.incr_boundvars 1 t) |
3777 | 99 |
| k_tr (*"_K"*) ts = raise TERM ("k_tr", ts); |
548 | 100 |
|
101 |
||
102 |
(* binder *) |
|
103 |
||
104 |
fun mk_binder_tr (sy, name) = |
|
105 |
let |
|
5690 | 106 |
fun tr (Free (x, T), t) = Lexicon.const name $ Term.absfree (x, T, t) |
548 | 107 |
| tr (Const ("_idts", _) $ idt $ idts, t) = tr (idt, tr (idts, t)) |
108 |
| tr (t1 as Const (c, _) $ Free (x, T) $ tT, t) = |
|
5690 | 109 |
if c = SynExt.constrainC then |
110 |
Lexicon.const name $ (Lexicon.const constrainAbsC $ Term.absfree (x, T, t) $ tT) |
|
3777 | 111 |
else raise TERM ("binder_tr", [t1, t]) |
112 |
| tr (t1, t2) = raise TERM ("binder_tr", [t1, t2]); |
|
548 | 113 |
|
114 |
fun binder_tr (*sy*) [idts, body] = tr (idts, body) |
|
3777 | 115 |
| binder_tr (*sy*) ts = raise TERM ("binder_tr", ts); |
548 | 116 |
in |
117 |
(sy, binder_tr) |
|
118 |
end; |
|
119 |
||
120 |
||
121 |
(* meta propositions *) |
|
122 |
||
5690 | 123 |
fun aprop_tr (*"_aprop"*) [t] = Lexicon.const SynExt.constrainC $ t $ Lexicon.const "prop" |
3777 | 124 |
| aprop_tr (*"_aprop"*) ts = raise TERM ("aprop_tr", ts); |
548 | 125 |
|
126 |
fun ofclass_tr (*"_ofclass"*) [ty, cls] = |
|
5690 | 127 |
cls $ (Lexicon.const SynExt.constrainC $ Lexicon.const "TYPE" $ |
128 |
(Lexicon.const "itself" $ ty)) |
|
3777 | 129 |
| ofclass_tr (*"_ofclass"*) ts = raise TERM ("ofclass_tr", ts); |
548 | 130 |
|
131 |
||
132 |
(* meta implication *) |
|
133 |
||
134 |
fun bigimpl_ast_tr (*"_bigimpl"*) [asms, concl] = |
|
15421
fcf747c0b6b8
Syntax: last premise of "_bigimpl" is wrapped with "_asm", to have a hook for
schirmer
parents:
14981
diff
changeset
|
135 |
Ast.fold_ast_p "==>" (Ast.unfold_ast2 "_asms" "_asm" asms, concl) |
fcf747c0b6b8
Syntax: last premise of "_bigimpl" is wrapped with "_asm", to have a hook for
schirmer
parents:
14981
diff
changeset
|
136 |
| bigimpl_ast_tr (*"_bigimpl"*) asts = raise Ast.AST ("bigimpl_ast_tr", asts); |
fcf747c0b6b8
Syntax: last premise of "_bigimpl" is wrapped with "_asm", to have a hook for
schirmer
parents:
14981
diff
changeset
|
137 |
|
fcf747c0b6b8
Syntax: last premise of "_bigimpl" is wrapped with "_asm", to have a hook for
schirmer
parents:
14981
diff
changeset
|
138 |
(* |
fcf747c0b6b8
Syntax: last premise of "_bigimpl" is wrapped with "_asm", to have a hook for
schirmer
parents:
14981
diff
changeset
|
139 |
fun bigimpl_ast_tr (*"_bigimpl"*) [asms, concl] = |
5690 | 140 |
Ast.fold_ast_p "==>" (Ast.unfold_ast "_asms" asms, concl) |
141 |
| bigimpl_ast_tr (*"_bigimpl"*) asts = raise Ast.AST ("bigimpl_ast_tr", asts); |
|
15421
fcf747c0b6b8
Syntax: last premise of "_bigimpl" is wrapped with "_asm", to have a hook for
schirmer
parents:
14981
diff
changeset
|
142 |
*) |
548 | 143 |
|
4148 | 144 |
(* type reflection *) |
145 |
||
146 |
fun type_tr (*"_TYPE"*) [ty] = |
|
5690 | 147 |
Lexicon.const SynExt.constrainC $ Lexicon.const "TYPE" $ (Lexicon.const "itself" $ ty) |
4148 | 148 |
| type_tr (*"_TYPE"*) ts = raise TERM ("type_tr", ts); |
149 |
||
548 | 150 |
|
6761 | 151 |
(* dddot *) |
152 |
||
8595 | 153 |
fun dddot_tr (*"_DDDOT"*) ts = Term.list_comb (Lexicon.var SynExt.dddot_indexname, ts); |
6761 | 154 |
|
155 |
||
5084 | 156 |
(* quote / antiquote *) |
157 |
||
8577 | 158 |
fun antiquote_tr name = |
159 |
let |
|
160 |
fun tr i ((t as Const (c, _)) $ u) = |
|
161 |
if c = name then tr i u $ Bound i |
|
162 |
else tr i t $ tr i u |
|
163 |
| tr i (t $ u) = tr i t $ tr i u |
|
164 |
| tr i (Abs (x, T, t)) = Abs (x, T, tr (i + 1) t) |
|
165 |
| tr _ a = a; |
|
166 |
in tr 0 end; |
|
167 |
||
168 |
fun quote_tr name t = Abs ("s", dummyT, antiquote_tr name (Term.incr_boundvars 1 t)); |
|
169 |
||
5084 | 170 |
fun quote_antiquote_tr quoteN antiquoteN name = |
171 |
let |
|
8577 | 172 |
fun tr [t] = Lexicon.const name $ quote_tr antiquoteN t |
173 |
| tr ts = raise TERM ("quote_tr", ts); |
|
174 |
in (quoteN, tr) end; |
|
5084 | 175 |
|
176 |
||
14697 | 177 |
(* indexed syntax *) |
178 |
||
179 |
fun struct_ast_tr (*"_struct"*) [Ast.Appl [Ast.Constant "_index", ast]] = ast |
|
180 |
| struct_ast_tr (*"_struct"*) asts = Ast.mk_appl (Ast.Constant "_struct") asts; |
|
181 |
||
182 |
fun index_ast_tr ast = |
|
183 |
Ast.mk_appl (Ast.Constant "_index") [Ast.mk_appl (Ast.Constant "_struct") [ast]]; |
|
184 |
||
185 |
fun indexdefault_ast_tr (*"_indexdefault"*) [] = |
|
186 |
index_ast_tr (Ast.Constant "_indexdefault") |
|
187 |
| indexdefault_ast_tr (*"_indexdefault"*) asts = |
|
188 |
raise Ast.AST ("indexdefault_ast_tr", asts); |
|
189 |
||
190 |
fun indexnum_ast_tr (*"_indexnum"*) [ast] = |
|
191 |
index_ast_tr (Ast.mk_appl (Ast.Constant "_indexnum") [ast]) |
|
192 |
| indexnum_ast_tr (*"_indexnum"*) asts = raise Ast.AST ("indexnum_ast_tr", asts); |
|
12122 | 193 |
|
14697 | 194 |
fun indexvar_ast_tr (*"_indexvar"*) [] = |
195 |
Ast.mk_appl (Ast.Constant "_index") [Ast.Variable "some_index"] |
|
196 |
| indexvar_ast_tr (*"_indexvar"*) asts = raise Ast.AST ("indexvar_ast_tr", asts); |
|
197 |
||
198 |
fun index_tr (*"_index"*) [t] = t |
|
199 |
| index_tr (*"_index"*) ts = raise TERM ("index_tr", ts); |
|
200 |
||
201 |
||
202 |
(* implicit structures *) |
|
203 |
||
204 |
fun the_struct structs i = |
|
15570 | 205 |
if 1 <= i andalso i <= length structs then List.nth (structs, i - 1) |
14697 | 206 |
else raise ERROR_MESSAGE ("Illegal reference to implicit structure #" ^ string_of_int i); |
207 |
||
208 |
fun struct_tr structs (*"_struct"*) [Const ("_indexdefault", _)] = |
|
209 |
Lexicon.free (the_struct structs 1) |
|
210 |
| struct_tr structs (*"_struct"*) [t as (Const ("_indexnum", _) $ Const (s, _))] = |
|
211 |
Lexicon.free (the_struct structs |
|
15531 | 212 |
(case Lexicon.read_nat s of SOME n => n | NONE => raise TERM ("struct_tr", [t]))) |
14697 | 213 |
| struct_tr _ (*"_struct"*) ts = raise TERM ("struct_tr", ts); |
12122 | 214 |
|
215 |
||
5084 | 216 |
|
548 | 217 |
(** print (ast) translations **) |
218 |
||
14647 | 219 |
(* types *) |
220 |
||
221 |
fun non_typed_tr' f _ _ ts = f ts; |
|
222 |
fun non_typed_tr'' f x _ _ ts = f x ts; |
|
223 |
||
224 |
||
548 | 225 |
(* application *) |
226 |
||
5690 | 227 |
fun appl_ast_tr' (f, []) = raise Ast.AST ("appl_ast_tr'", [f]) |
228 |
| appl_ast_tr' (f, args) = Ast.Appl [Ast.Constant "_appl", f, Ast.fold_ast "_args" args]; |
|
548 | 229 |
|
5690 | 230 |
fun applC_ast_tr' (f, []) = raise Ast.AST ("applC_ast_tr'", [f]) |
231 |
| applC_ast_tr' (f, args) = Ast.Appl [Ast.Constant "_applC", f, Ast.fold_ast "_cargs" args]; |
|
922
196ca0973a6d
added CPure (curried functions) and ProtoPure (ancestor of Pure and CPure)
clasohm
parents:
639
diff
changeset
|
232 |
|
548 | 233 |
|
234 |
(* abstraction *) |
|
235 |
||
5690 | 236 |
fun mark_boundT x_T = Lexicon.const "_bound" $ Free x_T; |
2698 | 237 |
fun mark_bound x = mark_boundT (x, dummyT); |
238 |
||
548 | 239 |
fun strip_abss vars_of body_of tm = |
240 |
let |
|
241 |
val vars = vars_of tm; |
|
242 |
val body = body_of tm; |
|
243 |
val rev_new_vars = rename_wrt_term body vars; |
|
244 |
in |
|
2698 | 245 |
(map mark_boundT (rev rev_new_vars), |
246 |
subst_bounds (map (mark_bound o #1) rev_new_vars, body)) |
|
548 | 247 |
end; |
248 |
||
3928
787d2659ce4a
no longer tries bogus eta-contract involving aprops;
wenzelm
parents:
3777
diff
changeset
|
249 |
|
548 | 250 |
(*do (partial) eta-contraction before printing*) |
251 |
||
1326 | 252 |
val eta_contract = ref true; |
548 | 253 |
|
254 |
fun eta_contr tm = |
|
255 |
let |
|
3928
787d2659ce4a
no longer tries bogus eta-contract involving aprops;
wenzelm
parents:
3777
diff
changeset
|
256 |
fun is_aprop (Const ("_aprop", _)) = true |
787d2659ce4a
no longer tries bogus eta-contract involving aprops;
wenzelm
parents:
3777
diff
changeset
|
257 |
| is_aprop _ = false; |
787d2659ce4a
no longer tries bogus eta-contract involving aprops;
wenzelm
parents:
3777
diff
changeset
|
258 |
|
548 | 259 |
fun eta_abs (Abs (a, T, t)) = |
260 |
(case eta_abs t of |
|
261 |
t' as f $ u => |
|
262 |
(case eta_abs u of |
|
263 |
Bound 0 => |
|
5084 | 264 |
if Term.loose_bvar1 (f, 0) orelse is_aprop f then Abs (a, T, t') |
3928
787d2659ce4a
no longer tries bogus eta-contract involving aprops;
wenzelm
parents:
3777
diff
changeset
|
265 |
else incr_boundvars ~1 f |
548 | 266 |
| _ => Abs (a, T, t')) |
267 |
| t' => Abs (a, T, t')) |
|
268 |
| eta_abs t = t; |
|
269 |
in |
|
270 |
if ! eta_contract then eta_abs tm else tm |
|
271 |
end; |
|
272 |
||
273 |
||
274 |
fun abs_tr' tm = |
|
15570 | 275 |
Library.foldr (fn (x, t) => Lexicon.const "_abs" $ x $ t) |
548 | 276 |
(strip_abss strip_abs_vars strip_abs_body (eta_contr tm)); |
277 |
||
14697 | 278 |
fun atomic_abs_tr' (x, T, t) = |
279 |
let val [xT] = rename_wrt_term t [(x, T)] |
|
280 |
in (mark_boundT xT, subst_bound (mark_bound (fst xT), t)) end; |
|
13762 | 281 |
|
548 | 282 |
fun abs_ast_tr' (*"_abs"*) asts = |
5690 | 283 |
(case Ast.unfold_ast_p "_abs" (Ast.Appl (Ast.Constant "_abs" :: asts)) of |
284 |
([], _) => raise Ast.AST ("abs_ast_tr'", asts) |
|
285 |
| (xs, body) => Ast.Appl [Ast.Constant "_lambda", Ast.fold_ast "_pttrns" xs, body]); |
|
548 | 286 |
|
287 |
||
288 |
(* binder *) |
|
289 |
||
290 |
fun mk_binder_tr' (name, sy) = |
|
291 |
let |
|
292 |
fun mk_idts [] = raise Match (*abort translation*) |
|
293 |
| mk_idts [idt] = idt |
|
5690 | 294 |
| mk_idts (idt :: idts) = Lexicon.const "_idts" $ idt $ mk_idts idts; |
548 | 295 |
|
296 |
fun tr' t = |
|
297 |
let |
|
298 |
val (xs, bd) = strip_abss (strip_qnt_vars name) (strip_qnt_body name) t; |
|
5690 | 299 |
in Lexicon.const sy $ mk_idts xs $ bd end; |
548 | 300 |
|
5690 | 301 |
fun binder_tr' (*name*) (t :: ts) = Term.list_comb (tr' (Lexicon.const name $ t), ts) |
548 | 302 |
| binder_tr' (*name*) [] = raise Match; |
303 |
in |
|
304 |
(name, binder_tr') |
|
305 |
end; |
|
306 |
||
307 |
||
3691
f0396ac63e12
tuned lambda_ast_tr, idtyp_ast_tr' to accomodate fix of idt/idts
wenzelm
parents:
2698
diff
changeset
|
308 |
(* idtyp constraints *) |
548 | 309 |
|
5690 | 310 |
fun idtyp_ast_tr' a [Ast.Appl [Ast.Constant c, x, ty], xs] = |
311 |
if c = SynExt.constrainC then |
|
312 |
Ast.Appl [ Ast.Constant a, Ast.Appl [Ast.Constant "_idtyp", x, ty], xs] |
|
548 | 313 |
else raise Match |
3691
f0396ac63e12
tuned lambda_ast_tr, idtyp_ast_tr' to accomodate fix of idt/idts
wenzelm
parents:
2698
diff
changeset
|
314 |
| idtyp_ast_tr' _ _ = raise Match; |
548 | 315 |
|
316 |
||
317 |
(* meta propositions *) |
|
318 |
||
4148 | 319 |
fun prop_tr' tm = |
548 | 320 |
let |
5690 | 321 |
fun aprop t = Lexicon.const "_aprop" $ t; |
548 | 322 |
|
2698 | 323 |
fun is_prop Ts t = |
324 |
fastype_of1 (Ts, t) = propT handle TERM _ => false; |
|
548 | 325 |
|
326 |
fun tr' _ (t as Const _) = t |
|
2698 | 327 |
| tr' _ (t as Free (x, T)) = |
5690 | 328 |
if T = propT then aprop (Lexicon.free x) else t |
2698 | 329 |
| tr' _ (t as Var (xi, T)) = |
5690 | 330 |
if T = propT then aprop (Lexicon.var xi) else t |
2698 | 331 |
| tr' Ts (t as Bound _) = |
332 |
if is_prop Ts t then aprop t else t |
|
333 |
| tr' Ts (Abs (x, T, t)) = Abs (x, T, tr' (T :: Ts) t) |
|
334 |
| tr' Ts (t as t1 $ (t2 as Const ("TYPE", Type ("itself", [T])))) = |
|
4148 | 335 |
if is_prop Ts t then Const ("_mk_ofclass", T) $ tr' Ts t1 |
2698 | 336 |
else tr' Ts t1 $ tr' Ts t2 |
337 |
| tr' Ts (t as t1 $ t2) = |
|
5690 | 338 |
(if is_Const (Term.head_of t) orelse not (is_prop Ts t) |
2698 | 339 |
then I else aprop) (tr' Ts t1 $ tr' Ts t2); |
548 | 340 |
in |
341 |
tr' [] tm |
|
342 |
end; |
|
343 |
||
4148 | 344 |
fun mk_ofclass_tr' show_sorts (*"_mk_ofclass"*) T [t] = |
5690 | 345 |
Lexicon.const "_ofclass" $ TypeExt.term_of_typ show_sorts T $ t |
4148 | 346 |
| mk_ofclass_tr' _ (*"_mk_ofclass"*) T ts = raise TYPE ("mk_ofclass_tr'", [T], ts); |
2698 | 347 |
|
348 |
||
548 | 349 |
(* meta implication *) |
350 |
||
351 |
fun impl_ast_tr' (*"==>"*) asts = |
|
10572 | 352 |
if TypeExt.no_brackets () then raise Match |
353 |
else |
|
354 |
(case Ast.unfold_ast_p "==>" (Ast.Appl (Ast.Constant "==>" :: asts)) of |
|
355 |
(asms as _ :: _ :: _, concl) |
|
15421
fcf747c0b6b8
Syntax: last premise of "_bigimpl" is wrapped with "_asm", to have a hook for
schirmer
parents:
14981
diff
changeset
|
356 |
=> Ast.Appl [Ast.Constant "_bigimpl", Ast.fold_ast2 "_asms" "_asm" asms, concl] |
fcf747c0b6b8
Syntax: last premise of "_bigimpl" is wrapped with "_asm", to have a hook for
schirmer
parents:
14981
diff
changeset
|
357 |
| _ => raise Match); |
fcf747c0b6b8
Syntax: last premise of "_bigimpl" is wrapped with "_asm", to have a hook for
schirmer
parents:
14981
diff
changeset
|
358 |
|
fcf747c0b6b8
Syntax: last premise of "_bigimpl" is wrapped with "_asm", to have a hook for
schirmer
parents:
14981
diff
changeset
|
359 |
(* |
fcf747c0b6b8
Syntax: last premise of "_bigimpl" is wrapped with "_asm", to have a hook for
schirmer
parents:
14981
diff
changeset
|
360 |
fun impl_ast_tr' (*"==>"*) asts = |
fcf747c0b6b8
Syntax: last premise of "_bigimpl" is wrapped with "_asm", to have a hook for
schirmer
parents:
14981
diff
changeset
|
361 |
if TypeExt.no_brackets () then raise Match |
fcf747c0b6b8
Syntax: last premise of "_bigimpl" is wrapped with "_asm", to have a hook for
schirmer
parents:
14981
diff
changeset
|
362 |
else |
fcf747c0b6b8
Syntax: last premise of "_bigimpl" is wrapped with "_asm", to have a hook for
schirmer
parents:
14981
diff
changeset
|
363 |
(case Ast.unfold_ast_p "==>" (Ast.Appl (Ast.Constant "==>" :: asts)) of |
fcf747c0b6b8
Syntax: last premise of "_bigimpl" is wrapped with "_asm", to have a hook for
schirmer
parents:
14981
diff
changeset
|
364 |
(asms as _ :: _ :: _, concl) |
10572 | 365 |
=> Ast.Appl [Ast.Constant "_bigimpl", Ast.fold_ast "_asms" asms, concl] |
366 |
| _ => raise Match); |
|
15421
fcf747c0b6b8
Syntax: last premise of "_bigimpl" is wrapped with "_asm", to have a hook for
schirmer
parents:
14981
diff
changeset
|
367 |
*) |
548 | 368 |
|
12150 | 369 |
(* meta conjunction *) |
370 |
||
371 |
fun meta_conjunction_tr' (*"all"*) |
|
372 |
[Abs (_, _, Const ("==>", _) $ |
|
373 |
(Const ("==>", _) $ A $ (Const ("==>", _) $ B $ (Const ("_aprop", _) $ Bound 0))) $ |
|
374 |
(Const ("_aprop", _) $ Bound 0))] = |
|
375 |
if 0 mem_int Term.loose_bnos A orelse 0 mem_int Term.loose_bnos B then raise Match |
|
376 |
else Lexicon.const "_meta_conjunction" $ A $ B |
|
377 |
| meta_conjunction_tr' (*"all"*) ts = raise Match; |
|
378 |
||
379 |
||
4148 | 380 |
(* type reflection *) |
381 |
||
382 |
fun type_tr' show_sorts (*"TYPE"*) (Type ("itself", [T])) ts = |
|
5690 | 383 |
Term.list_comb (Lexicon.const "_TYPE" $ TypeExt.term_of_typ show_sorts T, ts) |
4148 | 384 |
| type_tr' _ _ _ = raise Match; |
385 |
||
386 |
||
548 | 387 |
(* dependent / nondependent quantifiers *) |
388 |
||
2698 | 389 |
fun variant_abs' (x, T, B) = |
390 |
let val x' = variant (add_term_names (B, [])) x in |
|
391 |
(x', subst_bound (mark_boundT (x', T), B)) |
|
392 |
end; |
|
393 |
||
548 | 394 |
fun dependent_tr' (q, r) (A :: Abs (x, T, B) :: ts) = |
5084 | 395 |
if Term.loose_bvar1 (B, 0) then |
2698 | 396 |
let val (x', B') = variant_abs' (x, dummyT, B); |
5690 | 397 |
in Term.list_comb (Lexicon.const q $ mark_boundT (x', T) $ A $ B', ts) end |
398 |
else Term.list_comb (Lexicon.const r $ A $ B, ts) |
|
548 | 399 |
| dependent_tr' _ _ = raise Match; |
400 |
||
401 |
||
5084 | 402 |
(* quote / antiquote *) |
403 |
||
8577 | 404 |
fun antiquote_tr' name = |
405 |
let |
|
406 |
fun tr' i (t $ u) = |
|
407 |
if u = Bound i then Lexicon.const name $ tr' i t |
|
408 |
else tr' i t $ tr' i u |
|
409 |
| tr' i (Abs (x, T, t)) = Abs (x, T, tr' (i + 1) t) |
|
410 |
| tr' i a = if a = Bound i then raise Match else a; |
|
411 |
in tr' 0 end; |
|
412 |
||
413 |
fun quote_tr' name (Abs (_, _, t)) = Term.incr_boundvars ~1 (antiquote_tr' name t) |
|
414 |
| quote_tr' _ _ = raise Match; |
|
415 |
||
5084 | 416 |
fun quote_antiquote_tr' quoteN antiquoteN name = |
417 |
let |
|
8577 | 418 |
fun tr' (t :: ts) = Term.list_comb (Lexicon.const quoteN $ quote_tr' antiquoteN t, ts) |
419 |
| tr' _ = raise Match; |
|
420 |
in (name, tr') end; |
|
5084 | 421 |
|
422 |
||
14697 | 423 |
(* indexed syntax *) |
548 | 424 |
|
14697 | 425 |
fun index_ast_tr' (*"_index"*) [Ast.Appl [Ast.Constant "_struct", ast]] = ast |
426 |
| index_ast_tr' _ = raise Match; |
|
427 |
||
428 |
||
429 |
(* implicit structures *) |
|
430 |
||
431 |
fun the_struct' structs s = |
|
432 |
[(case Lexicon.read_nat s of |
|
15531 | 433 |
SOME i => Ast.Variable (the_struct structs i handle ERROR_MESSAGE _ => raise Match) |
434 |
| NONE => raise Match)] |> Ast.mk_appl (Ast.Constant "_free"); |
|
14697 | 435 |
; |
436 |
||
437 |
fun struct_ast_tr' structs (*"_struct"*) [Ast.Constant "_indexdefault"] = |
|
438 |
the_struct' structs "1" |
|
439 |
| struct_ast_tr' structs (*"_struct"*) [Ast.Appl [Ast.Constant "_indexnum", Ast.Constant s]] = |
|
440 |
the_struct' structs s |
|
441 |
| struct_ast_tr' _ _ = raise Match; |
|
442 |
||
443 |
||
444 |
||
445 |
(** Pure translations **) |
|
548 | 446 |
|
447 |
val pure_trfuns = |
|
11491 | 448 |
([("_constify", constify_ast_tr), ("_appl", appl_ast_tr), ("_applC", applC_ast_tr), |
12122 | 449 |
("_lambda", lambda_ast_tr), ("_idtyp", idtyp_ast_tr), ("_bigimpl", bigimpl_ast_tr), |
14697 | 450 |
("_indexdefault", indexdefault_ast_tr), ("_indexnum", indexnum_ast_tr), |
451 |
("_indexvar", indexvar_ast_tr), ("_struct", struct_ast_tr)], |
|
922
196ca0973a6d
added CPure (curried functions) and ProtoPure (ancestor of Pure and CPure)
clasohm
parents:
639
diff
changeset
|
452 |
[("_abs", abs_tr), ("_aprop", aprop_tr), ("_ofclass", ofclass_tr), |
14697 | 453 |
("_TYPE", type_tr), ("_DDDOT", dddot_tr), ("_K", k_tr), |
454 |
("_index", index_tr)], |
|
12150 | 455 |
[("all", meta_conjunction_tr')], |
3691
f0396ac63e12
tuned lambda_ast_tr, idtyp_ast_tr' to accomodate fix of idt/idts
wenzelm
parents:
2698
diff
changeset
|
456 |
[("_abs", abs_ast_tr'), ("_idts", idtyp_ast_tr' "_idts"), |
14697 | 457 |
("_pttrns", idtyp_ast_tr' "_pttrns"), ("==>", impl_ast_tr'), |
458 |
("_index", index_ast_tr')]); |
|
548 | 459 |
|
2698 | 460 |
val pure_trfunsT = |
4148 | 461 |
[("_mk_ofclass", mk_ofclass_tr'), ("TYPE", type_tr')]; |
2698 | 462 |
|
14697 | 463 |
fun struct_trfuns structs = |
464 |
([], [("_struct", struct_tr structs)], [], [("_struct", struct_ast_tr' structs)]); |
|
465 |
||
548 | 466 |
|
467 |
||
14868 | 468 |
(** pts_to_asts **) |
548 | 469 |
|
14868 | 470 |
exception TRANSLATION of string * exn; |
14798
702cb4859cab
Modified functions pt_to_ast and ast_to_term to improve handling
berghofe
parents:
14697
diff
changeset
|
471 |
|
702cb4859cab
Modified functions pt_to_ast and ast_to_term to improve handling
berghofe
parents:
14697
diff
changeset
|
472 |
fun pts_to_asts trf pts = |
548 | 473 |
let |
474 |
fun trans a args = |
|
475 |
(case trf a of |
|
15531 | 476 |
NONE => Ast.mk_appl (Ast.Constant a) args |
477 |
| SOME f => f args handle exn => raise TRANSLATION (a, exn)); |
|
548 | 478 |
|
987 | 479 |
(*translate pt bottom-up*) |
5690 | 480 |
fun ast_of (Parser.Node (a, pts)) = trans a (map ast_of pts) |
481 |
| ast_of (Parser.Tip tok) = Ast.Variable (Lexicon.str_of_token tok); |
|
14798
702cb4859cab
Modified functions pt_to_ast and ast_to_term to improve handling
berghofe
parents:
14697
diff
changeset
|
482 |
|
14868 | 483 |
val exn_results = map (capture ast_of) pts; |
15570 | 484 |
val exns = List.mapPartial get_exn exn_results; |
485 |
val results = List.mapPartial get_result exn_results |
|
548 | 486 |
in |
14868 | 487 |
(case (results, exns) of |
488 |
([], TRANSLATION (a, exn) :: _) => |
|
489 |
(writeln ("Error in parse ast translation for " ^ quote a); raise exn) |
|
490 |
| _ => results) |
|
548 | 491 |
end; |
492 |
||
493 |
||
494 |
||
14798
702cb4859cab
Modified functions pt_to_ast and ast_to_term to improve handling
berghofe
parents:
14697
diff
changeset
|
495 |
(** asts_to_terms **) |
548 | 496 |
|
14798
702cb4859cab
Modified functions pt_to_ast and ast_to_term to improve handling
berghofe
parents:
14697
diff
changeset
|
497 |
fun asts_to_terms trf asts = |
548 | 498 |
let |
499 |
fun trans a args = |
|
500 |
(case trf a of |
|
15531 | 501 |
NONE => Term.list_comb (Lexicon.const a, args) |
502 |
| SOME f => f args handle exn => raise TRANSLATION (a, exn)); |
|
548 | 503 |
|
5690 | 504 |
fun term_of (Ast.Constant a) = trans a [] |
505 |
| term_of (Ast.Variable x) = Lexicon.read_var x |
|
506 |
| term_of (Ast.Appl (Ast.Constant a :: (asts as _ :: _))) = |
|
548 | 507 |
trans a (map term_of asts) |
5690 | 508 |
| term_of (Ast.Appl (ast :: (asts as _ :: _))) = |
509 |
Term.list_comb (term_of ast, map term_of asts) |
|
510 |
| term_of (ast as Ast.Appl _) = raise Ast.AST ("ast_to_term: malformed ast", [ast]); |
|
14798
702cb4859cab
Modified functions pt_to_ast and ast_to_term to improve handling
berghofe
parents:
14697
diff
changeset
|
511 |
|
14868 | 512 |
val exn_results = map (capture term_of) asts; |
15570 | 513 |
val exns = List.mapPartial get_exn exn_results; |
514 |
val results = List.mapPartial get_result exn_results |
|
548 | 515 |
in |
14868 | 516 |
(case (results, exns) of |
517 |
([], TRANSLATION (a, exn) :: _) => |
|
518 |
(writeln ("Error in parse translation for " ^ quote a); raise exn) |
|
519 |
| _ => results) |
|
548 | 520 |
end; |
521 |
||
522 |
end; |