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