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