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