src/Pure/Syntax/syn_trans.ML
author wenzelm
Sat Mar 26 10:25:17 2011 +0100 (2011-03-26)
changeset 42084 532b3a76103f
parent 42083 e1209fc7ecdc
child 42085 2ba15af46cb7
permissions -rw-r--r--
dependent_tr': formal treatment of bounds after stripping Abs, although it should only happen for malformed terms, since print_translations work top-down;
wenzelm@548
     1
(*  Title:      Pure/Syntax/syn_trans.ML
wenzelm@548
     2
    Author:     Tobias Nipkow and Markus Wenzel, TU Muenchen
wenzelm@548
     3
wenzelm@548
     4
Syntax translation functions.
wenzelm@548
     5
*)
wenzelm@548
     6
wenzelm@548
     7
signature SYN_TRANS0 =
wenzelm@2698
     8
sig
wenzelm@39128
     9
  val eta_contract_default: bool Unsynchronized.ref
wenzelm@39163
    10
  val eta_contract_raw: Config.raw
wenzelm@39128
    11
  val eta_contract: bool Config.T
nipkow@13762
    12
  val atomic_abs_tr': string * typ * term -> term * term
haftmann@32120
    13
  val preserve_binder_abs_tr': string -> string -> string * (term list -> term)
haftmann@32120
    14
  val preserve_binder_abs2_tr': string -> string -> string * (term list -> term)
wenzelm@548
    15
  val mk_binder_tr: string * string -> string * (term list -> term)
wenzelm@548
    16
  val mk_binder_tr': string * string -> string * (term list -> term)
wenzelm@548
    17
  val dependent_tr': 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@8577
    21
  val antiquote_tr': string -> term -> term
wenzelm@8577
    22
  val quote_tr': string -> term -> term
wenzelm@5084
    23
  val quote_antiquote_tr': string -> string -> string -> string * (term list -> term)
wenzelm@35145
    24
  val update_name_tr': term -> term
wenzelm@2698
    25
  val mark_bound: string -> term
wenzelm@2698
    26
  val mark_boundT: string * typ -> term
wenzelm@18958
    27
  val bound_vars: (string * typ) list -> term -> term
wenzelm@20202
    28
  val variant_abs: string * typ * term -> string * term
wenzelm@2698
    29
  val variant_abs': string * typ * term -> string * term
wenzelm@2698
    30
end;
wenzelm@548
    31
wenzelm@548
    32
signature SYN_TRANS1 =
wenzelm@2698
    33
sig
wenzelm@548
    34
  include SYN_TRANS0
wenzelm@14647
    35
  val non_typed_tr': (term list -> term) -> bool -> typ -> term list -> term
wenzelm@14647
    36
  val non_typed_tr'': ('a -> term list -> term) -> 'a -> bool -> typ -> term list -> term
paulson@1511
    37
  val constrainAbsC: string
paulson@1511
    38
  val pure_trfuns:
wenzelm@35429
    39
    (string * (Ast.ast list -> Ast.ast)) list *
wenzelm@35429
    40
    (string * (term list -> term)) list *
wenzelm@35429
    41
    (string * (term list -> term)) list *
wenzelm@35429
    42
    (string * (Ast.ast list -> Ast.ast)) list
wenzelm@4148
    43
  val pure_trfunsT: (string * (bool -> typ -> term list -> term)) list
wenzelm@14697
    44
  val struct_trfuns: string list ->
wenzelm@35429
    45
    (string * (Ast.ast list -> Ast.ast)) list *
wenzelm@35429
    46
    (string * (term list -> term)) list *
wenzelm@35429
    47
    (string * (bool -> typ -> term list -> term)) list *
wenzelm@35429
    48
    (string * (Ast.ast list -> Ast.ast)) list
wenzelm@2698
    49
end;
wenzelm@548
    50
wenzelm@548
    51
signature SYN_TRANS =
wenzelm@2698
    52
sig
wenzelm@548
    53
  include SYN_TRANS1
wenzelm@39128
    54
  val abs_tr': Proof.context -> term -> term
wenzelm@4148
    55
  val prop_tr': term -> term
paulson@1511
    56
  val appl_ast_tr': Ast.ast * Ast.ast list -> Ast.ast
paulson@1511
    57
  val applC_ast_tr': Ast.ast * Ast.ast list -> Ast.ast
wenzelm@42048
    58
  val parsetree_to_ast: Proof.context -> bool ->
wenzelm@42043
    59
    (string -> (Proof.context -> Ast.ast list -> Ast.ast) option) -> Parser.parsetree -> Ast.ast
wenzelm@42043
    60
  val ast_to_term: Proof.context ->
wenzelm@42043
    61
    (string -> (Proof.context -> term list -> term) option) -> Ast.ast -> term
wenzelm@2698
    62
end;
wenzelm@548
    63
wenzelm@37216
    64
structure Syn_Trans: SYN_TRANS =
wenzelm@548
    65
struct
wenzelm@2698
    66
wenzelm@2698
    67
wenzelm@548
    68
(** parse (ast) translations **)
wenzelm@548
    69
wenzelm@42057
    70
(* strip_positions *)
wenzelm@42057
    71
wenzelm@42057
    72
fun strip_positions_ast_tr [ast] = Type_Ext.strip_positions_ast ast
wenzelm@42057
    73
  | strip_positions_ast_tr asts = raise Ast.AST ("strip_positions_ast_tr", asts);
wenzelm@42057
    74
wenzelm@42057
    75
wenzelm@11491
    76
(* constify *)
wenzelm@11491
    77
wenzelm@11491
    78
fun constify_ast_tr [Ast.Variable c] = Ast.Constant c
wenzelm@11491
    79
  | constify_ast_tr asts = raise Ast.AST ("constify_ast_tr", asts);
wenzelm@11491
    80
wenzelm@11491
    81
wenzelm@548
    82
(* application *)
wenzelm@548
    83
wenzelm@5690
    84
fun appl_ast_tr [f, args] = Ast.Appl (f :: Ast.unfold_ast "_args" args)
wenzelm@5690
    85
  | appl_ast_tr asts = raise Ast.AST ("appl_ast_tr", asts);
clasohm@922
    86
wenzelm@5690
    87
fun applC_ast_tr [f, args] = Ast.Appl (f :: Ast.unfold_ast "_cargs" args)
wenzelm@5690
    88
  | applC_ast_tr asts = raise Ast.AST ("applC_ast_tr", asts);
wenzelm@548
    89
wenzelm@548
    90
wenzelm@548
    91
(* abstraction *)
wenzelm@548
    92
wenzelm@17788
    93
fun idtyp_ast_tr (*"_idtyp"*) [x, ty] = Ast.Appl [Ast.Constant "_constrain", x, ty]
wenzelm@5690
    94
  | idtyp_ast_tr (*"_idtyp"*) asts = raise Ast.AST ("idtyp_ast_tr", asts);
wenzelm@548
    95
wenzelm@17788
    96
fun idtypdummy_ast_tr (*"_idtypdummy"*) [ty] =
wenzelm@17788
    97
      Ast.Appl [Ast.Constant "_constrain", Ast.Constant "_idtdummy", ty]
wenzelm@17788
    98
  | idtypdummy_ast_tr (*"_idtypdummy"*) asts = raise Ast.AST ("idtyp_ast_tr", asts);
wenzelm@17788
    99
wenzelm@3691
   100
fun lambda_ast_tr (*"_lambda"*) [pats, body] =
wenzelm@5690
   101
      Ast.fold_ast_p "_abs" (Ast.unfold_ast "_pttrns" pats, body)
wenzelm@5690
   102
  | lambda_ast_tr (*"_lambda"*) asts = raise Ast.AST ("lambda_ast_tr", asts);
wenzelm@548
   103
wenzelm@548
   104
val constrainAbsC = "_constrainAbs";
wenzelm@548
   105
wenzelm@21773
   106
fun absfree_proper (x, T, t) =
wenzelm@42048
   107
  if can Name.dest_internal x
wenzelm@42048
   108
  then error ("Illegal internal variable in abstraction: " ^ quote x)
wenzelm@21773
   109
  else Term.absfree (x, T, t);
wenzelm@21773
   110
wenzelm@42048
   111
fun abs_tr [Free (x, T), t] = absfree_proper (x, T, t)
wenzelm@42048
   112
  | abs_tr [Const ("_idtdummy", T), t] = Term.absdummy (T, t)
wenzelm@42048
   113
  | abs_tr [Const ("_constrain", _) $ x $ tT, t] = Lexicon.const constrainAbsC $ abs_tr [x, t] $ tT
wenzelm@42048
   114
  | abs_tr ts = raise TERM ("abs_tr", ts);
wenzelm@548
   115
wenzelm@548
   116
wenzelm@548
   117
(* binder *)
wenzelm@548
   118
wenzelm@21535
   119
fun mk_binder_tr (syn, name) =
wenzelm@548
   120
  let
wenzelm@42055
   121
    fun err ts = raise TERM ("binder_tr: " ^ syn, ts)
wenzelm@42048
   122
    fun binder_tr [Const ("_idts", _) $ idt $ idts, t] = binder_tr [idt, binder_tr [idts, t]]
wenzelm@42048
   123
      | binder_tr [x, t] =
wenzelm@42055
   124
          let val abs = abs_tr [x, t] handle TERM _ => err [x, t]
wenzelm@42048
   125
          in Lexicon.const name $ abs end
wenzelm@42055
   126
      | binder_tr ts = err ts;
wenzelm@21535
   127
  in (syn, binder_tr) end;
wenzelm@548
   128
wenzelm@548
   129
wenzelm@28628
   130
(* type propositions *)
wenzelm@28628
   131
wenzelm@35255
   132
fun mk_type ty =
wenzelm@35255
   133
  Lexicon.const "_constrain" $
wenzelm@35429
   134
    Lexicon.const "\\<^const>TYPE" $ (Lexicon.const "\\<^type>itself" $ ty);
wenzelm@28628
   135
wenzelm@28628
   136
fun ofclass_tr (*"_ofclass"*) [ty, cls] = cls $ mk_type ty
wenzelm@28628
   137
  | ofclass_tr (*"_ofclass"*) ts = raise TERM ("ofclass_tr", ts);
wenzelm@28628
   138
wenzelm@28628
   139
fun sort_constraint_tr (*"_sort_constraint"*) [ty] =
wenzelm@35255
   140
      Lexicon.const "\\<^const>Pure.sort_constraint" $ mk_type ty
wenzelm@28628
   141
  | sort_constraint_tr (*"_sort_constraint"*) ts = raise TERM ("sort_constraint_tr", ts);
wenzelm@28628
   142
wenzelm@28628
   143
wenzelm@548
   144
(* meta propositions *)
wenzelm@548
   145
wenzelm@35429
   146
fun aprop_tr (*"_aprop"*) [t] = Lexicon.const "_constrain" $ t $ Lexicon.const "\\<^type>prop"
wenzelm@3777
   147
  | aprop_tr (*"_aprop"*) ts = raise TERM ("aprop_tr", ts);
wenzelm@548
   148
wenzelm@548
   149
wenzelm@548
   150
(* meta implication *)
wenzelm@548
   151
wenzelm@16612
   152
fun bigimpl_ast_tr (*"_bigimpl"*) (asts as [asms, concl]) =
wenzelm@16612
   153
      let val prems =
wenzelm@16612
   154
        (case Ast.unfold_ast_p "_asms" asms of
wenzelm@16612
   155
          (asms', Ast.Appl [Ast.Constant "_asm", asm']) => asms' @ [asm']
wenzelm@16612
   156
        | _ => raise Ast.AST ("bigimpl_ast_tr", asts))
wenzelm@35255
   157
      in Ast.fold_ast_p "\\<^const>==>" (prems, concl) end
schirmer@15421
   158
  | bigimpl_ast_tr (*"_bigimpl"*) asts = raise Ast.AST ("bigimpl_ast_tr", asts);
schirmer@15421
   159
wenzelm@548
   160
wenzelm@23824
   161
(* type/term reflection *)
wenzelm@4148
   162
wenzelm@28628
   163
fun type_tr (*"_TYPE"*) [ty] = mk_type ty
wenzelm@4148
   164
  | type_tr (*"_TYPE"*) ts = raise TERM ("type_tr", ts);
wenzelm@4148
   165
wenzelm@548
   166
wenzelm@6761
   167
(* dddot *)
wenzelm@6761
   168
wenzelm@37216
   169
fun dddot_tr (*"_DDDOT"*) ts = Term.list_comb (Lexicon.var Syn_Ext.dddot_indexname, ts);
wenzelm@6761
   170
wenzelm@6761
   171
wenzelm@5084
   172
(* quote / antiquote *)
wenzelm@5084
   173
wenzelm@8577
   174
fun antiquote_tr name =
wenzelm@8577
   175
  let
wenzelm@8577
   176
    fun tr i ((t as Const (c, _)) $ u) =
wenzelm@8577
   177
          if c = name then tr i u $ Bound i
wenzelm@8577
   178
          else tr i t $ tr i u
wenzelm@8577
   179
      | tr i (t $ u) = tr i t $ tr i u
wenzelm@8577
   180
      | tr i (Abs (x, T, t)) = Abs (x, T, tr (i + 1) t)
wenzelm@8577
   181
      | tr _ a = a;
wenzelm@8577
   182
  in tr 0 end;
wenzelm@8577
   183
wenzelm@8577
   184
fun quote_tr name t = Abs ("s", dummyT, antiquote_tr name (Term.incr_boundvars 1 t));
wenzelm@8577
   185
wenzelm@5084
   186
fun quote_antiquote_tr quoteN antiquoteN name =
wenzelm@5084
   187
  let
wenzelm@8577
   188
    fun tr [t] = Lexicon.const name $ quote_tr antiquoteN t
wenzelm@8577
   189
      | tr ts = raise TERM ("quote_tr", ts);
wenzelm@8577
   190
  in (quoteN, tr) end;
wenzelm@5084
   191
wenzelm@5084
   192
wenzelm@35145
   193
(* corresponding updates *)
wenzelm@35145
   194
wenzelm@35145
   195
fun update_name_tr (Free (x, T) :: ts) = list_comb (Free (suffix "_update" x, T), ts)
wenzelm@35145
   196
  | update_name_tr (Const (x, T) :: ts) = list_comb (Const (suffix "_update" x, T), ts)
wenzelm@35145
   197
  | update_name_tr (((c as Const ("_constrain", _)) $ t $ ty) :: ts) =
wenzelm@42053
   198
      if Type_Ext.is_position ty then list_comb (c $ update_name_tr [t] $ ty, ts)
wenzelm@42053
   199
      else
wenzelm@42053
   200
        list_comb (c $ update_name_tr [t] $
wenzelm@42080
   201
          (Lexicon.fun_type $
wenzelm@42080
   202
            (Lexicon.fun_type $ Lexicon.dummy_type $ ty) $ Lexicon.dummy_type), ts)
wenzelm@35145
   203
  | update_name_tr ts = raise TERM ("update_name_tr", ts);
wenzelm@35145
   204
wenzelm@35145
   205
wenzelm@14697
   206
(* indexed syntax *)
wenzelm@14697
   207
wenzelm@14697
   208
fun struct_ast_tr (*"_struct"*) [Ast.Appl [Ast.Constant "_index", ast]] = ast
wenzelm@14697
   209
  | struct_ast_tr (*"_struct"*) asts = Ast.mk_appl (Ast.Constant "_struct") asts;
wenzelm@14697
   210
wenzelm@14697
   211
fun index_ast_tr ast =
wenzelm@14697
   212
  Ast.mk_appl (Ast.Constant "_index") [Ast.mk_appl (Ast.Constant "_struct") [ast]];
wenzelm@14697
   213
wenzelm@14697
   214
fun indexdefault_ast_tr (*"_indexdefault"*) [] =
wenzelm@14697
   215
      index_ast_tr (Ast.Constant "_indexdefault")
wenzelm@14697
   216
  | indexdefault_ast_tr (*"_indexdefault"*) asts =
wenzelm@14697
   217
      raise Ast.AST ("indexdefault_ast_tr", asts);
wenzelm@14697
   218
wenzelm@14697
   219
fun indexnum_ast_tr (*"_indexnum"*) [ast] =
wenzelm@14697
   220
      index_ast_tr (Ast.mk_appl (Ast.Constant "_indexnum") [ast])
wenzelm@14697
   221
  | indexnum_ast_tr (*"_indexnum"*) asts = raise Ast.AST ("indexnum_ast_tr", asts);
wenzelm@12122
   222
wenzelm@14697
   223
fun indexvar_ast_tr (*"_indexvar"*) [] =
wenzelm@14697
   224
      Ast.mk_appl (Ast.Constant "_index") [Ast.Variable "some_index"]
wenzelm@14697
   225
  | indexvar_ast_tr (*"_indexvar"*) asts = raise Ast.AST ("indexvar_ast_tr", asts);
wenzelm@14697
   226
wenzelm@14697
   227
fun index_tr (*"_index"*) [t] = t
wenzelm@14697
   228
  | index_tr (*"_index"*) ts = raise TERM ("index_tr", ts);
wenzelm@14697
   229
wenzelm@14697
   230
wenzelm@14697
   231
(* implicit structures *)
wenzelm@14697
   232
wenzelm@14697
   233
fun the_struct structs i =
wenzelm@30146
   234
  if 1 <= i andalso i <= length structs then nth structs (i - 1)
wenzelm@31542
   235
  else error ("Illegal reference to implicit structure #" ^ string_of_int i);
wenzelm@14697
   236
wenzelm@14697
   237
fun struct_tr structs (*"_struct"*) [Const ("_indexdefault", _)] =
wenzelm@14697
   238
      Lexicon.free (the_struct structs 1)
wenzelm@14697
   239
  | struct_tr structs (*"_struct"*) [t as (Const ("_indexnum", _) $ Const (s, _))] =
wenzelm@14697
   240
      Lexicon.free (the_struct structs
skalberg@15531
   241
        (case Lexicon.read_nat s of SOME n => n | NONE => raise TERM ("struct_tr", [t])))
wenzelm@14697
   242
  | struct_tr _ (*"_struct"*) ts = raise TERM ("struct_tr", ts);
wenzelm@12122
   243
wenzelm@12122
   244
wenzelm@5084
   245
wenzelm@548
   246
(** print (ast) translations **)
wenzelm@548
   247
wenzelm@14647
   248
(* types *)
wenzelm@14647
   249
wenzelm@14647
   250
fun non_typed_tr' f _ _ ts = f ts;
wenzelm@14647
   251
fun non_typed_tr'' f x _ _ ts = f x ts;
wenzelm@14647
   252
wenzelm@14647
   253
wenzelm@548
   254
(* application *)
wenzelm@548
   255
wenzelm@5690
   256
fun appl_ast_tr' (f, []) = raise Ast.AST ("appl_ast_tr'", [f])
wenzelm@5690
   257
  | appl_ast_tr' (f, args) = Ast.Appl [Ast.Constant "_appl", f, Ast.fold_ast "_args" args];
wenzelm@548
   258
wenzelm@5690
   259
fun applC_ast_tr' (f, []) = raise Ast.AST ("applC_ast_tr'", [f])
wenzelm@5690
   260
  | applC_ast_tr' (f, args) = Ast.Appl [Ast.Constant "_applC", f, Ast.fold_ast "_cargs" args];
clasohm@922
   261
wenzelm@548
   262
wenzelm@548
   263
(* abstraction *)
wenzelm@548
   264
wenzelm@19311
   265
fun mark_boundT (x, T) = Const ("_bound", T --> T) $ Free (x, T);
wenzelm@2698
   266
fun mark_bound x = mark_boundT (x, dummyT);
wenzelm@2698
   267
wenzelm@18958
   268
fun bound_vars vars body =
wenzelm@18958
   269
  subst_bounds (map mark_boundT (Term.rename_wrt_term body vars), body);
wenzelm@18958
   270
wenzelm@548
   271
fun strip_abss vars_of body_of tm =
wenzelm@548
   272
  let
wenzelm@548
   273
    val vars = vars_of tm;
wenzelm@548
   274
    val body = body_of tm;
wenzelm@29276
   275
    val rev_new_vars = Term.rename_wrt_term body vars;
wenzelm@21750
   276
    fun subst (x, T) b =
wenzelm@42083
   277
      if can Name.dest_internal x andalso not (Term.is_dependent b)
wenzelm@21750
   278
      then (Const ("_idtdummy", T), incr_boundvars ~1 b)
wenzelm@21750
   279
      else (mark_boundT (x, T), Term.subst_bound (mark_bound x, b));
wenzelm@21750
   280
    val (rev_vars', body') = fold_map subst rev_new_vars body;
wenzelm@21750
   281
  in (rev rev_vars', body') end;
wenzelm@548
   282
wenzelm@3928
   283
wenzelm@548
   284
(*do (partial) eta-contraction before printing*)
wenzelm@548
   285
wenzelm@39128
   286
val eta_contract_default = Unsynchronized.ref true;
wenzelm@39163
   287
val eta_contract_raw = Config.declare "eta_contract" (fn _ => Config.Bool (! eta_contract_default));
wenzelm@39163
   288
val eta_contract = Config.bool eta_contract_raw;
wenzelm@548
   289
wenzelm@39128
   290
fun eta_contr ctxt tm =
wenzelm@548
   291
  let
wenzelm@3928
   292
    fun is_aprop (Const ("_aprop", _)) = true
wenzelm@3928
   293
      | is_aprop _ = false;
wenzelm@3928
   294
wenzelm@548
   295
    fun eta_abs (Abs (a, T, t)) =
wenzelm@548
   296
          (case eta_abs t of
wenzelm@548
   297
            t' as f $ u =>
wenzelm@548
   298
              (case eta_abs u of
wenzelm@548
   299
                Bound 0 =>
wenzelm@42083
   300
                  if Term.is_dependent f orelse is_aprop f then Abs (a, T, t')
wenzelm@42083
   301
                  else incr_boundvars ~1 f
wenzelm@548
   302
              | _ => Abs (a, T, t'))
wenzelm@548
   303
          | t' => Abs (a, T, t'))
wenzelm@548
   304
      | eta_abs t = t;
wenzelm@548
   305
  in
wenzelm@39128
   306
    if Config.get ctxt eta_contract then eta_abs tm else tm
wenzelm@548
   307
  end;
wenzelm@548
   308
wenzelm@548
   309
wenzelm@39128
   310
fun abs_tr' ctxt tm =
wenzelm@19473
   311
  uncurry (fold_rev (fn x => fn t => Lexicon.const "_abs" $ x $ t))
wenzelm@39128
   312
    (strip_abss strip_abs_vars strip_abs_body (eta_contr ctxt tm));
wenzelm@548
   313
wenzelm@14697
   314
fun atomic_abs_tr' (x, T, t) =
wenzelm@29276
   315
  let val [xT] = Term.rename_wrt_term t [(x, T)]
wenzelm@14697
   316
  in (mark_boundT xT, subst_bound (mark_bound (fst xT), t)) end;
nipkow@13762
   317
wenzelm@548
   318
fun abs_ast_tr' (*"_abs"*) asts =
wenzelm@5690
   319
  (case Ast.unfold_ast_p "_abs" (Ast.Appl (Ast.Constant "_abs" :: asts)) of
wenzelm@5690
   320
    ([], _) => raise Ast.AST ("abs_ast_tr'", asts)
wenzelm@5690
   321
  | (xs, body) => Ast.Appl [Ast.Constant "_lambda", Ast.fold_ast "_pttrns" xs, body]);
wenzelm@548
   322
haftmann@32120
   323
fun preserve_binder_abs_tr' name syn = (name, fn (Abs abs :: ts) =>
haftmann@32120
   324
  let val (x, t) = atomic_abs_tr' abs
haftmann@32120
   325
  in list_comb (Lexicon.const syn $ x $ t, ts) end);
haftmann@32120
   326
haftmann@32120
   327
fun preserve_binder_abs2_tr' name syn = (name, fn (A :: Abs abs :: ts) =>
haftmann@32120
   328
  let val (x, t) = atomic_abs_tr' abs
haftmann@32120
   329
  in list_comb (Lexicon.const syn $ x $ A $ t, ts) end);
haftmann@32120
   330
wenzelm@548
   331
wenzelm@548
   332
(* binder *)
wenzelm@548
   333
wenzelm@21535
   334
fun mk_binder_tr' (name, syn) =
wenzelm@548
   335
  let
wenzelm@548
   336
    fun mk_idts [] = raise Match    (*abort translation*)
wenzelm@548
   337
      | mk_idts [idt] = idt
wenzelm@5690
   338
      | mk_idts (idt :: idts) = Lexicon.const "_idts" $ idt $ mk_idts idts;
wenzelm@548
   339
wenzelm@548
   340
    fun tr' t =
wenzelm@548
   341
      let
wenzelm@548
   342
        val (xs, bd) = strip_abss (strip_qnt_vars name) (strip_qnt_body name) t;
wenzelm@21535
   343
      in Lexicon.const syn $ mk_idts xs $ bd end;
wenzelm@548
   344
wenzelm@21535
   345
    fun binder_tr' (t :: ts) = Term.list_comb (tr' (Lexicon.const name $ t), ts)
wenzelm@21535
   346
      | binder_tr' [] = raise Match;
wenzelm@21535
   347
  in (name, binder_tr') end;
wenzelm@548
   348
wenzelm@548
   349
wenzelm@3691
   350
(* idtyp constraints *)
wenzelm@548
   351
wenzelm@42045
   352
fun idtyp_ast_tr' a [Ast.Appl [Ast.Constant "_constrain", x, ty], xs] =
wenzelm@42045
   353
      Ast.Appl [Ast.Constant a, Ast.Appl [Ast.Constant "_idtyp", x, ty], xs]
wenzelm@3691
   354
  | idtyp_ast_tr' _ _ = raise Match;
wenzelm@548
   355
wenzelm@548
   356
wenzelm@28628
   357
(* type propositions *)
wenzelm@28628
   358
wenzelm@35255
   359
fun type_prop_tr' _ (*"_type_prop"*) T [Const ("\\<^const>Pure.sort_constraint", _)] =
wenzelm@37216
   360
      Lexicon.const "_sort_constraint" $ Type_Ext.term_of_typ true T
wenzelm@28628
   361
  | type_prop_tr' show_sorts (*"_type_prop"*) T [t] =
wenzelm@37216
   362
      Lexicon.const "_ofclass" $ Type_Ext.term_of_typ show_sorts T $ t
wenzelm@28628
   363
  | type_prop_tr' _ (*"_type_prop"*) T ts = raise TYPE ("type_prop_tr'", [T], ts);
wenzelm@28628
   364
wenzelm@28628
   365
wenzelm@548
   366
(* meta propositions *)
wenzelm@548
   367
wenzelm@4148
   368
fun prop_tr' tm =
wenzelm@548
   369
  let
wenzelm@5690
   370
    fun aprop t = Lexicon.const "_aprop" $ t;
wenzelm@548
   371
wenzelm@2698
   372
    fun is_prop Ts t =
wenzelm@2698
   373
      fastype_of1 (Ts, t) = propT handle TERM _ => false;
wenzelm@548
   374
wenzelm@35429
   375
    fun is_term (Const ("Pure.term", _) $ _) = true
wenzelm@19848
   376
      | is_term _ = false;
wenzelm@19848
   377
wenzelm@548
   378
    fun tr' _ (t as Const _) = t
wenzelm@18478
   379
      | tr' Ts (t as Const ("_bound", _) $ u) =
wenzelm@18478
   380
          if is_prop Ts u then aprop t else t
wenzelm@2698
   381
      | tr' _ (t as Free (x, T)) =
wenzelm@5690
   382
          if T = propT then aprop (Lexicon.free x) else t
wenzelm@2698
   383
      | tr' _ (t as Var (xi, T)) =
wenzelm@5690
   384
          if T = propT then aprop (Lexicon.var xi) else t
wenzelm@2698
   385
      | tr' Ts (t as Bound _) =
wenzelm@2698
   386
          if is_prop Ts t then aprop t else t
wenzelm@2698
   387
      | tr' Ts (Abs (x, T, t)) = Abs (x, T, tr' (T :: Ts) t)
wenzelm@35429
   388
      | tr' Ts (t as t1 $ (t2 as Const ("TYPE", Type ("itself", [T])))) =
wenzelm@28628
   389
          if is_prop Ts t andalso not (is_term t) then Const ("_type_prop", T) $ tr' Ts t1
wenzelm@2698
   390
          else tr' Ts t1 $ tr' Ts t2
wenzelm@2698
   391
      | tr' Ts (t as t1 $ t2) =
wenzelm@5690
   392
          (if is_Const (Term.head_of t) orelse not (is_prop Ts t)
wenzelm@2698
   393
            then I else aprop) (tr' Ts t1 $ tr' Ts t2);
wenzelm@16612
   394
  in tr' [] tm end;
wenzelm@548
   395
wenzelm@2698
   396
wenzelm@548
   397
(* meta implication *)
wenzelm@548
   398
wenzelm@548
   399
fun impl_ast_tr' (*"==>"*) asts =
wenzelm@37216
   400
  if Type_Ext.no_brackets () then raise Match
wenzelm@10572
   401
  else
wenzelm@35255
   402
    (case Ast.unfold_ast_p "\\<^const>==>" (Ast.Appl (Ast.Constant "\\<^const>==>" :: asts)) of
wenzelm@16612
   403
      (prems as _ :: _ :: _, concl) =>
wenzelm@16612
   404
        let
wenzelm@16612
   405
          val (asms, asm) = split_last prems;
wenzelm@16612
   406
          val asms' = Ast.fold_ast_p "_asms" (asms, Ast.Appl [Ast.Constant "_asm", asm]);
wenzelm@16612
   407
        in Ast.Appl [Ast.Constant "_bigimpl", asms', concl] end
schirmer@15421
   408
    | _ => raise Match);
schirmer@15421
   409
wenzelm@548
   410
wenzelm@4148
   411
(* type reflection *)
wenzelm@4148
   412
wenzelm@4148
   413
fun type_tr' show_sorts (*"TYPE"*) (Type ("itself", [T])) ts =
wenzelm@37216
   414
      Term.list_comb (Lexicon.const "_TYPE" $ Type_Ext.term_of_typ show_sorts T, ts)
wenzelm@4148
   415
  | type_tr' _ _ _ = raise Match;
wenzelm@4148
   416
wenzelm@4148
   417
wenzelm@19577
   418
(* type constraints *)
wenzelm@19577
   419
wenzelm@19577
   420
fun type_constraint_tr' show_sorts (*"_type_constraint_"*) (Type ("fun", [T, _])) (t :: ts) =
wenzelm@37216
   421
      Term.list_comb (Lexicon.const Syn_Ext.constrainC $ t $ Type_Ext.term_of_typ show_sorts T, ts)
wenzelm@19577
   422
  | type_constraint_tr' _ _ _ = raise Match;
wenzelm@19577
   423
wenzelm@19577
   424
wenzelm@548
   425
(* dependent / nondependent quantifiers *)
wenzelm@548
   426
wenzelm@20202
   427
fun var_abs mark (x, T, b) =
wenzelm@20202
   428
  let val ([x'], _) = Name.variants [x] (Term.declare_term_names b Name.context)
wenzelm@20202
   429
  in (x', subst_bound (mark (x', T), b)) end;
wenzelm@20202
   430
wenzelm@20202
   431
val variant_abs = var_abs Free;
wenzelm@20202
   432
val variant_abs' = var_abs mark_boundT;
wenzelm@2698
   433
wenzelm@548
   434
fun dependent_tr' (q, r) (A :: Abs (x, T, B) :: ts) =
wenzelm@42083
   435
      if Term.is_dependent B then
wenzelm@2698
   436
        let val (x', B') = variant_abs' (x, dummyT, B);
wenzelm@5690
   437
        in Term.list_comb (Lexicon.const q $ mark_boundT (x', T) $ A $ B', ts) end
wenzelm@42084
   438
      else Term.list_comb (Lexicon.const r $ A $ incr_boundvars ~1 B, ts)
wenzelm@548
   439
  | dependent_tr' _ _ = raise Match;
wenzelm@548
   440
wenzelm@548
   441
wenzelm@5084
   442
(* quote / antiquote *)
wenzelm@5084
   443
wenzelm@8577
   444
fun antiquote_tr' name =
wenzelm@8577
   445
  let
wenzelm@8577
   446
    fun tr' i (t $ u) =
wenzelm@42084
   447
          if u aconv Bound i then Lexicon.const name $ tr' i t
wenzelm@42084
   448
          else tr' i t $ tr' i u
wenzelm@8577
   449
      | tr' i (Abs (x, T, t)) = Abs (x, T, tr' (i + 1) t)
wenzelm@18139
   450
      | tr' i a = if a aconv Bound i then raise Match else a;
wenzelm@8577
   451
  in tr' 0 end;
wenzelm@8577
   452
wenzelm@8577
   453
fun quote_tr' name (Abs (_, _, t)) = Term.incr_boundvars ~1 (antiquote_tr' name t)
wenzelm@8577
   454
  | quote_tr' _ _ = raise Match;
wenzelm@8577
   455
wenzelm@5084
   456
fun quote_antiquote_tr' quoteN antiquoteN name =
wenzelm@5084
   457
  let
wenzelm@8577
   458
    fun tr' (t :: ts) = Term.list_comb (Lexicon.const quoteN $ quote_tr' antiquoteN t, ts)
wenzelm@8577
   459
      | tr' _ = raise Match;
wenzelm@8577
   460
  in (name, tr') end;
wenzelm@5084
   461
wenzelm@5084
   462
wenzelm@35145
   463
(* corresponding updates *)
wenzelm@35145
   464
wenzelm@42080
   465
local
wenzelm@42080
   466
wenzelm@42080
   467
fun upd_type (Type ("fun", [Type ("fun", [_, T]), _])) = T
wenzelm@42080
   468
  | upd_type _ = dummyT;
wenzelm@42080
   469
wenzelm@35145
   470
fun upd_tr' (x_upd, T) =
wenzelm@35145
   471
  (case try (unsuffix "_update") x_upd of
wenzelm@42080
   472
    SOME x => (x, upd_type T)
wenzelm@35145
   473
  | NONE => raise Match);
wenzelm@35145
   474
wenzelm@42080
   475
in
wenzelm@42080
   476
wenzelm@35145
   477
fun update_name_tr' (Free x) = Free (upd_tr' x)
wenzelm@35145
   478
  | update_name_tr' ((c as Const ("_free", _)) $ Free x) = c $ Free (upd_tr' x)
wenzelm@35145
   479
  | update_name_tr' (Const x) = Const (upd_tr' x)
wenzelm@35145
   480
  | update_name_tr' _ = raise Match;
wenzelm@35145
   481
wenzelm@42080
   482
end;
wenzelm@42080
   483
wenzelm@35145
   484
wenzelm@14697
   485
(* indexed syntax *)
wenzelm@548
   486
wenzelm@14697
   487
fun index_ast_tr' (*"_index"*) [Ast.Appl [Ast.Constant "_struct", ast]] = ast
wenzelm@14697
   488
  | index_ast_tr' _ = raise Match;
wenzelm@14697
   489
wenzelm@14697
   490
wenzelm@14697
   491
(* implicit structures *)
wenzelm@14697
   492
wenzelm@14697
   493
fun the_struct' structs s =
wenzelm@14697
   494
  [(case Lexicon.read_nat s of
wenzelm@18678
   495
    SOME i => Ast.Variable (the_struct structs i handle ERROR _ => raise Match)
skalberg@15531
   496
  | NONE => raise Match)] |> Ast.mk_appl (Ast.Constant "_free");
wenzelm@14697
   497
wenzelm@14697
   498
fun struct_ast_tr' structs (*"_struct"*) [Ast.Constant "_indexdefault"] =
wenzelm@14697
   499
      the_struct' structs "1"
wenzelm@14697
   500
  | struct_ast_tr' structs (*"_struct"*) [Ast.Appl [Ast.Constant "_indexnum", Ast.Constant s]] =
wenzelm@14697
   501
      the_struct' structs s
wenzelm@14697
   502
  | struct_ast_tr' _ _ = raise Match;
wenzelm@14697
   503
wenzelm@14697
   504
wenzelm@14697
   505
wenzelm@14697
   506
(** Pure translations **)
wenzelm@548
   507
wenzelm@548
   508
val pure_trfuns =
wenzelm@42057
   509
  ([("_strip_positions", strip_positions_ast_tr),
wenzelm@42057
   510
    ("_constify", constify_ast_tr),
wenzelm@35145
   511
    ("_appl", appl_ast_tr),
wenzelm@35145
   512
    ("_applC", applC_ast_tr),
wenzelm@35145
   513
    ("_lambda", lambda_ast_tr),
wenzelm@35145
   514
    ("_idtyp", idtyp_ast_tr),
wenzelm@35145
   515
    ("_idtypdummy", idtypdummy_ast_tr),
wenzelm@35145
   516
    ("_bigimpl", bigimpl_ast_tr),
wenzelm@35145
   517
    ("_indexdefault", indexdefault_ast_tr),
wenzelm@35145
   518
    ("_indexnum", indexnum_ast_tr),
wenzelm@35145
   519
    ("_indexvar", indexvar_ast_tr),
wenzelm@35145
   520
    ("_struct", struct_ast_tr)],
wenzelm@35145
   521
   [("_abs", abs_tr),
wenzelm@35145
   522
    ("_aprop", aprop_tr),
wenzelm@35145
   523
    ("_ofclass", ofclass_tr),
wenzelm@35145
   524
    ("_sort_constraint", sort_constraint_tr),
wenzelm@35145
   525
    ("_TYPE", type_tr),
wenzelm@35145
   526
    ("_DDDOT", dddot_tr),
wenzelm@35145
   527
    ("_update_name", update_name_tr),
wenzelm@35145
   528
    ("_index", index_tr)],
wenzelm@35198
   529
   ([]: (string * (term list -> term)) list),
wenzelm@35145
   530
   [("_abs", abs_ast_tr'),
wenzelm@35145
   531
    ("_idts", idtyp_ast_tr' "_idts"),
wenzelm@35145
   532
    ("_pttrns", idtyp_ast_tr' "_pttrns"),
wenzelm@35255
   533
    ("\\<^const>==>", impl_ast_tr'),
wenzelm@35145
   534
    ("_index", index_ast_tr')]);
wenzelm@548
   535
wenzelm@2698
   536
val pure_trfunsT =
wenzelm@35255
   537
 [("_type_prop", type_prop_tr'),
wenzelm@35255
   538
  ("\\<^const>TYPE", type_tr'),
wenzelm@35255
   539
  ("_type_constraint_", type_constraint_tr')];
wenzelm@2698
   540
wenzelm@14697
   541
fun struct_trfuns structs =
wenzelm@14697
   542
  ([], [("_struct", struct_tr structs)], [], [("_struct", struct_ast_tr' structs)]);
wenzelm@14697
   543
wenzelm@548
   544
wenzelm@548
   545
wenzelm@42043
   546
(** parsetree_to_ast **)
wenzelm@548
   547
wenzelm@42048
   548
fun parsetree_to_ast ctxt constrain_pos trf =
wenzelm@548
   549
  let
wenzelm@548
   550
    fun trans a args =
wenzelm@548
   551
      (case trf a of
skalberg@15531
   552
        NONE => Ast.mk_appl (Ast.Constant a) args
wenzelm@23937
   553
      | SOME f => f ctxt args);
wenzelm@548
   554
wenzelm@42048
   555
    fun ast_of (Parser.Node ("_constrain_position", [pt as Parser.Tip tok])) =
wenzelm@42048
   556
          if constrain_pos then
wenzelm@42048
   557
            Ast.Appl [Ast.Constant "_constrain", ast_of pt,
wenzelm@42048
   558
              Ast.Variable (Lexicon.encode_position (Lexicon.pos_of_token tok))]
wenzelm@42048
   559
          else ast_of pt
wenzelm@42048
   560
      | ast_of (Parser.Node (a, pts)) = trans a (map ast_of pts)
wenzelm@5690
   561
      | ast_of (Parser.Tip tok) = Ast.Variable (Lexicon.str_of_token tok);
wenzelm@42043
   562
  in ast_of end;
wenzelm@548
   563
wenzelm@548
   564
wenzelm@548
   565
wenzelm@42043
   566
(** ast_to_term **)
wenzelm@548
   567
wenzelm@42043
   568
fun ast_to_term ctxt trf =
wenzelm@548
   569
  let
wenzelm@548
   570
    fun trans a args =
wenzelm@548
   571
      (case trf a of
skalberg@15531
   572
        NONE => Term.list_comb (Lexicon.const a, args)
wenzelm@23937
   573
      | SOME f => f ctxt args);
wenzelm@548
   574
wenzelm@5690
   575
    fun term_of (Ast.Constant a) = trans a []
wenzelm@5690
   576
      | term_of (Ast.Variable x) = Lexicon.read_var x
wenzelm@5690
   577
      | term_of (Ast.Appl (Ast.Constant a :: (asts as _ :: _))) =
wenzelm@548
   578
          trans a (map term_of asts)
wenzelm@5690
   579
      | term_of (Ast.Appl (ast :: (asts as _ :: _))) =
wenzelm@5690
   580
          Term.list_comb (term_of ast, map term_of asts)
wenzelm@5690
   581
      | term_of (ast as Ast.Appl _) = raise Ast.AST ("ast_to_term: malformed ast", [ast]);
wenzelm@42043
   582
  in term_of end;
wenzelm@548
   583
wenzelm@548
   584
end;