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