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