author | wenzelm |
Sun, 10 Dec 2006 15:30:53 +0100 | |
changeset 21750 | 41986849fee0 |
parent 21535 | 07f8cd0d7962 |
child 21773 | 0038f5fc2065 |
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 |
|
18958 | 23 |
val bound_vars: (string * typ) list -> term -> term |
20202 | 24 |
val variant_abs: string * typ * term -> string * term |
2698 | 25 |
val variant_abs': string * typ * term -> string * term |
26 |
end; |
|
548 | 27 |
|
28 |
signature SYN_TRANS1 = |
|
2698 | 29 |
sig |
548 | 30 |
include SYN_TRANS0 |
14647 | 31 |
val non_typed_tr': (term list -> term) -> bool -> typ -> term list -> term |
32 |
val non_typed_tr'': ('a -> term list -> term) -> 'a -> bool -> typ -> term list -> term |
|
1511 | 33 |
val constrainAbsC: string |
34 |
val pure_trfuns: |
|
35 |
(string * (Ast.ast list -> Ast.ast)) list * |
|
548 | 36 |
(string * (term list -> term)) list * |
37 |
(string * (term list -> term)) list * |
|
1511 | 38 |
(string * (Ast.ast list -> Ast.ast)) list |
4148 | 39 |
val pure_trfunsT: (string * (bool -> typ -> term list -> term)) list |
14697 | 40 |
val struct_trfuns: string list -> |
41 |
(string * (Ast.ast list -> Ast.ast)) list * |
|
42 |
(string * (term list -> term)) list * |
|
43 |
(string * (bool -> typ -> term list -> term)) list * |
|
44 |
(string * (Ast.ast list -> Ast.ast)) list |
|
2698 | 45 |
end; |
548 | 46 |
|
47 |
signature SYN_TRANS = |
|
2698 | 48 |
sig |
548 | 49 |
include SYN_TRANS1 |
1511 | 50 |
val abs_tr': term -> term |
4148 | 51 |
val prop_tr': term -> term |
1511 | 52 |
val appl_ast_tr': Ast.ast * Ast.ast list -> Ast.ast |
53 |
val applC_ast_tr': Ast.ast * Ast.ast list -> Ast.ast |
|
18857 | 54 |
val pts_to_asts: Context.generic -> |
55 |
(string -> (Context.generic -> Ast.ast list -> Ast.ast) option) -> |
|
16612
48be8ef738df
transform_failure in translation functions: TRANSLATION_FAIL;
wenzelm
parents:
15570
diff
changeset
|
56 |
Parser.parsetree list -> Ast.ast list |
18857 | 57 |
val asts_to_terms: Context.generic -> |
58 |
(string -> (Context.generic -> term list -> term) option) -> Ast.ast list -> term list |
|
2698 | 59 |
end; |
548 | 60 |
|
2698 | 61 |
structure SynTrans: SYN_TRANS = |
548 | 62 |
struct |
2698 | 63 |
|
64 |
||
548 | 65 |
(** parse (ast) translations **) |
66 |
||
11491 | 67 |
(* constify *) |
68 |
||
69 |
fun constify_ast_tr [Ast.Variable c] = Ast.Constant c |
|
70 |
| constify_ast_tr asts = raise Ast.AST ("constify_ast_tr", asts); |
|
71 |
||
72 |
||
548 | 73 |
(* application *) |
74 |
||
5690 | 75 |
fun appl_ast_tr [f, args] = Ast.Appl (f :: Ast.unfold_ast "_args" args) |
76 |
| 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
|
77 |
|
5690 | 78 |
fun applC_ast_tr [f, args] = Ast.Appl (f :: Ast.unfold_ast "_cargs" args) |
79 |
| applC_ast_tr asts = raise Ast.AST ("applC_ast_tr", asts); |
|
548 | 80 |
|
81 |
||
82 |
(* abstraction *) |
|
83 |
||
17788 | 84 |
fun idtyp_ast_tr (*"_idtyp"*) [x, ty] = Ast.Appl [Ast.Constant "_constrain", x, ty] |
5690 | 85 |
| idtyp_ast_tr (*"_idtyp"*) asts = raise Ast.AST ("idtyp_ast_tr", asts); |
548 | 86 |
|
17788 | 87 |
fun idtypdummy_ast_tr (*"_idtypdummy"*) [ty] = |
88 |
Ast.Appl [Ast.Constant "_constrain", Ast.Constant "_idtdummy", ty] |
|
89 |
| idtypdummy_ast_tr (*"_idtypdummy"*) asts = raise Ast.AST ("idtyp_ast_tr", asts); |
|
90 |
||
3691
f0396ac63e12
tuned lambda_ast_tr, idtyp_ast_tr' to accomodate fix of idt/idts
wenzelm
parents:
2698
diff
changeset
|
91 |
fun lambda_ast_tr (*"_lambda"*) [pats, body] = |
5690 | 92 |
Ast.fold_ast_p "_abs" (Ast.unfold_ast "_pttrns" pats, body) |
93 |
| lambda_ast_tr (*"_lambda"*) asts = raise Ast.AST ("lambda_ast_tr", asts); |
|
548 | 94 |
|
95 |
val constrainAbsC = "_constrainAbs"; |
|
96 |
||
17788 | 97 |
fun abs_tr (*"_abs"*) [Free (x, T), t] = Term.absfree (x, T, t) |
98 |
| abs_tr (*"_abs"*) [Const ("_idtdummy", T), t] = Term.absdummy (T, t) |
|
99 |
| abs_tr (*"_abs"*) [Const ("_constrain", _) $ Free (x, T) $ tT, t] = |
|
100 |
Lexicon.const constrainAbsC $ Term.absfree (x, T, t) $ tT |
|
101 |
| abs_tr (*"_abs"*) [Const ("_constrain", _) $ Const ("_idtdummy", T) $ tT, t] = |
|
102 |
Lexicon.const constrainAbsC $ Term.absdummy (T, t) $ tT |
|
3777 | 103 |
| abs_tr (*"_abs"*) ts = raise TERM ("abs_tr", ts); |
548 | 104 |
|
105 |
||
106 |
(* binder *) |
|
107 |
||
21535 | 108 |
fun mk_binder_tr (syn, name) = |
548 | 109 |
let |
5690 | 110 |
fun tr (Free (x, T), t) = Lexicon.const name $ Term.absfree (x, T, t) |
17788 | 111 |
| tr (Const ("_idtdummy", T), t) = Lexicon.const name $ Term.absdummy (T, t) |
112 |
| tr (Const ("_constrain", _) $ Free (x, T) $ tT, t) = |
|
18342
1b7109c10b7b
asts_to_terms: builtin free_fixed translation makes local binders work properly;
wenzelm
parents:
18212
diff
changeset
|
113 |
Lexicon.const name $ (Lexicon.const constrainAbsC $ Term.absfree (x, T, t) $ tT) |
17788 | 114 |
| tr (Const ("_constrain", _) $ Const ("_idtdummy", T) $ tT, t) = |
18342
1b7109c10b7b
asts_to_terms: builtin free_fixed translation makes local binders work properly;
wenzelm
parents:
18212
diff
changeset
|
115 |
Lexicon.const name $ (Lexicon.const constrainAbsC $ Term.absdummy (T, t) $ tT) |
548 | 116 |
| tr (Const ("_idts", _) $ idt $ idts, t) = tr (idt, tr (idts, t)) |
3777 | 117 |
| tr (t1, t2) = raise TERM ("binder_tr", [t1, t2]); |
548 | 118 |
|
21535 | 119 |
fun binder_tr [idts, body] = tr (idts, body) |
120 |
| binder_tr ts = raise TERM ("binder_tr", ts); |
|
121 |
in (syn, binder_tr) end; |
|
548 | 122 |
|
123 |
||
124 |
(* meta propositions *) |
|
125 |
||
17788 | 126 |
fun aprop_tr (*"_aprop"*) [t] = Lexicon.const "_constrain" $ t $ Lexicon.const "prop" |
3777 | 127 |
| aprop_tr (*"_aprop"*) ts = raise TERM ("aprop_tr", ts); |
548 | 128 |
|
129 |
fun ofclass_tr (*"_ofclass"*) [ty, cls] = |
|
17788 | 130 |
cls $ (Lexicon.const "_constrain" $ Lexicon.const "TYPE" $ |
5690 | 131 |
(Lexicon.const "itself" $ ty)) |
3777 | 132 |
| ofclass_tr (*"_ofclass"*) ts = raise TERM ("ofclass_tr", ts); |
548 | 133 |
|
134 |
||
135 |
(* meta implication *) |
|
136 |
||
16612
48be8ef738df
transform_failure in translation functions: TRANSLATION_FAIL;
wenzelm
parents:
15570
diff
changeset
|
137 |
fun bigimpl_ast_tr (*"_bigimpl"*) (asts as [asms, concl]) = |
48be8ef738df
transform_failure in translation functions: TRANSLATION_FAIL;
wenzelm
parents:
15570
diff
changeset
|
138 |
let val prems = |
48be8ef738df
transform_failure in translation functions: TRANSLATION_FAIL;
wenzelm
parents:
15570
diff
changeset
|
139 |
(case Ast.unfold_ast_p "_asms" asms of |
48be8ef738df
transform_failure in translation functions: TRANSLATION_FAIL;
wenzelm
parents:
15570
diff
changeset
|
140 |
(asms', Ast.Appl [Ast.Constant "_asm", asm']) => asms' @ [asm'] |
48be8ef738df
transform_failure in translation functions: TRANSLATION_FAIL;
wenzelm
parents:
15570
diff
changeset
|
141 |
| _ => raise Ast.AST ("bigimpl_ast_tr", asts)) |
48be8ef738df
transform_failure in translation functions: TRANSLATION_FAIL;
wenzelm
parents:
15570
diff
changeset
|
142 |
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
|
143 |
| 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
|
144 |
|
548 | 145 |
|
4148 | 146 |
(* type reflection *) |
147 |
||
148 |
fun type_tr (*"_TYPE"*) [ty] = |
|
17788 | 149 |
Lexicon.const "_constrain" $ Lexicon.const "TYPE" $ (Lexicon.const "itself" $ ty) |
4148 | 150 |
| type_tr (*"_TYPE"*) ts = raise TERM ("type_tr", ts); |
151 |
||
548 | 152 |
|
6761 | 153 |
(* dddot *) |
154 |
||
8595 | 155 |
fun dddot_tr (*"_DDDOT"*) ts = Term.list_comb (Lexicon.var SynExt.dddot_indexname, ts); |
6761 | 156 |
|
157 |
||
5084 | 158 |
(* quote / antiquote *) |
159 |
||
8577 | 160 |
fun antiquote_tr name = |
161 |
let |
|
162 |
fun tr i ((t as Const (c, _)) $ u) = |
|
163 |
if c = name then tr i u $ Bound i |
|
164 |
else tr i t $ tr i u |
|
165 |
| tr i (t $ u) = tr i t $ tr i u |
|
166 |
| tr i (Abs (x, T, t)) = Abs (x, T, tr (i + 1) t) |
|
167 |
| tr _ a = a; |
|
168 |
in tr 0 end; |
|
169 |
||
170 |
fun quote_tr name t = Abs ("s", dummyT, antiquote_tr name (Term.incr_boundvars 1 t)); |
|
171 |
||
5084 | 172 |
fun quote_antiquote_tr quoteN antiquoteN name = |
173 |
let |
|
8577 | 174 |
fun tr [t] = Lexicon.const name $ quote_tr antiquoteN t |
175 |
| tr ts = raise TERM ("quote_tr", ts); |
|
176 |
in (quoteN, tr) end; |
|
5084 | 177 |
|
178 |
||
14697 | 179 |
(* indexed syntax *) |
180 |
||
181 |
fun struct_ast_tr (*"_struct"*) [Ast.Appl [Ast.Constant "_index", ast]] = ast |
|
182 |
| struct_ast_tr (*"_struct"*) asts = Ast.mk_appl (Ast.Constant "_struct") asts; |
|
183 |
||
184 |
fun index_ast_tr ast = |
|
185 |
Ast.mk_appl (Ast.Constant "_index") [Ast.mk_appl (Ast.Constant "_struct") [ast]]; |
|
186 |
||
187 |
fun indexdefault_ast_tr (*"_indexdefault"*) [] = |
|
188 |
index_ast_tr (Ast.Constant "_indexdefault") |
|
189 |
| indexdefault_ast_tr (*"_indexdefault"*) asts = |
|
190 |
raise Ast.AST ("indexdefault_ast_tr", asts); |
|
191 |
||
192 |
fun indexnum_ast_tr (*"_indexnum"*) [ast] = |
|
193 |
index_ast_tr (Ast.mk_appl (Ast.Constant "_indexnum") [ast]) |
|
194 |
| indexnum_ast_tr (*"_indexnum"*) asts = raise Ast.AST ("indexnum_ast_tr", asts); |
|
12122 | 195 |
|
14697 | 196 |
fun indexvar_ast_tr (*"_indexvar"*) [] = |
197 |
Ast.mk_appl (Ast.Constant "_index") [Ast.Variable "some_index"] |
|
198 |
| indexvar_ast_tr (*"_indexvar"*) asts = raise Ast.AST ("indexvar_ast_tr", asts); |
|
199 |
||
200 |
fun index_tr (*"_index"*) [t] = t |
|
201 |
| index_tr (*"_index"*) ts = raise TERM ("index_tr", ts); |
|
202 |
||
203 |
||
204 |
(* implicit structures *) |
|
205 |
||
206 |
fun the_struct structs i = |
|
15570 | 207 |
if 1 <= i andalso i <= length structs then List.nth (structs, i - 1) |
18678 | 208 |
else raise error ("Illegal reference to implicit structure #" ^ string_of_int i); |
14697 | 209 |
|
210 |
fun struct_tr structs (*"_struct"*) [Const ("_indexdefault", _)] = |
|
211 |
Lexicon.free (the_struct structs 1) |
|
212 |
| struct_tr structs (*"_struct"*) [t as (Const ("_indexnum", _) $ Const (s, _))] = |
|
213 |
Lexicon.free (the_struct structs |
|
15531 | 214 |
(case Lexicon.read_nat s of SOME n => n | NONE => raise TERM ("struct_tr", [t]))) |
14697 | 215 |
| struct_tr _ (*"_struct"*) ts = raise TERM ("struct_tr", ts); |
12122 | 216 |
|
217 |
||
5084 | 218 |
|
548 | 219 |
(** print (ast) translations **) |
220 |
||
14647 | 221 |
(* types *) |
222 |
||
223 |
fun non_typed_tr' f _ _ ts = f ts; |
|
224 |
fun non_typed_tr'' f x _ _ ts = f x ts; |
|
225 |
||
226 |
||
548 | 227 |
(* application *) |
228 |
||
5690 | 229 |
fun appl_ast_tr' (f, []) = raise Ast.AST ("appl_ast_tr'", [f]) |
230 |
| appl_ast_tr' (f, args) = Ast.Appl [Ast.Constant "_appl", f, Ast.fold_ast "_args" args]; |
|
548 | 231 |
|
5690 | 232 |
fun applC_ast_tr' (f, []) = raise Ast.AST ("applC_ast_tr'", [f]) |
233 |
| 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
|
234 |
|
548 | 235 |
|
236 |
(* abstraction *) |
|
237 |
||
19311 | 238 |
fun mark_boundT (x, T) = Const ("_bound", T --> T) $ Free (x, T); |
2698 | 239 |
fun mark_bound x = mark_boundT (x, dummyT); |
240 |
||
18958 | 241 |
fun bound_vars vars body = |
242 |
subst_bounds (map mark_boundT (Term.rename_wrt_term body vars), body); |
|
243 |
||
548 | 244 |
fun strip_abss vars_of body_of tm = |
245 |
let |
|
246 |
val vars = vars_of tm; |
|
247 |
val body = body_of tm; |
|
248 |
val rev_new_vars = rename_wrt_term body vars; |
|
21750 | 249 |
fun subst (x, T) b = |
250 |
if can Name.dest_internal x andalso not (Term.loose_bvar1 (b, 0)) |
|
251 |
then (Const ("_idtdummy", T), incr_boundvars ~1 b) |
|
252 |
else (mark_boundT (x, T), Term.subst_bound (mark_bound x, b)); |
|
253 |
val (rev_vars', body') = fold_map subst rev_new_vars body; |
|
254 |
in (rev rev_vars', body') end; |
|
548 | 255 |
|
3928
787d2659ce4a
no longer tries bogus eta-contract involving aprops;
wenzelm
parents:
3777
diff
changeset
|
256 |
|
548 | 257 |
(*do (partial) eta-contraction before printing*) |
258 |
||
1326 | 259 |
val eta_contract = ref true; |
548 | 260 |
|
261 |
fun eta_contr tm = |
|
262 |
let |
|
3928
787d2659ce4a
no longer tries bogus eta-contract involving aprops;
wenzelm
parents:
3777
diff
changeset
|
263 |
fun is_aprop (Const ("_aprop", _)) = true |
787d2659ce4a
no longer tries bogus eta-contract involving aprops;
wenzelm
parents:
3777
diff
changeset
|
264 |
| is_aprop _ = false; |
787d2659ce4a
no longer tries bogus eta-contract involving aprops;
wenzelm
parents:
3777
diff
changeset
|
265 |
|
548 | 266 |
fun eta_abs (Abs (a, T, t)) = |
267 |
(case eta_abs t of |
|
268 |
t' as f $ u => |
|
269 |
(case eta_abs u of |
|
270 |
Bound 0 => |
|
5084 | 271 |
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
|
272 |
else incr_boundvars ~1 f |
548 | 273 |
| _ => Abs (a, T, t')) |
274 |
| t' => Abs (a, T, t')) |
|
275 |
| eta_abs t = t; |
|
276 |
in |
|
277 |
if ! eta_contract then eta_abs tm else tm |
|
278 |
end; |
|
279 |
||
280 |
||
281 |
fun abs_tr' tm = |
|
19473 | 282 |
uncurry (fold_rev (fn x => fn t => Lexicon.const "_abs" $ x $ t)) |
548 | 283 |
(strip_abss strip_abs_vars strip_abs_body (eta_contr tm)); |
284 |
||
14697 | 285 |
fun atomic_abs_tr' (x, T, t) = |
286 |
let val [xT] = rename_wrt_term t [(x, T)] |
|
287 |
in (mark_boundT xT, subst_bound (mark_bound (fst xT), t)) end; |
|
13762 | 288 |
|
548 | 289 |
fun abs_ast_tr' (*"_abs"*) asts = |
5690 | 290 |
(case Ast.unfold_ast_p "_abs" (Ast.Appl (Ast.Constant "_abs" :: asts)) of |
291 |
([], _) => raise Ast.AST ("abs_ast_tr'", asts) |
|
292 |
| (xs, body) => Ast.Appl [Ast.Constant "_lambda", Ast.fold_ast "_pttrns" xs, body]); |
|
548 | 293 |
|
294 |
||
295 |
(* binder *) |
|
296 |
||
21535 | 297 |
fun mk_binder_tr' (name, syn) = |
548 | 298 |
let |
299 |
fun mk_idts [] = raise Match (*abort translation*) |
|
300 |
| mk_idts [idt] = idt |
|
5690 | 301 |
| mk_idts (idt :: idts) = Lexicon.const "_idts" $ idt $ mk_idts idts; |
548 | 302 |
|
303 |
fun tr' t = |
|
304 |
let |
|
305 |
val (xs, bd) = strip_abss (strip_qnt_vars name) (strip_qnt_body name) t; |
|
21535 | 306 |
in Lexicon.const syn $ mk_idts xs $ bd end; |
548 | 307 |
|
21535 | 308 |
fun binder_tr' (t :: ts) = Term.list_comb (tr' (Lexicon.const name $ t), ts) |
309 |
| binder_tr' [] = raise Match; |
|
310 |
in (name, binder_tr') end; |
|
548 | 311 |
|
312 |
||
3691
f0396ac63e12
tuned lambda_ast_tr, idtyp_ast_tr' to accomodate fix of idt/idts
wenzelm
parents:
2698
diff
changeset
|
313 |
(* idtyp constraints *) |
548 | 314 |
|
5690 | 315 |
fun idtyp_ast_tr' a [Ast.Appl [Ast.Constant c, x, ty], xs] = |
17788 | 316 |
if c = "_constrain" then |
5690 | 317 |
Ast.Appl [ Ast.Constant a, Ast.Appl [Ast.Constant "_idtyp", x, ty], xs] |
548 | 318 |
else raise Match |
3691
f0396ac63e12
tuned lambda_ast_tr, idtyp_ast_tr' to accomodate fix of idt/idts
wenzelm
parents:
2698
diff
changeset
|
319 |
| idtyp_ast_tr' _ _ = raise Match; |
548 | 320 |
|
321 |
||
322 |
(* meta propositions *) |
|
323 |
||
4148 | 324 |
fun prop_tr' tm = |
548 | 325 |
let |
5690 | 326 |
fun aprop t = Lexicon.const "_aprop" $ t; |
548 | 327 |
|
2698 | 328 |
fun is_prop Ts t = |
329 |
fastype_of1 (Ts, t) = propT handle TERM _ => false; |
|
548 | 330 |
|
19848 | 331 |
fun is_term (Const ("ProtoPure.term", _) $ _) = true |
332 |
| is_term _ = false; |
|
333 |
||
548 | 334 |
fun tr' _ (t as Const _) = t |
18478
29a5070b517c
prop_tr': proper handling of aprop marked as bound;
wenzelm
parents:
18342
diff
changeset
|
335 |
| tr' Ts (t as Const ("_bound", _) $ u) = |
29a5070b517c
prop_tr': proper handling of aprop marked as bound;
wenzelm
parents:
18342
diff
changeset
|
336 |
if is_prop Ts u then aprop t else t |
2698 | 337 |
| tr' _ (t as Free (x, T)) = |
5690 | 338 |
if T = propT then aprop (Lexicon.free x) else t |
2698 | 339 |
| tr' _ (t as Var (xi, T)) = |
5690 | 340 |
if T = propT then aprop (Lexicon.var xi) else t |
2698 | 341 |
| tr' Ts (t as Bound _) = |
342 |
if is_prop Ts t then aprop t else t |
|
343 |
| tr' Ts (Abs (x, T, t)) = Abs (x, T, tr' (T :: Ts) t) |
|
344 |
| tr' Ts (t as t1 $ (t2 as Const ("TYPE", Type ("itself", [T])))) = |
|
19848 | 345 |
if is_prop Ts t andalso not (is_term t) then Const ("_mk_ofclass", T) $ tr' Ts t1 |
2698 | 346 |
else tr' Ts t1 $ tr' Ts t2 |
347 |
| tr' Ts (t as t1 $ t2) = |
|
5690 | 348 |
(if is_Const (Term.head_of t) orelse not (is_prop Ts t) |
2698 | 349 |
then I else aprop) (tr' Ts t1 $ tr' Ts t2); |
16612
48be8ef738df
transform_failure in translation functions: TRANSLATION_FAIL;
wenzelm
parents:
15570
diff
changeset
|
350 |
in tr' [] tm end; |
548 | 351 |
|
4148 | 352 |
fun mk_ofclass_tr' show_sorts (*"_mk_ofclass"*) T [t] = |
5690 | 353 |
Lexicon.const "_ofclass" $ TypeExt.term_of_typ show_sorts T $ t |
4148 | 354 |
| mk_ofclass_tr' _ (*"_mk_ofclass"*) T ts = raise TYPE ("mk_ofclass_tr'", [T], ts); |
2698 | 355 |
|
356 |
||
548 | 357 |
(* meta implication *) |
358 |
||
359 |
fun impl_ast_tr' (*"==>"*) asts = |
|
10572 | 360 |
if TypeExt.no_brackets () then raise Match |
361 |
else |
|
362 |
(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
|
363 |
(prems as _ :: _ :: _, concl) => |
48be8ef738df
transform_failure in translation functions: TRANSLATION_FAIL;
wenzelm
parents:
15570
diff
changeset
|
364 |
let |
48be8ef738df
transform_failure in translation functions: TRANSLATION_FAIL;
wenzelm
parents:
15570
diff
changeset
|
365 |
val (asms, asm) = split_last prems; |
48be8ef738df
transform_failure in translation functions: TRANSLATION_FAIL;
wenzelm
parents:
15570
diff
changeset
|
366 |
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
|
367 |
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
|
368 |
| _ => raise Match); |
fcf747c0b6b8
Syntax: last premise of "_bigimpl" is wrapped with "_asm", to have a hook for
schirmer
parents:
14981
diff
changeset
|
369 |
|
548 | 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 |
||
19577 | 378 |
(* type constraints *) |
379 |
||
380 |
fun type_constraint_tr' show_sorts (*"_type_constraint_"*) (Type ("fun", [T, _])) (t :: ts) = |
|
381 |
Term.list_comb (Lexicon.const SynExt.constrainC $ t $ TypeExt.term_of_typ show_sorts T, ts) |
|
382 |
| type_constraint_tr' _ _ _ = raise Match; |
|
383 |
||
384 |
||
548 | 385 |
(* dependent / nondependent quantifiers *) |
386 |
||
20202 | 387 |
fun var_abs mark (x, T, b) = |
388 |
let val ([x'], _) = Name.variants [x] (Term.declare_term_names b Name.context) |
|
389 |
in (x', subst_bound (mark (x', T), b)) end; |
|
390 |
||
391 |
val variant_abs = var_abs Free; |
|
392 |
val variant_abs' = var_abs mark_boundT; |
|
2698 | 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) = |
|
18139 | 407 |
if u aconv Bound i then Lexicon.const name $ tr' i t |
8577 | 408 |
else tr' i t $ tr' i u |
409 |
| tr' i (Abs (x, T, t)) = Abs (x, T, tr' (i + 1) t) |
|
18139 | 410 |
| tr' i a = if a aconv Bound i then raise Match else a; |
8577 | 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 |
|
18678 | 433 |
SOME i => Ast.Variable (the_struct structs i handle ERROR _ => raise Match) |
15531 | 434 |
| NONE => raise Match)] |> Ast.mk_appl (Ast.Constant "_free"); |
14697 | 435 |
|
436 |
fun struct_ast_tr' structs (*"_struct"*) [Ast.Constant "_indexdefault"] = |
|
437 |
the_struct' structs "1" |
|
438 |
| struct_ast_tr' structs (*"_struct"*) [Ast.Appl [Ast.Constant "_indexnum", Ast.Constant s]] = |
|
439 |
the_struct' structs s |
|
440 |
| struct_ast_tr' _ _ = raise Match; |
|
441 |
||
442 |
||
443 |
||
444 |
(** Pure translations **) |
|
548 | 445 |
|
446 |
val pure_trfuns = |
|
11491 | 447 |
([("_constify", constify_ast_tr), ("_appl", appl_ast_tr), ("_applC", applC_ast_tr), |
17788 | 448 |
("_lambda", lambda_ast_tr), ("_idtyp", idtyp_ast_tr), ("_idtypdummy", idtypdummy_ast_tr), |
449 |
("_bigimpl", bigimpl_ast_tr), ("_indexdefault", indexdefault_ast_tr), |
|
450 |
("_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
|
451 |
[("_abs", abs_tr), ("_aprop", aprop_tr), ("_ofclass", ofclass_tr), |
17788 | 452 |
("_TYPE", type_tr), ("_DDDOT", dddot_tr), |
14697 | 453 |
("_index", index_tr)], |
19131 | 454 |
([]: (string * (term list -> term)) list), |
3691
f0396ac63e12
tuned lambda_ast_tr, idtyp_ast_tr' to accomodate fix of idt/idts
wenzelm
parents:
2698
diff
changeset
|
455 |
[("_abs", abs_ast_tr'), ("_idts", idtyp_ast_tr' "_idts"), |
14697 | 456 |
("_pttrns", idtyp_ast_tr' "_pttrns"), ("==>", impl_ast_tr'), |
457 |
("_index", index_ast_tr')]); |
|
548 | 458 |
|
2698 | 459 |
val pure_trfunsT = |
19577 | 460 |
[("_mk_ofclass", mk_ofclass_tr'), ("TYPE", type_tr'), |
461 |
("_type_constraint_", type_constraint_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 |
|
18857 | 470 |
fun pts_to_asts context trf pts = |
548 | 471 |
let |
472 |
fun trans a args = |
|
473 |
(case trf a of |
|
15531 | 474 |
NONE => Ast.mk_appl (Ast.Constant a) args |
16612
48be8ef738df
transform_failure in translation functions: TRANSLATION_FAIL;
wenzelm
parents:
15570
diff
changeset
|
475 |
| SOME f => transform_failure (fn exn => |
17364 | 476 |
EXCEPTION (exn, "Error in parse ast translation for " ^ quote a)) |
18857 | 477 |
(fn () => f context args) ()); |
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; |
19482
9f11af8f7ef9
tuned basic list operators (flat, maps, map_filter);
wenzelm
parents:
19473
diff
changeset
|
484 |
val exns = map_filter get_exn exn_results; |
9f11af8f7ef9
tuned basic list operators (flat, maps, map_filter);
wenzelm
parents:
19473
diff
changeset
|
485 |
val results = map_filter get_result exn_results |
16612
48be8ef738df
transform_failure in translation functions: TRANSLATION_FAIL;
wenzelm
parents:
15570
diff
changeset
|
486 |
in (case (results, exns) of ([], exn :: _) => raise exn | _ => results) end; |
548 | 487 |
|
488 |
||
489 |
||
14798
702cb4859cab
Modified functions pt_to_ast and ast_to_term to improve handling
berghofe
parents:
14697
diff
changeset
|
490 |
(** asts_to_terms **) |
548 | 491 |
|
18857 | 492 |
fun asts_to_terms context trf asts = |
548 | 493 |
let |
494 |
fun trans a args = |
|
495 |
(case trf a of |
|
15531 | 496 |
NONE => Term.list_comb (Lexicon.const a, args) |
16612
48be8ef738df
transform_failure in translation functions: TRANSLATION_FAIL;
wenzelm
parents:
15570
diff
changeset
|
497 |
| SOME f => transform_failure (fn exn => |
17364 | 498 |
EXCEPTION (exn, "Error in parse translation for " ^ quote a)) |
18857 | 499 |
(fn () => f context args) ()); |
548 | 500 |
|
5690 | 501 |
fun term_of (Ast.Constant a) = trans a [] |
502 |
| term_of (Ast.Variable x) = Lexicon.read_var x |
|
503 |
| term_of (Ast.Appl (Ast.Constant a :: (asts as _ :: _))) = |
|
548 | 504 |
trans a (map term_of asts) |
5690 | 505 |
| term_of (Ast.Appl (ast :: (asts as _ :: _))) = |
506 |
Term.list_comb (term_of ast, map term_of asts) |
|
507 |
| 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
|
508 |
|
19005 | 509 |
val free_fixed = Term.map_aterms |
510 |
(fn t as Const (c, T) => |
|
511 |
(case try (unprefix Lexicon.fixedN) c of |
|
512 |
NONE => t |
|
18342
1b7109c10b7b
asts_to_terms: builtin free_fixed translation makes local binders work properly;
wenzelm
parents:
18212
diff
changeset
|
513 |
| SOME x => Free (x, T)) |
19005 | 514 |
| t => t); |
18342
1b7109c10b7b
asts_to_terms: builtin free_fixed translation makes local binders work properly;
wenzelm
parents:
18212
diff
changeset
|
515 |
|
1b7109c10b7b
asts_to_terms: builtin free_fixed translation makes local binders work properly;
wenzelm
parents:
18212
diff
changeset
|
516 |
val exn_results = map (capture (term_of #> free_fixed)) asts; |
19482
9f11af8f7ef9
tuned basic list operators (flat, maps, map_filter);
wenzelm
parents:
19473
diff
changeset
|
517 |
val exns = map_filter get_exn exn_results; |
9f11af8f7ef9
tuned basic list operators (flat, maps, map_filter);
wenzelm
parents:
19473
diff
changeset
|
518 |
val results = map_filter get_result exn_results |
16612
48be8ef738df
transform_failure in translation functions: TRANSLATION_FAIL;
wenzelm
parents:
15570
diff
changeset
|
519 |
in (case (results, exns) of ([], exn :: _) => raise exn | _ => results) end; |
548 | 520 |
|
521 |
end; |