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