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