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