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