author | wenzelm |
Wed, 27 Sep 2000 19:51:11 +0200 | |
changeset 10097 | 1db5bd97f6a3 |
parent 8595 | 06874c5c3cfa |
child 10572 | b070825579b8 |
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 |
11 |
val mk_binder_tr: string * string -> string * (term list -> term) |
|
12 |
val mk_binder_tr': string * string -> string * (term list -> term) |
|
13 |
val dependent_tr': string * string -> term list -> term |
|
8577 | 14 |
val antiquote_tr: string -> term -> term |
15 |
val quote_tr: string -> term -> term |
|
5084 | 16 |
val quote_antiquote_tr: string -> string -> string -> string * (term list -> term) |
8577 | 17 |
val antiquote_tr': string -> term -> term |
18 |
val quote_tr': string -> term -> term |
|
5084 | 19 |
val quote_antiquote_tr': string -> string -> string -> string * (term list -> term) |
2698 | 20 |
val mark_bound: string -> term |
21 |
val mark_boundT: string * typ -> term |
|
22 |
val variant_abs': string * typ * term -> string * term |
|
23 |
end; |
|
548 | 24 |
|
25 |
signature SYN_TRANS1 = |
|
2698 | 26 |
sig |
548 | 27 |
include SYN_TRANS0 |
1511 | 28 |
val constrainAbsC: string |
29 |
val pure_trfuns: |
|
30 |
(string * (Ast.ast list -> Ast.ast)) list * |
|
548 | 31 |
(string * (term list -> term)) list * |
32 |
(string * (term list -> term)) list * |
|
1511 | 33 |
(string * (Ast.ast list -> Ast.ast)) list |
4148 | 34 |
val pure_trfunsT: (string * (bool -> typ -> term list -> term)) list |
2698 | 35 |
end; |
548 | 36 |
|
37 |
signature SYN_TRANS = |
|
2698 | 38 |
sig |
548 | 39 |
include SYN_TRANS1 |
1511 | 40 |
val abs_tr': term -> term |
4148 | 41 |
val prop_tr': term -> term |
1511 | 42 |
val appl_ast_tr': Ast.ast * Ast.ast list -> Ast.ast |
43 |
val applC_ast_tr': Ast.ast * Ast.ast list -> Ast.ast |
|
44 |
val pt_to_ast: (string -> (Ast.ast list -> Ast.ast) option) -> Parser.parsetree -> Ast.ast |
|
45 |
val ast_to_term: (string -> (term list -> term) option) -> Ast.ast -> term |
|
2698 | 46 |
end; |
548 | 47 |
|
2698 | 48 |
structure SynTrans: SYN_TRANS = |
548 | 49 |
struct |
2698 | 50 |
|
51 |
||
548 | 52 |
(** parse (ast) translations **) |
53 |
||
54 |
(* application *) |
|
55 |
||
5690 | 56 |
fun appl_ast_tr [f, args] = Ast.Appl (f :: Ast.unfold_ast "_args" args) |
57 |
| 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
|
58 |
|
5690 | 59 |
fun applC_ast_tr [f, args] = Ast.Appl (f :: Ast.unfold_ast "_cargs" args) |
60 |
| applC_ast_tr asts = raise Ast.AST ("applC_ast_tr", asts); |
|
548 | 61 |
|
62 |
||
63 |
(* abstraction *) |
|
64 |
||
5690 | 65 |
fun idtyp_ast_tr (*"_idtyp"*) [x, ty] = Ast.Appl [Ast.Constant SynExt.constrainC, x, ty] |
66 |
| idtyp_ast_tr (*"_idtyp"*) asts = raise Ast.AST ("idtyp_ast_tr", asts); |
|
548 | 67 |
|
3691
f0396ac63e12
tuned lambda_ast_tr, idtyp_ast_tr' to accomodate fix of idt/idts
wenzelm
parents:
2698
diff
changeset
|
68 |
fun lambda_ast_tr (*"_lambda"*) [pats, body] = |
5690 | 69 |
Ast.fold_ast_p "_abs" (Ast.unfold_ast "_pttrns" pats, body) |
70 |
| lambda_ast_tr (*"_lambda"*) asts = raise Ast.AST ("lambda_ast_tr", asts); |
|
548 | 71 |
|
72 |
val constrainAbsC = "_constrainAbs"; |
|
73 |
||
5690 | 74 |
fun abs_tr (*"_abs"*) [Free (x, T), body] = Term.absfree (x, T, body) |
548 | 75 |
| abs_tr (*"_abs"*) (ts as [Const (c, _) $ Free (x, T) $ tT, body]) = |
5690 | 76 |
if c = SynExt.constrainC |
77 |
then Lexicon.const constrainAbsC $ Term.absfree (x, T, body) $ tT |
|
3777 | 78 |
else raise TERM ("abs_tr", ts) |
79 |
| abs_tr (*"_abs"*) ts = raise TERM ("abs_tr", ts); |
|
548 | 80 |
|
81 |
||
82 |
(* nondependent abstraction *) |
|
83 |
||
5690 | 84 |
fun k_tr (*"_K"*) [t] = Abs ("uu", dummyT, Term.incr_boundvars 1 t) |
3777 | 85 |
| k_tr (*"_K"*) ts = raise TERM ("k_tr", ts); |
548 | 86 |
|
87 |
||
88 |
(* binder *) |
|
89 |
||
90 |
fun mk_binder_tr (sy, name) = |
|
91 |
let |
|
5690 | 92 |
fun tr (Free (x, T), t) = Lexicon.const name $ Term.absfree (x, T, t) |
548 | 93 |
| tr (Const ("_idts", _) $ idt $ idts, t) = tr (idt, tr (idts, t)) |
94 |
| tr (t1 as Const (c, _) $ Free (x, T) $ tT, t) = |
|
5690 | 95 |
if c = SynExt.constrainC then |
96 |
Lexicon.const name $ (Lexicon.const constrainAbsC $ Term.absfree (x, T, t) $ tT) |
|
3777 | 97 |
else raise TERM ("binder_tr", [t1, t]) |
98 |
| tr (t1, t2) = raise TERM ("binder_tr", [t1, t2]); |
|
548 | 99 |
|
100 |
fun binder_tr (*sy*) [idts, body] = tr (idts, body) |
|
3777 | 101 |
| binder_tr (*sy*) ts = raise TERM ("binder_tr", ts); |
548 | 102 |
in |
103 |
(sy, binder_tr) |
|
104 |
end; |
|
105 |
||
106 |
||
107 |
(* meta propositions *) |
|
108 |
||
5690 | 109 |
fun aprop_tr (*"_aprop"*) [t] = Lexicon.const SynExt.constrainC $ t $ Lexicon.const "prop" |
3777 | 110 |
| aprop_tr (*"_aprop"*) ts = raise TERM ("aprop_tr", ts); |
548 | 111 |
|
112 |
fun ofclass_tr (*"_ofclass"*) [ty, cls] = |
|
5690 | 113 |
cls $ (Lexicon.const SynExt.constrainC $ Lexicon.const "TYPE" $ |
114 |
(Lexicon.const "itself" $ ty)) |
|
3777 | 115 |
| ofclass_tr (*"_ofclass"*) ts = raise TERM ("ofclass_tr", ts); |
548 | 116 |
|
117 |
||
118 |
(* meta implication *) |
|
119 |
||
120 |
fun bigimpl_ast_tr (*"_bigimpl"*) [asms, concl] = |
|
5690 | 121 |
Ast.fold_ast_p "==>" (Ast.unfold_ast "_asms" asms, concl) |
122 |
| bigimpl_ast_tr (*"_bigimpl"*) asts = raise Ast.AST ("bigimpl_ast_tr", asts); |
|
548 | 123 |
|
124 |
||
4148 | 125 |
(* type reflection *) |
126 |
||
127 |
fun type_tr (*"_TYPE"*) [ty] = |
|
5690 | 128 |
Lexicon.const SynExt.constrainC $ Lexicon.const "TYPE" $ (Lexicon.const "itself" $ ty) |
4148 | 129 |
| type_tr (*"_TYPE"*) ts = raise TERM ("type_tr", ts); |
130 |
||
548 | 131 |
|
6761 | 132 |
(* dddot *) |
133 |
||
8595 | 134 |
fun dddot_tr (*"_DDDOT"*) ts = Term.list_comb (Lexicon.var SynExt.dddot_indexname, ts); |
6761 | 135 |
|
136 |
||
5084 | 137 |
(* quote / antiquote *) |
138 |
||
8577 | 139 |
fun antiquote_tr name = |
140 |
let |
|
141 |
fun tr i ((t as Const (c, _)) $ u) = |
|
142 |
if c = name then tr i u $ Bound i |
|
143 |
else tr i t $ tr i u |
|
144 |
| tr i (t $ u) = tr i t $ tr i u |
|
145 |
| tr i (Abs (x, T, t)) = Abs (x, T, tr (i + 1) t) |
|
146 |
| tr _ a = a; |
|
147 |
in tr 0 end; |
|
148 |
||
149 |
fun quote_tr name t = Abs ("s", dummyT, antiquote_tr name (Term.incr_boundvars 1 t)); |
|
150 |
||
5084 | 151 |
fun quote_antiquote_tr quoteN antiquoteN name = |
152 |
let |
|
8577 | 153 |
fun tr [t] = Lexicon.const name $ quote_tr antiquoteN t |
154 |
| tr ts = raise TERM ("quote_tr", ts); |
|
155 |
in (quoteN, tr) end; |
|
5084 | 156 |
|
157 |
||
158 |
||
548 | 159 |
(** print (ast) translations **) |
160 |
||
161 |
(* application *) |
|
162 |
||
5690 | 163 |
fun appl_ast_tr' (f, []) = raise Ast.AST ("appl_ast_tr'", [f]) |
164 |
| appl_ast_tr' (f, args) = Ast.Appl [Ast.Constant "_appl", f, Ast.fold_ast "_args" args]; |
|
548 | 165 |
|
5690 | 166 |
fun applC_ast_tr' (f, []) = raise Ast.AST ("applC_ast_tr'", [f]) |
167 |
| 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
|
168 |
|
548 | 169 |
|
170 |
(* abstraction *) |
|
171 |
||
5690 | 172 |
fun mark_boundT x_T = Lexicon.const "_bound" $ Free x_T; |
2698 | 173 |
fun mark_bound x = mark_boundT (x, dummyT); |
174 |
||
548 | 175 |
fun strip_abss vars_of body_of tm = |
176 |
let |
|
177 |
val vars = vars_of tm; |
|
178 |
val body = body_of tm; |
|
179 |
val rev_new_vars = rename_wrt_term body vars; |
|
180 |
in |
|
2698 | 181 |
(map mark_boundT (rev rev_new_vars), |
182 |
subst_bounds (map (mark_bound o #1) rev_new_vars, body)) |
|
548 | 183 |
end; |
184 |
||
3928
787d2659ce4a
no longer tries bogus eta-contract involving aprops;
wenzelm
parents:
3777
diff
changeset
|
185 |
|
548 | 186 |
(*do (partial) eta-contraction before printing*) |
187 |
||
1326 | 188 |
val eta_contract = ref true; |
548 | 189 |
|
190 |
fun eta_contr tm = |
|
191 |
let |
|
3928
787d2659ce4a
no longer tries bogus eta-contract involving aprops;
wenzelm
parents:
3777
diff
changeset
|
192 |
fun is_aprop (Const ("_aprop", _)) = true |
787d2659ce4a
no longer tries bogus eta-contract involving aprops;
wenzelm
parents:
3777
diff
changeset
|
193 |
| is_aprop _ = false; |
787d2659ce4a
no longer tries bogus eta-contract involving aprops;
wenzelm
parents:
3777
diff
changeset
|
194 |
|
548 | 195 |
fun eta_abs (Abs (a, T, t)) = |
196 |
(case eta_abs t of |
|
197 |
t' as f $ u => |
|
198 |
(case eta_abs u of |
|
199 |
Bound 0 => |
|
5084 | 200 |
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
|
201 |
else incr_boundvars ~1 f |
548 | 202 |
| _ => Abs (a, T, t')) |
203 |
| t' => Abs (a, T, t')) |
|
204 |
| eta_abs t = t; |
|
205 |
in |
|
206 |
if ! eta_contract then eta_abs tm else tm |
|
207 |
end; |
|
208 |
||
209 |
||
210 |
fun abs_tr' tm = |
|
5690 | 211 |
foldr (fn (x, t) => Lexicon.const "_abs" $ x $ t) |
548 | 212 |
(strip_abss strip_abs_vars strip_abs_body (eta_contr tm)); |
213 |
||
214 |
||
215 |
fun abs_ast_tr' (*"_abs"*) asts = |
|
5690 | 216 |
(case Ast.unfold_ast_p "_abs" (Ast.Appl (Ast.Constant "_abs" :: asts)) of |
217 |
([], _) => raise Ast.AST ("abs_ast_tr'", asts) |
|
218 |
| (xs, body) => Ast.Appl [Ast.Constant "_lambda", Ast.fold_ast "_pttrns" xs, body]); |
|
548 | 219 |
|
220 |
||
221 |
(* binder *) |
|
222 |
||
223 |
fun mk_binder_tr' (name, sy) = |
|
224 |
let |
|
225 |
fun mk_idts [] = raise Match (*abort translation*) |
|
226 |
| mk_idts [idt] = idt |
|
5690 | 227 |
| mk_idts (idt :: idts) = Lexicon.const "_idts" $ idt $ mk_idts idts; |
548 | 228 |
|
229 |
fun tr' t = |
|
230 |
let |
|
231 |
val (xs, bd) = strip_abss (strip_qnt_vars name) (strip_qnt_body name) t; |
|
5690 | 232 |
in Lexicon.const sy $ mk_idts xs $ bd end; |
548 | 233 |
|
5690 | 234 |
fun binder_tr' (*name*) (t :: ts) = Term.list_comb (tr' (Lexicon.const name $ t), ts) |
548 | 235 |
| binder_tr' (*name*) [] = raise Match; |
236 |
in |
|
237 |
(name, binder_tr') |
|
238 |
end; |
|
239 |
||
240 |
||
3691
f0396ac63e12
tuned lambda_ast_tr, idtyp_ast_tr' to accomodate fix of idt/idts
wenzelm
parents:
2698
diff
changeset
|
241 |
(* idtyp constraints *) |
548 | 242 |
|
5690 | 243 |
fun idtyp_ast_tr' a [Ast.Appl [Ast.Constant c, x, ty], xs] = |
244 |
if c = SynExt.constrainC then |
|
245 |
Ast.Appl [ Ast.Constant a, Ast.Appl [Ast.Constant "_idtyp", x, ty], xs] |
|
548 | 246 |
else raise Match |
3691
f0396ac63e12
tuned lambda_ast_tr, idtyp_ast_tr' to accomodate fix of idt/idts
wenzelm
parents:
2698
diff
changeset
|
247 |
| idtyp_ast_tr' _ _ = raise Match; |
548 | 248 |
|
249 |
||
250 |
(* meta propositions *) |
|
251 |
||
4148 | 252 |
fun prop_tr' tm = |
548 | 253 |
let |
5690 | 254 |
fun aprop t = Lexicon.const "_aprop" $ t; |
548 | 255 |
|
2698 | 256 |
fun is_prop Ts t = |
257 |
fastype_of1 (Ts, t) = propT handle TERM _ => false; |
|
548 | 258 |
|
259 |
fun tr' _ (t as Const _) = t |
|
2698 | 260 |
| tr' _ (t as Free (x, T)) = |
5690 | 261 |
if T = propT then aprop (Lexicon.free x) else t |
2698 | 262 |
| tr' _ (t as Var (xi, T)) = |
5690 | 263 |
if T = propT then aprop (Lexicon.var xi) else t |
2698 | 264 |
| tr' Ts (t as Bound _) = |
265 |
if is_prop Ts t then aprop t else t |
|
266 |
| tr' Ts (Abs (x, T, t)) = Abs (x, T, tr' (T :: Ts) t) |
|
267 |
| tr' Ts (t as t1 $ (t2 as Const ("TYPE", Type ("itself", [T])))) = |
|
4148 | 268 |
if is_prop Ts t then Const ("_mk_ofclass", T) $ tr' Ts t1 |
2698 | 269 |
else tr' Ts t1 $ tr' Ts t2 |
270 |
| tr' Ts (t as t1 $ t2) = |
|
5690 | 271 |
(if is_Const (Term.head_of t) orelse not (is_prop Ts t) |
2698 | 272 |
then I else aprop) (tr' Ts t1 $ tr' Ts t2); |
548 | 273 |
in |
274 |
tr' [] tm |
|
275 |
end; |
|
276 |
||
4148 | 277 |
fun mk_ofclass_tr' show_sorts (*"_mk_ofclass"*) T [t] = |
5690 | 278 |
Lexicon.const "_ofclass" $ TypeExt.term_of_typ show_sorts T $ t |
4148 | 279 |
| mk_ofclass_tr' _ (*"_mk_ofclass"*) T ts = raise TYPE ("mk_ofclass_tr'", [T], ts); |
2698 | 280 |
|
281 |
||
548 | 282 |
(* meta implication *) |
283 |
||
284 |
fun impl_ast_tr' (*"==>"*) asts = |
|
5690 | 285 |
(case Ast.unfold_ast_p "==>" (Ast.Appl (Ast.Constant "==>" :: asts)) of |
548 | 286 |
(asms as _ :: _ :: _, concl) |
5690 | 287 |
=> Ast.Appl [Ast.Constant "_bigimpl", Ast.fold_ast "_asms" asms, concl] |
548 | 288 |
| _ => raise Match); |
289 |
||
290 |
||
4148 | 291 |
(* type reflection *) |
292 |
||
293 |
fun type_tr' show_sorts (*"TYPE"*) (Type ("itself", [T])) ts = |
|
5690 | 294 |
Term.list_comb (Lexicon.const "_TYPE" $ TypeExt.term_of_typ show_sorts T, ts) |
4148 | 295 |
| type_tr' _ _ _ = raise Match; |
296 |
||
297 |
||
548 | 298 |
(* dependent / nondependent quantifiers *) |
299 |
||
2698 | 300 |
fun variant_abs' (x, T, B) = |
301 |
let val x' = variant (add_term_names (B, [])) x in |
|
302 |
(x', subst_bound (mark_boundT (x', T), B)) |
|
303 |
end; |
|
304 |
||
548 | 305 |
fun dependent_tr' (q, r) (A :: Abs (x, T, B) :: ts) = |
5084 | 306 |
if Term.loose_bvar1 (B, 0) then |
2698 | 307 |
let val (x', B') = variant_abs' (x, dummyT, B); |
5690 | 308 |
in Term.list_comb (Lexicon.const q $ mark_boundT (x', T) $ A $ B', ts) end |
309 |
else Term.list_comb (Lexicon.const r $ A $ B, ts) |
|
548 | 310 |
| dependent_tr' _ _ = raise Match; |
311 |
||
312 |
||
5084 | 313 |
(* quote / antiquote *) |
314 |
||
8577 | 315 |
fun antiquote_tr' name = |
316 |
let |
|
317 |
fun tr' i (t $ u) = |
|
318 |
if u = Bound i then Lexicon.const name $ tr' i t |
|
319 |
else tr' i t $ tr' i u |
|
320 |
| tr' i (Abs (x, T, t)) = Abs (x, T, tr' (i + 1) t) |
|
321 |
| tr' i a = if a = Bound i then raise Match else a; |
|
322 |
in tr' 0 end; |
|
323 |
||
324 |
fun quote_tr' name (Abs (_, _, t)) = Term.incr_boundvars ~1 (antiquote_tr' name t) |
|
325 |
| quote_tr' _ _ = raise Match; |
|
326 |
||
5084 | 327 |
fun quote_antiquote_tr' quoteN antiquoteN name = |
328 |
let |
|
8577 | 329 |
fun tr' (t :: ts) = Term.list_comb (Lexicon.const quoteN $ quote_tr' antiquoteN t, ts) |
330 |
| tr' _ = raise Match; |
|
331 |
in (name, tr') end; |
|
5084 | 332 |
|
333 |
||
548 | 334 |
|
335 |
(** pure_trfuns **) |
|
336 |
||
337 |
val pure_trfuns = |
|
922
196ca0973a6d
added CPure (curried functions) and ProtoPure (ancestor of Pure and CPure)
clasohm
parents:
639
diff
changeset
|
338 |
([("_appl", appl_ast_tr), ("_applC", applC_ast_tr), |
196ca0973a6d
added CPure (curried functions) and ProtoPure (ancestor of Pure and CPure)
clasohm
parents:
639
diff
changeset
|
339 |
("_lambda", lambda_ast_tr), ("_idtyp", idtyp_ast_tr), |
7473 | 340 |
("_bigimpl", bigimpl_ast_tr)], |
922
196ca0973a6d
added CPure (curried functions) and ProtoPure (ancestor of Pure and CPure)
clasohm
parents:
639
diff
changeset
|
341 |
[("_abs", abs_tr), ("_aprop", aprop_tr), ("_ofclass", ofclass_tr), |
6761 | 342 |
("_TYPE", type_tr), ("_DDDOT", dddot_tr), ("_K", k_tr)], |
3700 | 343 |
[]: (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
|
344 |
[("_abs", abs_ast_tr'), ("_idts", idtyp_ast_tr' "_idts"), |
f0396ac63e12
tuned lambda_ast_tr, idtyp_ast_tr' to accomodate fix of idt/idts
wenzelm
parents:
2698
diff
changeset
|
345 |
("_pttrns", idtyp_ast_tr' "_pttrns"), ("==>", impl_ast_tr')]); |
548 | 346 |
|
2698 | 347 |
val pure_trfunsT = |
4148 | 348 |
[("_mk_ofclass", mk_ofclass_tr'), ("TYPE", type_tr')]; |
2698 | 349 |
|
548 | 350 |
|
351 |
||
352 |
(** pt_to_ast **) |
|
353 |
||
354 |
fun pt_to_ast trf pt = |
|
355 |
let |
|
356 |
fun trans a args = |
|
357 |
(case trf a of |
|
5690 | 358 |
None => Ast.mk_appl (Ast.Constant a) args |
548 | 359 |
| Some f => f args handle exn |
987 | 360 |
=> (writeln ("Error in parse ast translation for " ^ quote a); |
361 |
raise exn)); |
|
548 | 362 |
|
987 | 363 |
(*translate pt bottom-up*) |
5690 | 364 |
fun ast_of (Parser.Node (a, pts)) = trans a (map ast_of pts) |
365 |
| ast_of (Parser.Tip tok) = Ast.Variable (Lexicon.str_of_token tok); |
|
548 | 366 |
in |
1178 | 367 |
ast_of pt |
548 | 368 |
end; |
369 |
||
370 |
||
371 |
||
372 |
(** ast_to_term **) |
|
373 |
||
374 |
fun ast_to_term trf ast = |
|
375 |
let |
|
376 |
fun trans a args = |
|
377 |
(case trf a of |
|
5690 | 378 |
None => Term.list_comb (Lexicon.const a, args) |
548 | 379 |
| Some f => f args handle exn |
987 | 380 |
=> (writeln ("Error in parse translation for " ^ quote a); |
381 |
raise exn)); |
|
548 | 382 |
|
5690 | 383 |
fun term_of (Ast.Constant a) = trans a [] |
384 |
| term_of (Ast.Variable x) = Lexicon.read_var x |
|
385 |
| term_of (Ast.Appl (Ast.Constant a :: (asts as _ :: _))) = |
|
548 | 386 |
trans a (map term_of asts) |
5690 | 387 |
| term_of (Ast.Appl (ast :: (asts as _ :: _))) = |
388 |
Term.list_comb (term_of ast, map term_of asts) |
|
389 |
| term_of (ast as Ast.Appl _) = raise Ast.AST ("ast_to_term: malformed ast", [ast]); |
|
548 | 390 |
in |
391 |
term_of ast |
|
392 |
end; |
|
393 |
||
394 |
end; |