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