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