src/Pure/Syntax/syn_trans.ML
author wenzelm
Sun Feb 21 21:08:25 2010 +0100 (2010-02-21)
changeset 35255 2cb27605301f
parent 35198 f95c6440c1c7
child 35429 afa8cf9e63d8
permissions -rw-r--r--
authentic syntax for *all* term constants;
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@35255
   132
fun mk_type ty =
wenzelm@35255
   133
  Lexicon.const "_constrain" $
wenzelm@35255
   134
    Lexicon.const "\\<^const>TYPE" $ (Lexicon.const "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@17788
   146
fun aprop_tr (*"_aprop"*) [t] = Lexicon.const "_constrain" $ t $ Lexicon.const "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@8595
   169
fun dddot_tr (*"_DDDOT"*) ts = Term.list_comb (Lexicon.var SynExt.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@35145
   198
      list_comb (c $ update_name_tr [t] $ (Lexicon.const "fun" $ ty $ Lexicon.const "dummy"), ts)
wenzelm@35145
   199
  | update_name_tr ts = raise TERM ("update_name_tr", ts);
wenzelm@35145
   200
wenzelm@35145
   201
wenzelm@14697
   202
(* indexed syntax *)
wenzelm@14697
   203
wenzelm@14697
   204
fun struct_ast_tr (*"_struct"*) [Ast.Appl [Ast.Constant "_index", ast]] = ast
wenzelm@14697
   205
  | struct_ast_tr (*"_struct"*) asts = Ast.mk_appl (Ast.Constant "_struct") asts;
wenzelm@14697
   206
wenzelm@14697
   207
fun index_ast_tr ast =
wenzelm@14697
   208
  Ast.mk_appl (Ast.Constant "_index") [Ast.mk_appl (Ast.Constant "_struct") [ast]];
wenzelm@14697
   209
wenzelm@14697
   210
fun indexdefault_ast_tr (*"_indexdefault"*) [] =
wenzelm@14697
   211
      index_ast_tr (Ast.Constant "_indexdefault")
wenzelm@14697
   212
  | indexdefault_ast_tr (*"_indexdefault"*) asts =
wenzelm@14697
   213
      raise Ast.AST ("indexdefault_ast_tr", asts);
wenzelm@14697
   214
wenzelm@14697
   215
fun indexnum_ast_tr (*"_indexnum"*) [ast] =
wenzelm@14697
   216
      index_ast_tr (Ast.mk_appl (Ast.Constant "_indexnum") [ast])
wenzelm@14697
   217
  | indexnum_ast_tr (*"_indexnum"*) asts = raise Ast.AST ("indexnum_ast_tr", asts);
wenzelm@12122
   218
wenzelm@14697
   219
fun indexvar_ast_tr (*"_indexvar"*) [] =
wenzelm@14697
   220
      Ast.mk_appl (Ast.Constant "_index") [Ast.Variable "some_index"]
wenzelm@14697
   221
  | indexvar_ast_tr (*"_indexvar"*) asts = raise Ast.AST ("indexvar_ast_tr", asts);
wenzelm@14697
   222
wenzelm@14697
   223
fun index_tr (*"_index"*) [t] = t
wenzelm@14697
   224
  | index_tr (*"_index"*) ts = raise TERM ("index_tr", ts);
wenzelm@14697
   225
wenzelm@14697
   226
wenzelm@14697
   227
(* implicit structures *)
wenzelm@14697
   228
wenzelm@14697
   229
fun the_struct structs i =
wenzelm@30146
   230
  if 1 <= i andalso i <= length structs then nth structs (i - 1)
wenzelm@31542
   231
  else error ("Illegal reference to implicit structure #" ^ string_of_int i);
wenzelm@14697
   232
wenzelm@14697
   233
fun struct_tr structs (*"_struct"*) [Const ("_indexdefault", _)] =
wenzelm@14697
   234
      Lexicon.free (the_struct structs 1)
wenzelm@14697
   235
  | struct_tr structs (*"_struct"*) [t as (Const ("_indexnum", _) $ Const (s, _))] =
wenzelm@14697
   236
      Lexicon.free (the_struct structs
skalberg@15531
   237
        (case Lexicon.read_nat s of SOME n => n | NONE => raise TERM ("struct_tr", [t])))
wenzelm@14697
   238
  | struct_tr _ (*"_struct"*) ts = raise TERM ("struct_tr", ts);
wenzelm@12122
   239
wenzelm@12122
   240
wenzelm@5084
   241
wenzelm@548
   242
(** print (ast) translations **)
wenzelm@548
   243
wenzelm@14647
   244
(* types *)
wenzelm@14647
   245
wenzelm@14647
   246
fun non_typed_tr' f _ _ ts = f ts;
wenzelm@14647
   247
fun non_typed_tr'' f x _ _ ts = f x ts;
wenzelm@14647
   248
wenzelm@14647
   249
wenzelm@548
   250
(* application *)
wenzelm@548
   251
wenzelm@5690
   252
fun appl_ast_tr' (f, []) = raise Ast.AST ("appl_ast_tr'", [f])
wenzelm@5690
   253
  | appl_ast_tr' (f, args) = Ast.Appl [Ast.Constant "_appl", f, Ast.fold_ast "_args" args];
wenzelm@548
   254
wenzelm@5690
   255
fun applC_ast_tr' (f, []) = raise Ast.AST ("applC_ast_tr'", [f])
wenzelm@5690
   256
  | applC_ast_tr' (f, args) = Ast.Appl [Ast.Constant "_applC", f, Ast.fold_ast "_cargs" args];
clasohm@922
   257
wenzelm@548
   258
wenzelm@548
   259
(* abstraction *)
wenzelm@548
   260
wenzelm@19311
   261
fun mark_boundT (x, T) = Const ("_bound", T --> T) $ Free (x, T);
wenzelm@2698
   262
fun mark_bound x = mark_boundT (x, dummyT);
wenzelm@2698
   263
wenzelm@18958
   264
fun bound_vars vars body =
wenzelm@18958
   265
  subst_bounds (map mark_boundT (Term.rename_wrt_term body vars), body);
wenzelm@18958
   266
wenzelm@548
   267
fun strip_abss vars_of body_of tm =
wenzelm@548
   268
  let
wenzelm@548
   269
    val vars = vars_of tm;
wenzelm@548
   270
    val body = body_of tm;
wenzelm@29276
   271
    val rev_new_vars = Term.rename_wrt_term body vars;
wenzelm@21750
   272
    fun subst (x, T) b =
wenzelm@21750
   273
      if can Name.dest_internal x andalso not (Term.loose_bvar1 (b, 0))
wenzelm@21750
   274
      then (Const ("_idtdummy", T), incr_boundvars ~1 b)
wenzelm@21750
   275
      else (mark_boundT (x, T), Term.subst_bound (mark_bound x, b));
wenzelm@21750
   276
    val (rev_vars', body') = fold_map subst rev_new_vars body;
wenzelm@21750
   277
  in (rev rev_vars', body') end;
wenzelm@548
   278
wenzelm@3928
   279
wenzelm@548
   280
(*do (partial) eta-contraction before printing*)
wenzelm@548
   281
wenzelm@32738
   282
val eta_contract = Unsynchronized.ref true;
wenzelm@548
   283
wenzelm@548
   284
fun eta_contr tm =
wenzelm@548
   285
  let
wenzelm@3928
   286
    fun is_aprop (Const ("_aprop", _)) = true
wenzelm@3928
   287
      | is_aprop _ = false;
wenzelm@3928
   288
wenzelm@548
   289
    fun eta_abs (Abs (a, T, t)) =
wenzelm@548
   290
          (case eta_abs t of
wenzelm@548
   291
            t' as f $ u =>
wenzelm@548
   292
              (case eta_abs u of
wenzelm@548
   293
                Bound 0 =>
wenzelm@5084
   294
                  if Term.loose_bvar1 (f, 0) orelse is_aprop f then Abs (a, T, t')
wenzelm@3928
   295
                  else  incr_boundvars ~1 f
wenzelm@548
   296
              | _ => Abs (a, T, t'))
wenzelm@548
   297
          | t' => Abs (a, T, t'))
wenzelm@548
   298
      | eta_abs t = t;
wenzelm@548
   299
  in
wenzelm@548
   300
    if ! eta_contract then eta_abs tm else tm
wenzelm@548
   301
  end;
wenzelm@548
   302
wenzelm@548
   303
wenzelm@548
   304
fun abs_tr' tm =
wenzelm@19473
   305
  uncurry (fold_rev (fn x => fn t => Lexicon.const "_abs" $ x $ t))
wenzelm@548
   306
    (strip_abss strip_abs_vars strip_abs_body (eta_contr tm));
wenzelm@548
   307
wenzelm@14697
   308
fun atomic_abs_tr' (x, T, t) =
wenzelm@29276
   309
  let val [xT] = Term.rename_wrt_term t [(x, T)]
wenzelm@14697
   310
  in (mark_boundT xT, subst_bound (mark_bound (fst xT), t)) end;
nipkow@13762
   311
wenzelm@548
   312
fun abs_ast_tr' (*"_abs"*) asts =
wenzelm@5690
   313
  (case Ast.unfold_ast_p "_abs" (Ast.Appl (Ast.Constant "_abs" :: asts)) of
wenzelm@5690
   314
    ([], _) => raise Ast.AST ("abs_ast_tr'", asts)
wenzelm@5690
   315
  | (xs, body) => Ast.Appl [Ast.Constant "_lambda", Ast.fold_ast "_pttrns" xs, body]);
wenzelm@548
   316
haftmann@32120
   317
fun preserve_binder_abs_tr' name syn = (name, fn (Abs abs :: ts) =>
haftmann@32120
   318
  let val (x, t) = atomic_abs_tr' abs
haftmann@32120
   319
  in list_comb (Lexicon.const syn $ x $ t, ts) end);
haftmann@32120
   320
haftmann@32120
   321
fun preserve_binder_abs2_tr' name syn = (name, fn (A :: Abs abs :: ts) =>
haftmann@32120
   322
  let val (x, t) = atomic_abs_tr' abs
haftmann@32120
   323
  in list_comb (Lexicon.const syn $ x $ A $ t, ts) end);
haftmann@32120
   324
wenzelm@548
   325
wenzelm@548
   326
(* binder *)
wenzelm@548
   327
wenzelm@21535
   328
fun mk_binder_tr' (name, syn) =
wenzelm@548
   329
  let
wenzelm@548
   330
    fun mk_idts [] = raise Match    (*abort translation*)
wenzelm@548
   331
      | mk_idts [idt] = idt
wenzelm@5690
   332
      | mk_idts (idt :: idts) = Lexicon.const "_idts" $ idt $ mk_idts idts;
wenzelm@548
   333
wenzelm@548
   334
    fun tr' t =
wenzelm@548
   335
      let
wenzelm@548
   336
        val (xs, bd) = strip_abss (strip_qnt_vars name) (strip_qnt_body name) t;
wenzelm@21535
   337
      in Lexicon.const syn $ mk_idts xs $ bd end;
wenzelm@548
   338
wenzelm@21535
   339
    fun binder_tr' (t :: ts) = Term.list_comb (tr' (Lexicon.const name $ t), ts)
wenzelm@21535
   340
      | binder_tr' [] = raise Match;
wenzelm@21535
   341
  in (name, binder_tr') end;
wenzelm@548
   342
wenzelm@548
   343
wenzelm@3691
   344
(* idtyp constraints *)
wenzelm@548
   345
wenzelm@5690
   346
fun idtyp_ast_tr' a [Ast.Appl [Ast.Constant c, x, ty], xs] =
wenzelm@17788
   347
      if c = "_constrain" then
wenzelm@28628
   348
        Ast.Appl [Ast.Constant a, Ast.Appl [Ast.Constant "_idtyp", x, ty], xs]
wenzelm@548
   349
      else raise Match
wenzelm@3691
   350
  | idtyp_ast_tr' _ _ = raise Match;
wenzelm@548
   351
wenzelm@548
   352
wenzelm@28628
   353
(* type propositions *)
wenzelm@28628
   354
wenzelm@35255
   355
fun type_prop_tr' _ (*"_type_prop"*) T [Const ("\\<^const>Pure.sort_constraint", _)] =
wenzelm@28628
   356
      Lexicon.const "_sort_constraint" $ TypeExt.term_of_typ true T
wenzelm@28628
   357
  | type_prop_tr' show_sorts (*"_type_prop"*) T [t] =
wenzelm@28628
   358
      Lexicon.const "_ofclass" $ TypeExt.term_of_typ show_sorts T $ t
wenzelm@28628
   359
  | type_prop_tr' _ (*"_type_prop"*) T ts = raise TYPE ("type_prop_tr'", [T], ts);
wenzelm@28628
   360
wenzelm@28628
   361
wenzelm@548
   362
(* meta propositions *)
wenzelm@548
   363
wenzelm@4148
   364
fun prop_tr' tm =
wenzelm@548
   365
  let
wenzelm@5690
   366
    fun aprop t = Lexicon.const "_aprop" $ t;
wenzelm@548
   367
wenzelm@2698
   368
    fun is_prop Ts t =
wenzelm@2698
   369
      fastype_of1 (Ts, t) = propT handle TERM _ => false;
wenzelm@548
   370
wenzelm@35255
   371
    fun is_term (Const ("\\<^const>Pure.term", _) $ _) = true
wenzelm@19848
   372
      | is_term _ = false;
wenzelm@19848
   373
wenzelm@548
   374
    fun tr' _ (t as Const _) = t
wenzelm@18478
   375
      | tr' Ts (t as Const ("_bound", _) $ u) =
wenzelm@18478
   376
          if is_prop Ts u then aprop t else t
wenzelm@2698
   377
      | tr' _ (t as Free (x, T)) =
wenzelm@5690
   378
          if T = propT then aprop (Lexicon.free x) else t
wenzelm@2698
   379
      | tr' _ (t as Var (xi, T)) =
wenzelm@5690
   380
          if T = propT then aprop (Lexicon.var xi) else t
wenzelm@2698
   381
      | tr' Ts (t as Bound _) =
wenzelm@2698
   382
          if is_prop Ts t then aprop t else t
wenzelm@2698
   383
      | tr' Ts (Abs (x, T, t)) = Abs (x, T, tr' (T :: Ts) t)
wenzelm@35255
   384
      | tr' Ts (t as t1 $ (t2 as Const ("\\<^const>TYPE", Type ("itself", [T])))) =
wenzelm@28628
   385
          if is_prop Ts t andalso not (is_term t) then Const ("_type_prop", T) $ tr' Ts t1
wenzelm@2698
   386
          else tr' Ts t1 $ tr' Ts t2
wenzelm@2698
   387
      | tr' Ts (t as t1 $ t2) =
wenzelm@5690
   388
          (if is_Const (Term.head_of t) orelse not (is_prop Ts t)
wenzelm@2698
   389
            then I else aprop) (tr' Ts t1 $ tr' Ts t2);
wenzelm@16612
   390
  in tr' [] tm end;
wenzelm@548
   391
wenzelm@2698
   392
wenzelm@548
   393
(* meta implication *)
wenzelm@548
   394
wenzelm@548
   395
fun impl_ast_tr' (*"==>"*) asts =
wenzelm@10572
   396
  if TypeExt.no_brackets () then raise Match
wenzelm@10572
   397
  else
wenzelm@35255
   398
    (case Ast.unfold_ast_p "\\<^const>==>" (Ast.Appl (Ast.Constant "\\<^const>==>" :: asts)) of
wenzelm@16612
   399
      (prems as _ :: _ :: _, concl) =>
wenzelm@16612
   400
        let
wenzelm@16612
   401
          val (asms, asm) = split_last prems;
wenzelm@16612
   402
          val asms' = Ast.fold_ast_p "_asms" (asms, Ast.Appl [Ast.Constant "_asm", asm]);
wenzelm@16612
   403
        in Ast.Appl [Ast.Constant "_bigimpl", asms', concl] end
schirmer@15421
   404
    | _ => raise Match);
schirmer@15421
   405
wenzelm@548
   406
wenzelm@4148
   407
(* type reflection *)
wenzelm@4148
   408
wenzelm@4148
   409
fun type_tr' show_sorts (*"TYPE"*) (Type ("itself", [T])) ts =
wenzelm@5690
   410
      Term.list_comb (Lexicon.const "_TYPE" $ TypeExt.term_of_typ show_sorts T, ts)
wenzelm@4148
   411
  | type_tr' _ _ _ = raise Match;
wenzelm@4148
   412
wenzelm@4148
   413
wenzelm@19577
   414
(* type constraints *)
wenzelm@19577
   415
wenzelm@19577
   416
fun type_constraint_tr' show_sorts (*"_type_constraint_"*) (Type ("fun", [T, _])) (t :: ts) =
wenzelm@19577
   417
      Term.list_comb (Lexicon.const SynExt.constrainC $ t $ TypeExt.term_of_typ show_sorts T, ts)
wenzelm@19577
   418
  | type_constraint_tr' _ _ _ = raise Match;
wenzelm@19577
   419
wenzelm@19577
   420
wenzelm@548
   421
(* dependent / nondependent quantifiers *)
wenzelm@548
   422
wenzelm@20202
   423
fun var_abs mark (x, T, b) =
wenzelm@20202
   424
  let val ([x'], _) = Name.variants [x] (Term.declare_term_names b Name.context)
wenzelm@20202
   425
  in (x', subst_bound (mark (x', T), b)) end;
wenzelm@20202
   426
wenzelm@20202
   427
val variant_abs = var_abs Free;
wenzelm@20202
   428
val variant_abs' = var_abs mark_boundT;
wenzelm@2698
   429
wenzelm@548
   430
fun dependent_tr' (q, r) (A :: Abs (x, T, B) :: ts) =
wenzelm@5084
   431
      if Term.loose_bvar1 (B, 0) then
wenzelm@2698
   432
        let val (x', B') = variant_abs' (x, dummyT, B);
wenzelm@5690
   433
        in Term.list_comb (Lexicon.const q $ mark_boundT (x', T) $ A $ B', ts) end
wenzelm@5690
   434
      else Term.list_comb (Lexicon.const r $ A $ B, ts)
wenzelm@548
   435
  | dependent_tr' _ _ = raise Match;
wenzelm@548
   436
wenzelm@548
   437
wenzelm@5084
   438
(* quote / antiquote *)
wenzelm@5084
   439
wenzelm@8577
   440
fun antiquote_tr' name =
wenzelm@8577
   441
  let
wenzelm@8577
   442
    fun tr' i (t $ u) =
wenzelm@18139
   443
      if u aconv Bound i then Lexicon.const name $ tr' i t
wenzelm@8577
   444
      else tr' i t $ tr' i u
wenzelm@8577
   445
      | tr' i (Abs (x, T, t)) = Abs (x, T, tr' (i + 1) t)
wenzelm@18139
   446
      | tr' i a = if a aconv Bound i then raise Match else a;
wenzelm@8577
   447
  in tr' 0 end;
wenzelm@8577
   448
wenzelm@8577
   449
fun quote_tr' name (Abs (_, _, t)) = Term.incr_boundvars ~1 (antiquote_tr' name t)
wenzelm@8577
   450
  | quote_tr' _ _ = raise Match;
wenzelm@8577
   451
wenzelm@5084
   452
fun quote_antiquote_tr' quoteN antiquoteN name =
wenzelm@5084
   453
  let
wenzelm@8577
   454
    fun tr' (t :: ts) = Term.list_comb (Lexicon.const quoteN $ quote_tr' antiquoteN t, ts)
wenzelm@8577
   455
      | tr' _ = raise Match;
wenzelm@8577
   456
  in (name, tr') end;
wenzelm@5084
   457
wenzelm@5084
   458
wenzelm@35145
   459
(* corresponding updates *)
wenzelm@35145
   460
wenzelm@35145
   461
fun upd_tr' (x_upd, T) =
wenzelm@35145
   462
  (case try (unsuffix "_update") x_upd of
wenzelm@35145
   463
    SOME x => (x, if T = dummyT then T else Term.domain_type T)
wenzelm@35145
   464
  | NONE => raise Match);
wenzelm@35145
   465
wenzelm@35145
   466
fun update_name_tr' (Free x) = Free (upd_tr' x)
wenzelm@35145
   467
  | update_name_tr' ((c as Const ("_free", _)) $ Free x) = c $ Free (upd_tr' x)
wenzelm@35145
   468
  | update_name_tr' (Const x) = Const (upd_tr' x)
wenzelm@35145
   469
  | update_name_tr' _ = raise Match;
wenzelm@35145
   470
wenzelm@35145
   471
wenzelm@14697
   472
(* indexed syntax *)
wenzelm@548
   473
wenzelm@14697
   474
fun index_ast_tr' (*"_index"*) [Ast.Appl [Ast.Constant "_struct", ast]] = ast
wenzelm@14697
   475
  | index_ast_tr' _ = raise Match;
wenzelm@14697
   476
wenzelm@14697
   477
wenzelm@14697
   478
(* implicit structures *)
wenzelm@14697
   479
wenzelm@14697
   480
fun the_struct' structs s =
wenzelm@14697
   481
  [(case Lexicon.read_nat s of
wenzelm@18678
   482
    SOME i => Ast.Variable (the_struct structs i handle ERROR _ => raise Match)
skalberg@15531
   483
  | NONE => raise Match)] |> Ast.mk_appl (Ast.Constant "_free");
wenzelm@14697
   484
wenzelm@14697
   485
fun struct_ast_tr' structs (*"_struct"*) [Ast.Constant "_indexdefault"] =
wenzelm@14697
   486
      the_struct' structs "1"
wenzelm@14697
   487
  | struct_ast_tr' structs (*"_struct"*) [Ast.Appl [Ast.Constant "_indexnum", Ast.Constant s]] =
wenzelm@14697
   488
      the_struct' structs s
wenzelm@14697
   489
  | struct_ast_tr' _ _ = raise Match;
wenzelm@14697
   490
wenzelm@14697
   491
wenzelm@14697
   492
wenzelm@14697
   493
(** Pure translations **)
wenzelm@548
   494
wenzelm@548
   495
val pure_trfuns =
wenzelm@35145
   496
  ([("_constify", constify_ast_tr),
wenzelm@35145
   497
    ("_appl", appl_ast_tr),
wenzelm@35145
   498
    ("_applC", applC_ast_tr),
wenzelm@35145
   499
    ("_lambda", lambda_ast_tr),
wenzelm@35145
   500
    ("_idtyp", idtyp_ast_tr),
wenzelm@35145
   501
    ("_idtypdummy", idtypdummy_ast_tr),
wenzelm@35145
   502
    ("_bigimpl", bigimpl_ast_tr),
wenzelm@35145
   503
    ("_indexdefault", indexdefault_ast_tr),
wenzelm@35145
   504
    ("_indexnum", indexnum_ast_tr),
wenzelm@35145
   505
    ("_indexvar", indexvar_ast_tr),
wenzelm@35145
   506
    ("_struct", struct_ast_tr)],
wenzelm@35145
   507
   [("_abs", abs_tr),
wenzelm@35145
   508
    ("_aprop", aprop_tr),
wenzelm@35145
   509
    ("_ofclass", ofclass_tr),
wenzelm@35145
   510
    ("_sort_constraint", sort_constraint_tr),
wenzelm@35145
   511
    ("_TYPE", type_tr),
wenzelm@35145
   512
    ("_DDDOT", dddot_tr),
wenzelm@35145
   513
    ("_update_name", update_name_tr),
wenzelm@35145
   514
    ("_index", index_tr)],
wenzelm@35198
   515
   ([]: (string * (term list -> term)) list),
wenzelm@35145
   516
   [("_abs", abs_ast_tr'),
wenzelm@35145
   517
    ("_idts", idtyp_ast_tr' "_idts"),
wenzelm@35145
   518
    ("_pttrns", idtyp_ast_tr' "_pttrns"),
wenzelm@35255
   519
    ("\\<^const>==>", impl_ast_tr'),
wenzelm@35145
   520
    ("_index", index_ast_tr')]);
wenzelm@548
   521
wenzelm@2698
   522
val pure_trfunsT =
wenzelm@35255
   523
 [("_type_prop", type_prop_tr'),
wenzelm@35255
   524
  ("\\<^const>TYPE", type_tr'),
wenzelm@35255
   525
  ("_type_constraint_", type_constraint_tr')];
wenzelm@2698
   526
wenzelm@14697
   527
fun struct_trfuns structs =
wenzelm@14697
   528
  ([], [("_struct", struct_tr structs)], [], [("_struct", struct_ast_tr' structs)]);
wenzelm@14697
   529
wenzelm@548
   530
wenzelm@548
   531
wenzelm@14868
   532
(** pts_to_asts **)
wenzelm@548
   533
wenzelm@21773
   534
fun pts_to_asts ctxt trf pts =
wenzelm@548
   535
  let
wenzelm@548
   536
    fun trans a args =
wenzelm@548
   537
      (case trf a of
skalberg@15531
   538
        NONE => Ast.mk_appl (Ast.Constant a) args
wenzelm@23937
   539
      | SOME f => f ctxt args);
wenzelm@548
   540
clasohm@987
   541
    (*translate pt bottom-up*)
wenzelm@5690
   542
    fun ast_of (Parser.Node (a, pts)) = trans a (map ast_of pts)
wenzelm@5690
   543
      | ast_of (Parser.Tip tok) = Ast.Variable (Lexicon.str_of_token tok);
berghofe@14798
   544
wenzelm@23963
   545
    val exn_results = map (Exn.capture ast_of) pts;
wenzelm@23963
   546
    val exns = map_filter Exn.get_exn exn_results;
wenzelm@23963
   547
    val results = map_filter Exn.get_result exn_results
wenzelm@31542
   548
  in (case (results, exns) of ([], exn :: _) => reraise exn | _ => results) end;
wenzelm@548
   549
wenzelm@548
   550
wenzelm@548
   551
berghofe@14798
   552
(** asts_to_terms **)
wenzelm@548
   553
wenzelm@21773
   554
fun asts_to_terms ctxt trf asts =
wenzelm@548
   555
  let
wenzelm@548
   556
    fun trans a args =
wenzelm@548
   557
      (case trf a of
skalberg@15531
   558
        NONE => Term.list_comb (Lexicon.const a, args)
wenzelm@23937
   559
      | SOME f => f ctxt args);
wenzelm@548
   560
wenzelm@5690
   561
    fun term_of (Ast.Constant a) = trans a []
wenzelm@5690
   562
      | term_of (Ast.Variable x) = Lexicon.read_var x
wenzelm@5690
   563
      | term_of (Ast.Appl (Ast.Constant a :: (asts as _ :: _))) =
wenzelm@548
   564
          trans a (map term_of asts)
wenzelm@5690
   565
      | term_of (Ast.Appl (ast :: (asts as _ :: _))) =
wenzelm@5690
   566
          Term.list_comb (term_of ast, map term_of asts)
wenzelm@5690
   567
      | term_of (ast as Ast.Appl _) = raise Ast.AST ("ast_to_term: malformed ast", [ast]);
berghofe@14798
   568
wenzelm@19005
   569
    val free_fixed = Term.map_aterms
wenzelm@19005
   570
      (fn t as Const (c, T) =>
wenzelm@19005
   571
          (case try (unprefix Lexicon.fixedN) c of
wenzelm@19005
   572
            NONE => t
wenzelm@18342
   573
          | SOME x => Free (x, T))
wenzelm@19005
   574
        | t => t);
wenzelm@18342
   575
wenzelm@23963
   576
    val exn_results = map (Exn.capture (term_of #> free_fixed)) asts;
wenzelm@23963
   577
    val exns = map_filter Exn.get_exn exn_results;
wenzelm@23963
   578
    val results = map_filter Exn.get_result exn_results
wenzelm@31542
   579
  in (case (results, exns) of ([], exn :: _) => reraise exn | _ => results) end;
wenzelm@548
   580
wenzelm@548
   581
end;