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