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