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