src/HOL/Tools/hologic.ML
author haftmann
Tue May 19 16:54:55 2009 +0200 (2009-05-19)
changeset 31205 98370b26c2ce
parent 31183 13effe47174c
child 31456 55edadbd43d5
permissions -rw-r--r--
String.literal replaces message_string, code_numeral replaces (code_)index
clasohm@923
     1
(*  Title:      HOL/hologic.ML
clasohm@923
     2
    Author:     Lawrence C Paulson and Markus Wenzel
clasohm@923
     3
clasohm@923
     4
Abstract syntax operations for HOL.
clasohm@923
     5
*)
clasohm@923
     6
clasohm@923
     7
signature HOLOGIC =
clasohm@923
     8
sig
wenzelm@12338
     9
  val typeS: sort
wenzelm@12338
    10
  val typeT: typ
wenzelm@8275
    11
  val boolN: string
clasohm@923
    12
  val boolT: typ
haftmann@30450
    13
  val Trueprop: term
haftmann@30450
    14
  val mk_Trueprop: term -> term
haftmann@30450
    15
  val dest_Trueprop: term -> term
wenzelm@21829
    16
  val true_const: term
paulson@7073
    17
  val false_const: term
clasohm@923
    18
  val mk_setT: typ -> typ
clasohm@923
    19
  val dest_setT: typ -> typ
haftmann@30450
    20
  val Collect_const: typ -> term
haftmann@30450
    21
  val mk_Collect: string * typ * term -> term
haftmann@30450
    22
  val mk_mem: term * term -> term
haftmann@30450
    23
  val dest_mem: term -> term * term
haftmann@30450
    24
  val mk_set: typ -> term list -> term
haftmann@30450
    25
  val dest_set: term -> term list
haftmann@30450
    26
  val mk_UNIV: typ -> term
wenzelm@23555
    27
  val conj_intr: thm -> thm -> thm
wenzelm@23555
    28
  val conj_elim: thm -> thm * thm
wenzelm@23555
    29
  val conj_elims: thm -> thm list
clasohm@923
    30
  val conj: term
clasohm@923
    31
  val disj: term
clasohm@923
    32
  val imp: term
wenzelm@8429
    33
  val Not: term
wenzelm@7690
    34
  val mk_conj: term * term -> term
wenzelm@7690
    35
  val mk_disj: term * term -> term
wenzelm@7690
    36
  val mk_imp: term * term -> term
wenzelm@16835
    37
  val mk_not: term -> term
paulson@15151
    38
  val dest_conj: term -> term list
paulson@15945
    39
  val dest_disj: term -> term list
paulson@24958
    40
  val disjuncts: term -> term list
wenzelm@4571
    41
  val dest_imp: term -> term * term
paulson@15151
    42
  val dest_not: term -> term
clasohm@923
    43
  val eq_const: typ -> term
wenzelm@21829
    44
  val mk_eq: term * term -> term
wenzelm@21829
    45
  val dest_eq: term -> term * term
clasohm@923
    46
  val all_const: typ -> term
wenzelm@21829
    47
  val mk_all: string * typ * term -> term
wenzelm@21829
    48
  val list_all: (string * typ) list * term -> term
clasohm@923
    49
  val exists_const: typ -> term
wenzelm@21829
    50
  val mk_exists: string * typ * term -> term
paulson@15945
    51
  val choice_const: typ -> term
wenzelm@21829
    52
  val class_eq: string
wenzelm@2510
    53
  val mk_binop: string -> term * term -> term
wenzelm@2510
    54
  val mk_binrel: string -> term * term -> term
wenzelm@2510
    55
  val dest_bin: string -> typ -> term -> term * term
wenzelm@4571
    56
  val unitT: typ
wenzelm@9362
    57
  val is_unitT: typ -> bool
wenzelm@4571
    58
  val unit: term
wenzelm@4571
    59
  val is_unit: term -> bool
wenzelm@4571
    60
  val mk_prodT: typ * typ -> typ
wenzelm@4571
    61
  val dest_prodT: typ -> typ * typ
berghofe@14048
    62
  val pair_const: typ -> typ -> term
wenzelm@4571
    63
  val mk_prod: term * term -> term
wenzelm@4571
    64
  val dest_prod: term -> term * term
wenzelm@4571
    65
  val mk_fst: term -> term
wenzelm@4571
    66
  val mk_snd: term -> term
wenzelm@21829
    67
  val split_const: typ * typ * typ -> term
wenzelm@18285
    68
  val mk_split: term -> term
berghofe@5096
    69
  val prodT_factors: typ -> typ list
berghofe@5096
    70
  val mk_tuple: typ -> term list -> term
berghofe@23745
    71
  val dest_tuple: term -> term list
berghofe@23745
    72
  val ap_split: typ -> typ -> term -> term
berghofe@23745
    73
  val prod_factors: term -> int list list
berghofe@23745
    74
  val dest_tuple': int list list -> term -> term list
berghofe@23745
    75
  val prodT_factors': int list list -> typ -> typ list
berghofe@23745
    76
  val ap_split': int list list -> typ -> typ -> term -> term
berghofe@23745
    77
  val mk_tuple': int list list -> typ -> term list -> term
berghofe@23745
    78
  val mk_tupleT: int list list -> typ list -> typ
berghofe@23745
    79
  val strip_split: term -> term * typ list * int list list
wenzelm@5207
    80
  val natT: typ
wenzelm@5207
    81
  val zero: term
wenzelm@5207
    82
  val is_zero: term -> bool
wenzelm@5207
    83
  val mk_Suc: term -> term
wenzelm@5207
    84
  val dest_Suc: term -> term
haftmann@21621
    85
  val Suc_zero: term
wenzelm@24630
    86
  val mk_nat: int -> term
wenzelm@24630
    87
  val dest_nat: term -> int
haftmann@22994
    88
  val class_size: string
haftmann@22994
    89
  val size_const: typ -> term
haftmann@31205
    90
  val code_numeralT: typ
wenzelm@21829
    91
  val intT: typ
paulson@7073
    92
  val pls_const: term
paulson@7073
    93
  val min_const: term
huffman@26086
    94
  val bit0_const: term
huffman@26086
    95
  val bit1_const: term
huffman@26086
    96
  val mk_bit: int -> term
huffman@26086
    97
  val dest_bit: term -> int
wenzelm@24630
    98
  val mk_numeral: int -> term
wenzelm@24630
    99
  val dest_numeral: term -> int
wenzelm@21829
   100
  val number_of_const: typ -> term
wenzelm@23269
   101
  val add_numerals: term -> (term * typ) list -> (term * typ) list
wenzelm@24630
   102
  val mk_number: typ -> int -> term
wenzelm@24630
   103
  val dest_number: term -> typ * int
wenzelm@21778
   104
  val realT: typ
wenzelm@21755
   105
  val nibbleT: typ
wenzelm@21755
   106
  val mk_nibble: int -> term
wenzelm@21755
   107
  val dest_nibble: term -> int
wenzelm@21755
   108
  val charT: typ
wenzelm@21755
   109
  val mk_char: int -> term
wenzelm@21755
   110
  val dest_char: term -> int
wenzelm@21829
   111
  val listT: typ -> typ
berghofe@25887
   112
  val nil_const: typ -> term
berghofe@25887
   113
  val cons_const: typ -> term
wenzelm@21829
   114
  val mk_list: typ -> term list -> term
wenzelm@21829
   115
  val dest_list: term -> term list
wenzelm@21778
   116
  val stringT: typ
haftmann@21820
   117
  val mk_string: string -> term
haftmann@21820
   118
  val dest_string: term -> string
haftmann@31205
   119
  val literalT: typ
haftmann@31205
   120
  val mk_literal: string -> term
haftmann@31205
   121
  val dest_literal: term -> string
haftmann@31135
   122
  val mk_typerep: typ -> term
haftmann@31135
   123
  val mk_term_of: typ -> term -> term
haftmann@31135
   124
  val reflect_term: term -> term
haftmann@31183
   125
  val mk_return: typ -> typ -> term -> term
haftmann@31183
   126
  val mk_ST: ((term * typ) * (string * typ) option)  list -> term -> typ -> typ option * typ -> term
clasohm@923
   127
end;
clasohm@923
   128
clasohm@923
   129
structure HOLogic: HOLOGIC =
clasohm@923
   130
struct
clasohm@923
   131
wenzelm@12338
   132
(* HOL syntax *)
clasohm@923
   133
wenzelm@12338
   134
val typeS: sort = ["HOL.type"];
wenzelm@12338
   135
val typeT = TypeInfer.anyT typeS;
wenzelm@12338
   136
clasohm@923
   137
wenzelm@2510
   138
(* bool and set *)
clasohm@923
   139
wenzelm@8275
   140
val boolN = "bool";
wenzelm@8275
   141
val boolT = Type (boolN, []);
clasohm@923
   142
wenzelm@9856
   143
val true_const =  Const ("True", boolT);
wenzelm@9856
   144
val false_const = Const ("False", boolT);
paulson@7073
   145
berghofe@26804
   146
fun mk_setT T = T --> boolT;
clasohm@923
   147
berghofe@26804
   148
fun dest_setT (Type ("fun", [T, Type ("bool", [])])) = T
wenzelm@3794
   149
  | dest_setT T = raise TYPE ("dest_setT: set type expected", [T], []);
clasohm@923
   150
haftmann@30450
   151
fun mk_set T ts =
haftmann@30450
   152
  let
haftmann@30450
   153
    val sT = mk_setT T;
haftmann@30453
   154
    val empty = Const ("Set.empty", sT);
haftmann@30450
   155
    fun insert t u = Const ("insert", T --> sT --> sT) $ t $ u;
haftmann@30450
   156
  in fold_rev insert ts empty end;
haftmann@30450
   157
haftmann@30450
   158
fun mk_UNIV T = Const ("Set.UNIV", mk_setT T);
haftmann@30450
   159
haftmann@30450
   160
fun dest_set (Const ("Orderings.bot", _)) = []
haftmann@30450
   161
  | dest_set (Const ("insert", _) $ t $ u) = t :: dest_set u
haftmann@30450
   162
  | dest_set t = raise TERM ("dest_set", [t]);
haftmann@30450
   163
haftmann@30450
   164
fun Collect_const T = Const ("Collect", (T --> boolT) --> mk_setT T);
haftmann@30450
   165
fun mk_Collect (a, T, t) = Collect_const T $ absfree (a, T, t);
haftmann@30450
   166
haftmann@30450
   167
fun mk_mem (x, A) =
haftmann@30450
   168
  let val setT = fastype_of A in
haftmann@30450
   169
    Const ("op :", dest_setT setT --> setT --> boolT) $ x $ A
haftmann@30450
   170
  end;
haftmann@30450
   171
haftmann@30450
   172
fun dest_mem (Const ("op :", _) $ x $ A) = (x, A)
haftmann@30450
   173
  | dest_mem t = raise TERM ("dest_mem", [t]);
haftmann@30450
   174
wenzelm@8275
   175
paulson@7073
   176
(* logic *)
clasohm@923
   177
clasohm@923
   178
val Trueprop = Const ("Trueprop", boolT --> propT);
clasohm@923
   179
clasohm@923
   180
fun mk_Trueprop P = Trueprop $ P;
clasohm@923
   181
clasohm@923
   182
fun dest_Trueprop (Const ("Trueprop", _) $ P) = P
wenzelm@3794
   183
  | dest_Trueprop t = raise TERM ("dest_Trueprop", [t]);
clasohm@923
   184
wenzelm@23555
   185
fun conj_intr thP thQ =
wenzelm@23555
   186
  let
wenzelm@23576
   187
    val (P, Q) = pairself (ObjectLogic.dest_judgment o Thm.cprop_of) (thP, thQ)
wenzelm@23555
   188
      handle CTERM (msg, _) => raise THM (msg, 0, [thP, thQ]);
wenzelm@23555
   189
    val inst = Thm.instantiate ([], [(@{cpat "?P::bool"}, P), (@{cpat "?Q::bool"}, Q)]);
wenzelm@23555
   190
  in Drule.implies_elim_list (inst @{thm conjI}) [thP, thQ] end;
clasohm@923
   191
wenzelm@23555
   192
fun conj_elim thPQ =
wenzelm@23555
   193
  let
wenzelm@23576
   194
    val (P, Q) = Thm.dest_binop (ObjectLogic.dest_judgment (Thm.cprop_of thPQ))
wenzelm@23555
   195
      handle CTERM (msg, _) => raise THM (msg, 0, [thPQ]);
wenzelm@23555
   196
    val inst = Thm.instantiate ([], [(@{cpat "?P::bool"}, P), (@{cpat "?Q::bool"}, Q)]);
wenzelm@23555
   197
    val thP = Thm.implies_elim (inst @{thm conjunct1}) thPQ;
wenzelm@23555
   198
    val thQ = Thm.implies_elim (inst @{thm conjunct2}) thPQ;
wenzelm@23555
   199
  in (thP, thQ) end;
wenzelm@23555
   200
wenzelm@23555
   201
fun conj_elims th =
wenzelm@23555
   202
  let val (th1, th2) = conj_elim th
wenzelm@23555
   203
  in conj_elims th1 @ conj_elims th2 end handle THM _ => [th];
wenzelm@23555
   204
wenzelm@23555
   205
val conj = @{term "op &"}
wenzelm@23555
   206
and disj = @{term "op |"}
wenzelm@23555
   207
and imp = @{term "op -->"}
wenzelm@23555
   208
and Not = @{term "Not"};
clasohm@923
   209
wenzelm@7690
   210
fun mk_conj (t1, t2) = conj $ t1 $ t2
wenzelm@7690
   211
and mk_disj (t1, t2) = disj $ t1 $ t2
wenzelm@16835
   212
and mk_imp (t1, t2) = imp $ t1 $ t2
wenzelm@16835
   213
and mk_not t = Not $ t;
wenzelm@7690
   214
paulson@15151
   215
fun dest_conj (Const ("op &", _) $ t $ t') = t :: dest_conj t'
paulson@15151
   216
  | dest_conj t = [t];
paulson@15151
   217
paulson@15945
   218
fun dest_disj (Const ("op |", _) $ t $ t') = t :: dest_disj t'
paulson@15945
   219
  | dest_disj t = [t];
paulson@15945
   220
paulson@24958
   221
(*Like dest_disj, but flattens disjunctions however nested*)
paulson@24958
   222
fun disjuncts_aux (Const ("op |", _) $ t $ t') disjs = disjuncts_aux t (disjuncts_aux t' disjs)
paulson@24958
   223
  | disjuncts_aux t disjs = t::disjs;
paulson@24958
   224
paulson@24958
   225
fun disjuncts t = disjuncts_aux t [];
paulson@24958
   226
paulson@4466
   227
fun dest_imp (Const("op -->",_) $ A $ B) = (A, B)
paulson@4466
   228
  | dest_imp  t = raise TERM ("dest_imp", [t]);
paulson@4466
   229
paulson@15151
   230
fun dest_not (Const ("Not", _) $ t) = t
paulson@15151
   231
  | dest_not t = raise TERM ("dest_not", [t]);
wenzelm@8302
   232
clasohm@923
   233
fun eq_const T = Const ("op =", [T, T] ---> boolT);
clasohm@923
   234
fun mk_eq (t, u) = eq_const (fastype_of t) $ t $ u;
clasohm@923
   235
paulson@6031
   236
fun dest_eq (Const ("op =", _) $ lhs $ rhs) = (lhs, rhs)
paulson@6031
   237
  | dest_eq t = raise TERM ("dest_eq", [t])
paulson@6031
   238
clasohm@923
   239
fun all_const T = Const ("All", [T --> boolT] ---> boolT);
clasohm@923
   240
fun mk_all (x, T, P) = all_const T $ absfree (x, T, P);
wenzelm@21173
   241
fun list_all (xs, t) = fold_rev (fn (x, T) => fn P => all_const T $ Abs (x, T, P)) xs t;
clasohm@923
   242
clasohm@923
   243
fun exists_const T = Const ("Ex", [T --> boolT] ---> boolT);
clasohm@923
   244
fun mk_exists (x, T, P) = exists_const T $ absfree (x, T, P);
clasohm@923
   245
wenzelm@21755
   246
fun choice_const T = Const("Hilbert_Choice.Eps", (T --> boolT) --> T);
paulson@15945
   247
haftmann@23247
   248
val class_eq = "HOL.eq";
haftmann@21045
   249
clasohm@923
   250
ballarin@13743
   251
(* binary operations and relations *)
wenzelm@2510
   252
wenzelm@2510
   253
fun mk_binop c (t, u) =
wenzelm@2510
   254
  let val T = fastype_of t in
wenzelm@2510
   255
    Const (c, [T, T] ---> T) $ t $ u
wenzelm@2510
   256
  end;
wenzelm@2510
   257
wenzelm@2510
   258
fun mk_binrel c (t, u) =
wenzelm@2510
   259
  let val T = fastype_of t in
wenzelm@2510
   260
    Const (c, [T, T] ---> boolT) $ t $ u
wenzelm@2510
   261
  end;
wenzelm@2510
   262
paulson@14387
   263
(*destruct the application of a binary operator. The dummyT case is a crude
paulson@14387
   264
  way of handling polymorphic operators.*)
wenzelm@2510
   265
fun dest_bin c T (tm as Const (c', Type ("fun", [T', _])) $ t $ u) =
paulson@14387
   266
      if c = c' andalso (T=T' orelse T=dummyT) then (t, u)
wenzelm@3794
   267
      else raise TERM ("dest_bin " ^ c, [tm])
wenzelm@3794
   268
  | dest_bin c _ tm = raise TERM ("dest_bin " ^ c, [tm]);
wenzelm@2510
   269
wenzelm@2510
   270
wenzelm@4571
   271
(* unit *)
wenzelm@4571
   272
wenzelm@11604
   273
val unitT = Type ("Product_Type.unit", []);
wenzelm@4571
   274
wenzelm@11604
   275
fun is_unitT (Type ("Product_Type.unit", [])) = true
wenzelm@9362
   276
  | is_unitT _ = false;
wenzelm@9362
   277
wenzelm@11604
   278
val unit = Const ("Product_Type.Unity", unitT);
wenzelm@4571
   279
wenzelm@11604
   280
fun is_unit (Const ("Product_Type.Unity", _)) = true
wenzelm@4571
   281
  | is_unit _ = false;
wenzelm@4571
   282
wenzelm@4571
   283
wenzelm@4571
   284
(* prod *)
wenzelm@4571
   285
wenzelm@4571
   286
fun mk_prodT (T1, T2) = Type ("*", [T1, T2]);
wenzelm@4571
   287
wenzelm@4571
   288
fun dest_prodT (Type ("*", [T1, T2])) = (T1, T2)
wenzelm@4571
   289
  | dest_prodT T = raise TYPE ("dest_prodT", [T], []);
wenzelm@4571
   290
berghofe@14048
   291
fun pair_const T1 T2 = Const ("Pair", [T1, T2] ---> mk_prodT (T1, T2));
berghofe@14048
   292
wenzelm@4571
   293
fun mk_prod (t1, t2) =
wenzelm@4571
   294
  let val T1 = fastype_of t1 and T2 = fastype_of t2 in
berghofe@14048
   295
    pair_const T1 T2 $ t1 $ t2
wenzelm@4571
   296
  end;
wenzelm@4571
   297
wenzelm@4571
   298
fun dest_prod (Const ("Pair", _) $ t1 $ t2) = (t1, t2)
wenzelm@4571
   299
  | dest_prod t = raise TERM ("dest_prod", [t]);
wenzelm@4571
   300
wenzelm@4571
   301
fun mk_fst p =
wenzelm@4571
   302
  let val pT = fastype_of p in
wenzelm@4571
   303
    Const ("fst", pT --> fst (dest_prodT pT)) $ p
wenzelm@4571
   304
  end;
wenzelm@4571
   305
wenzelm@4571
   306
fun mk_snd p =
wenzelm@4571
   307
  let val pT = fastype_of p in
wenzelm@4571
   308
    Const ("snd", pT --> snd (dest_prodT pT)) $ p
wenzelm@4571
   309
  end;
wenzelm@4571
   310
wenzelm@18285
   311
fun split_const (A, B, C) =
wenzelm@18285
   312
  Const ("split", (A --> B --> C) --> mk_prodT (A, B) --> C);
wenzelm@18285
   313
wenzelm@18285
   314
fun mk_split t =
wenzelm@18285
   315
  (case Term.fastype_of t of
wenzelm@18285
   316
    T as (Type ("fun", [A, Type ("fun", [B, C])])) =>
wenzelm@18285
   317
      Const ("split", T --> mk_prodT (A, B) --> C) $ t
wenzelm@18285
   318
  | _ => raise TERM ("mk_split: bad body type", [t]));
wenzelm@18285
   319
berghofe@5096
   320
(*Maps the type T1 * ... * Tn to [T1, ..., Tn], however nested*)
berghofe@5096
   321
fun prodT_factors (Type ("*", [T1, T2])) = prodT_factors T1 @ prodT_factors T2
berghofe@5096
   322
  | prodT_factors T = [T];
berghofe@5096
   323
berghofe@5096
   324
(*Makes a nested tuple from a list, following the product type structure*)
wenzelm@16971
   325
fun mk_tuple (Type ("*", [T1, T2])) tms =
wenzelm@16971
   326
        mk_prod (mk_tuple T1 tms,
skalberg@15570
   327
                 mk_tuple T2 (Library.drop (length (prodT_factors T1), tms)))
berghofe@5096
   328
  | mk_tuple T (t::_) = t;
wenzelm@4571
   329
berghofe@23745
   330
fun dest_tuple (Const ("Pair", _) $ t $ u) = dest_tuple t @ dest_tuple u
berghofe@23745
   331
  | dest_tuple t = [t];
berghofe@23745
   332
berghofe@23745
   333
(*In ap_split S T u, term u expects separate arguments for the factors of S,
berghofe@23745
   334
  with result type T.  The call creates a new term expecting one argument
berghofe@23745
   335
  of type S.*)
berghofe@23745
   336
fun ap_split T T3 u =
berghofe@23745
   337
  let
berghofe@23745
   338
    fun ap (T :: Ts) =
berghofe@23745
   339
          (case T of
berghofe@23745
   340
             Type ("*", [T1, T2]) =>
berghofe@23745
   341
               split_const (T1, T2, Ts ---> T3) $ ap (T1 :: T2 :: Ts)
berghofe@23745
   342
           | _ => Abs ("x", T, ap Ts))
berghofe@23745
   343
      | ap [] =
berghofe@23745
   344
          let val k = length (prodT_factors T)
berghofe@23745
   345
          in list_comb (incr_boundvars k u, map Bound (k - 1 downto 0)) end
berghofe@23745
   346
  in ap [T] end;
berghofe@23745
   347
berghofe@23745
   348
wenzelm@25172
   349
(* operations on tuples with specific arities *)
wenzelm@25172
   350
(*
wenzelm@25172
   351
  an "arity" of a tuple is a list of lists of integers
wenzelm@25172
   352
  ("factors"), denoting paths to subterms that are pairs
wenzelm@25172
   353
*)
berghofe@23745
   354
berghofe@23745
   355
fun prod_err s = raise TERM (s ^ ": inconsistent use of products", []);
berghofe@23745
   356
berghofe@23745
   357
fun prod_factors t =
berghofe@23745
   358
  let
berghofe@23745
   359
    fun factors p (Const ("Pair", _) $ t $ u) =
berghofe@23745
   360
          p :: factors (1::p) t @ factors (2::p) u
berghofe@23745
   361
      | factors p _ = []
berghofe@23745
   362
  in factors [] t end;
berghofe@23745
   363
berghofe@23745
   364
fun dest_tuple' ps =
berghofe@23745
   365
  let
berghofe@23745
   366
    fun dest p t = if p mem ps then (case t of
berghofe@23745
   367
        Const ("Pair", _) $ t $ u =>
berghofe@23745
   368
          dest (1::p) t @ dest (2::p) u
berghofe@23745
   369
      | _ => prod_err "dest_tuple'") else [t]
berghofe@23745
   370
  in dest [] end;
berghofe@23745
   371
berghofe@23745
   372
fun prodT_factors' ps =
berghofe@23745
   373
  let
berghofe@23745
   374
    fun factors p T = if p mem ps then (case T of
berghofe@23745
   375
        Type ("*", [T1, T2]) =>
berghofe@23745
   376
          factors (1::p) T1 @ factors (2::p) T2
berghofe@23745
   377
      | _ => prod_err "prodT_factors'") else [T]
berghofe@23745
   378
  in factors [] end;
berghofe@23745
   379
berghofe@23745
   380
(*In ap_split' ps S T u, term u expects separate arguments for the factors of S,
berghofe@23745
   381
  with result type T.  The call creates a new term expecting one argument
berghofe@23745
   382
  of type S.*)
berghofe@23745
   383
fun ap_split' ps T T3 u =
berghofe@23745
   384
  let
berghofe@23745
   385
    fun ap ((p, T) :: pTs) =
berghofe@23745
   386
          if p mem ps then (case T of
berghofe@23745
   387
              Type ("*", [T1, T2]) =>
berghofe@23745
   388
                split_const (T1, T2, map snd pTs ---> T3) $
berghofe@23745
   389
                  ap ((1::p, T1) :: (2::p, T2) :: pTs)
berghofe@23745
   390
            | _ => prod_err "ap_split'")
berghofe@23745
   391
          else Abs ("x", T, ap pTs)
berghofe@23745
   392
      | ap [] =
berghofe@23745
   393
          let val k = length ps
berghofe@23745
   394
          in list_comb (incr_boundvars (k + 1) u, map Bound (k downto 0)) end
berghofe@23745
   395
  in ap [([], T)] end;
berghofe@23745
   396
berghofe@23745
   397
fun mk_tuple' ps =
berghofe@23745
   398
  let
berghofe@23745
   399
    fun mk p T ts =
berghofe@23745
   400
      if p mem ps then (case T of
berghofe@23745
   401
          Type ("*", [T1, T2]) =>
berghofe@23745
   402
            let
berghofe@23745
   403
              val (t, ts') = mk (1::p) T1 ts;
berghofe@23745
   404
              val (u, ts'') = mk (2::p) T2 ts'
berghofe@23745
   405
            in (pair_const T1 T2 $ t $ u, ts'') end
berghofe@23745
   406
        | _ => prod_err "mk_tuple'")
berghofe@23745
   407
      else (hd ts, tl ts)
berghofe@23745
   408
  in fst oo mk [] end;
berghofe@23745
   409
berghofe@23745
   410
fun mk_tupleT ps =
berghofe@23745
   411
  let
berghofe@23745
   412
    fun mk p Ts =
berghofe@23745
   413
      if p mem ps then
berghofe@23745
   414
        let
berghofe@23745
   415
          val (T, Ts') = mk (1::p) Ts;
berghofe@23745
   416
          val (U, Ts'') = mk (2::p) Ts'
berghofe@23745
   417
        in (mk_prodT (T, U), Ts'') end
berghofe@23745
   418
      else (hd Ts, tl Ts)
berghofe@23745
   419
  in fst o mk [] end;
berghofe@23745
   420
berghofe@23745
   421
fun strip_split t =
berghofe@23745
   422
  let
berghofe@23745
   423
    fun strip [] qs Ts t = (t, Ts, qs)
berghofe@23745
   424
      | strip (p :: ps) qs Ts (Const ("split", _) $ t) =
berghofe@23745
   425
          strip ((1 :: p) :: (2 :: p) :: ps) (p :: qs) Ts t
berghofe@23745
   426
      | strip (p :: ps) qs Ts (Abs (s, T, t)) = strip ps qs (T :: Ts) t
berghofe@23745
   427
      | strip (p :: ps) qs Ts t = strip ps qs
berghofe@23745
   428
          (hd (binder_types (fastype_of1 (Ts, t))) :: Ts)
berghofe@23745
   429
          (incr_boundvars 1 t $ Bound 0)
berghofe@23745
   430
  in strip [[]] [] [] t end;
berghofe@23745
   431
wenzelm@5207
   432
wenzelm@5207
   433
(* nat *)
wenzelm@5207
   434
wenzelm@5207
   435
val natT = Type ("nat", []);
wenzelm@5207
   436
haftmann@22994
   437
val zero = Const ("HOL.zero_class.zero", natT);
wenzelm@5207
   438
haftmann@22994
   439
fun is_zero (Const ("HOL.zero_class.zero", _)) = true
wenzelm@5207
   440
  | is_zero _ = false;
wenzelm@5207
   441
wenzelm@5207
   442
fun mk_Suc t = Const ("Suc", natT --> natT) $ t;
wenzelm@5207
   443
wenzelm@5207
   444
fun dest_Suc (Const ("Suc", _) $ t) = t
wenzelm@5207
   445
  | dest_Suc t = raise TERM ("dest_Suc", [t]);
wenzelm@5207
   446
haftmann@21621
   447
val Suc_zero = mk_Suc zero;
haftmann@21621
   448
wenzelm@24630
   449
fun mk_nat n =
haftmann@22994
   450
  let
haftmann@22994
   451
    fun mk 0 = zero
wenzelm@23297
   452
      | mk n = mk_Suc (mk (n - 1));
wenzelm@23576
   453
  in if n < 0 then raise TERM ("mk_nat: negative number", []) else mk n end;
wenzelm@5207
   454
wenzelm@24630
   455
fun dest_nat (Const ("HOL.zero_class.zero", _)) = 0
wenzelm@23297
   456
  | dest_nat (Const ("Suc", _) $ t) = dest_nat t + 1
wenzelm@5207
   457
  | dest_nat t = raise TERM ("dest_nat", [t]);
wenzelm@5207
   458
haftmann@22994
   459
val class_size = "Nat.size";
haftmann@22994
   460
haftmann@22994
   461
fun size_const T = Const ("Nat.size_class.size", T --> natT);
haftmann@22994
   462
wenzelm@5207
   463
haftmann@31205
   464
(* code numeral *)
haftmann@26036
   465
haftmann@31205
   466
val code_numeralT = Type ("Code_Numeral.code_numeral", []);
haftmann@26036
   467
haftmann@26036
   468
wenzelm@21778
   469
(* binary numerals and int -- non-unique representation due to leading zeros/ones! *)
wenzelm@21778
   470
haftmann@25919
   471
val intT = Type ("Int.int", []);
wenzelm@21778
   472
haftmann@25919
   473
val pls_const = Const ("Int.Pls", intT)
haftmann@25919
   474
and min_const = Const ("Int.Min", intT)
huffman@26086
   475
and bit0_const = Const ("Int.Bit0", intT --> intT)
huffman@26086
   476
and bit1_const = Const ("Int.Bit1", intT --> intT);
huffman@26086
   477
huffman@26086
   478
fun mk_bit 0 = bit0_const
huffman@26086
   479
  | mk_bit 1 = bit1_const
huffman@26086
   480
  | mk_bit _ = raise TERM ("mk_bit", []);
huffman@26086
   481
huffman@26086
   482
fun dest_bit (Const ("Int.Bit0", _)) = 0
huffman@26086
   483
  | dest_bit (Const ("Int.Bit1", _)) = 1
huffman@26086
   484
  | dest_bit t = raise TERM ("dest_bit", [t]);
paulson@8768
   485
wenzelm@21829
   486
fun mk_numeral 0 = pls_const
wenzelm@21829
   487
  | mk_numeral ~1 = min_const
wenzelm@21829
   488
  | mk_numeral i =
wenzelm@24630
   489
      let val (q, r) = Integer.div_mod i 2;
huffman@26086
   490
      in mk_bit r $ mk_numeral q end;
berghofe@13755
   491
haftmann@25919
   492
fun dest_numeral (Const ("Int.Pls", _)) = 0
haftmann@25919
   493
  | dest_numeral (Const ("Int.Min", _)) = ~1
huffman@26086
   494
  | dest_numeral (Const ("Int.Bit0", _) $ bs) = 2 * dest_numeral bs
huffman@26086
   495
  | dest_numeral (Const ("Int.Bit1", _) $ bs) = 2 * dest_numeral bs + 1
wenzelm@21829
   496
  | dest_numeral t = raise TERM ("dest_numeral", [t]);
berghofe@13755
   497
haftmann@25919
   498
fun number_of_const T = Const ("Int.number_class.number_of", intT --> T);
haftmann@21820
   499
haftmann@25919
   500
fun add_numerals (Const ("Int.number_class.number_of", Type (_, [_, T])) $ t) = cons (t, T)
wenzelm@23269
   501
  | add_numerals (t $ u) = add_numerals t #> add_numerals u
wenzelm@23269
   502
  | add_numerals (Abs (_, _, t)) = add_numerals t
wenzelm@23269
   503
  | add_numerals _ = I;
haftmann@22391
   504
haftmann@22994
   505
fun mk_number T 0 = Const ("HOL.zero_class.zero", T)
haftmann@22994
   506
  | mk_number T 1 = Const ("HOL.one_class.one", T)
haftmann@21820
   507
  | mk_number T i = number_of_const T $ mk_numeral i;
haftmann@21820
   508
haftmann@22994
   509
fun dest_number (Const ("HOL.zero_class.zero", T)) = (T, 0)
haftmann@22994
   510
  | dest_number (Const ("HOL.one_class.one", T)) = (T, 1)
haftmann@25919
   511
  | dest_number (Const ("Int.number_class.number_of", Type ("fun", [_, T])) $ t) =
haftmann@22994
   512
      (T, dest_numeral t)
haftmann@21820
   513
  | dest_number t = raise TERM ("dest_number", [t]);
berghofe@13755
   514
wenzelm@21829
   515
berghofe@13755
   516
(* real *)
berghofe@13755
   517
wenzelm@16971
   518
val realT = Type ("RealDef.real", []);
berghofe@13755
   519
berghofe@13755
   520
wenzelm@21755
   521
(* list *)
haftmann@21455
   522
wenzelm@21755
   523
fun listT T = Type ("List.list", [T]);
haftmann@21455
   524
berghofe@25887
   525
fun nil_const T = Const ("List.list.Nil", listT T);
berghofe@25887
   526
berghofe@25887
   527
fun cons_const T =
berghofe@25887
   528
  let val lT = listT T
berghofe@25887
   529
  in Const ("List.list.Cons", T --> lT --> lT) end;
berghofe@25887
   530
wenzelm@21755
   531
fun mk_list T ts =
haftmann@21455
   532
  let
wenzelm@21755
   533
    val lT = listT T;
wenzelm@21755
   534
    val Nil = Const ("List.list.Nil", lT);
wenzelm@21755
   535
    fun Cons t u = Const ("List.list.Cons", T --> lT --> lT) $ t $ u;
wenzelm@21755
   536
  in fold_rev Cons ts Nil end;
wenzelm@21755
   537
wenzelm@21755
   538
fun dest_list (Const ("List.list.Nil", _)) = []
wenzelm@21755
   539
  | dest_list (Const ("List.list.Cons", _) $ t $ u) = t :: dest_list u
wenzelm@21755
   540
  | dest_list t = raise TERM ("dest_list", [t]);
haftmann@21455
   541
haftmann@21455
   542
haftmann@31048
   543
(* nibble *)
haftmann@31048
   544
haftmann@31048
   545
val nibbleT = Type ("String.nibble", []);
haftmann@31048
   546
haftmann@31048
   547
fun mk_nibble n =
haftmann@31048
   548
  let val s =
haftmann@31048
   549
    if 0 <= n andalso n <= 9 then chr (n + ord "0")
haftmann@31048
   550
    else if 10 <= n andalso n <= 15 then chr (n + ord "A" - 10)
haftmann@31048
   551
    else raise TERM ("mk_nibble", [])
haftmann@31048
   552
  in Const ("String.nibble.Nibble" ^ s, nibbleT) end;
haftmann@31048
   553
haftmann@31048
   554
fun dest_nibble t =
haftmann@31048
   555
  let fun err () = raise TERM ("dest_nibble", [t]) in
haftmann@31048
   556
    (case try (unprefix "String.nibble.Nibble" o fst o Term.dest_Const) t of
haftmann@31048
   557
      NONE => err ()
haftmann@31048
   558
    | SOME c =>
haftmann@31048
   559
        if size c <> 1 then err ()
haftmann@31048
   560
        else if "0" <= c andalso c <= "9" then ord c - ord "0"
haftmann@31048
   561
        else if "A" <= c andalso c <= "F" then ord c - ord "A" + 10
haftmann@31048
   562
        else err ())
haftmann@31048
   563
  end;
haftmann@31048
   564
haftmann@31048
   565
haftmann@31048
   566
(* char *)
haftmann@31048
   567
haftmann@31048
   568
val charT = Type ("String.char", []);
haftmann@31048
   569
haftmann@31048
   570
fun mk_char n =
haftmann@31048
   571
  if 0 <= n andalso n <= 255 then
haftmann@31048
   572
    Const ("String.char.Char", nibbleT --> nibbleT --> charT) $
haftmann@31048
   573
      mk_nibble (n div 16) $ mk_nibble (n mod 16)
haftmann@31048
   574
  else raise TERM ("mk_char", []);
haftmann@31048
   575
haftmann@31048
   576
fun dest_char (Const ("String.char.Char", _) $ t $ u) =
haftmann@31048
   577
      dest_nibble t * 16 + dest_nibble u
haftmann@31048
   578
  | dest_char t = raise TERM ("dest_char", [t]);
haftmann@31048
   579
haftmann@31048
   580
haftmann@21455
   581
(* string *)
haftmann@21455
   582
haftmann@31048
   583
val stringT = Type ("String.string", []);
haftmann@21455
   584
wenzelm@21755
   585
val mk_string = mk_list charT o map (mk_char o ord) o explode;
wenzelm@21755
   586
val dest_string = implode o map (chr o dest_char) o dest_list;
haftmann@21455
   587
haftmann@31048
   588
haftmann@31205
   589
(* literal *)
haftmann@31048
   590
haftmann@31205
   591
val literalT = Type ("String.literal", []);
haftmann@31048
   592
haftmann@31205
   593
fun mk_literal s = Const ("String.literal.STR", stringT --> literalT)
haftmann@31048
   594
      $ mk_string s;
haftmann@31205
   595
fun dest_literal (Const ("String.literal.STR", _) $ t) =
haftmann@31048
   596
      dest_string t
haftmann@31205
   597
  | dest_literal t = raise TERM ("dest_literal", [t]);
haftmann@31048
   598
haftmann@31135
   599
haftmann@31135
   600
(* typerep and term *)
haftmann@31135
   601
haftmann@31135
   602
val typerepT = Type ("Typerep.typerep", []);
haftmann@31135
   603
haftmann@31135
   604
fun mk_typerep T = Const ("Typerep.typerep_class.typerep",
haftmann@31135
   605
  Term.itselfT T --> typerepT) $ Logic.mk_type T;
haftmann@31135
   606
haftmann@31135
   607
val termT = Type ("Code_Eval.term", []);
haftmann@31135
   608
haftmann@31135
   609
fun mk_term_of T t = Const ("Code_Eval.term_of_class.term_of", T --> termT) $ t;
haftmann@31135
   610
haftmann@31135
   611
fun reflect_term (Const (c, T)) =
haftmann@31205
   612
      Const ("Code_Eval.Const", literalT --> typerepT --> termT)
haftmann@31205
   613
        $ mk_literal c $ mk_typerep T
haftmann@31135
   614
  | reflect_term (t1 $ t2) =
haftmann@31135
   615
      Const ("Code_Eval.App", termT --> termT --> termT)
haftmann@31135
   616
        $ reflect_term t1 $ reflect_term t2
haftmann@31183
   617
  | reflect_term (Abs (v, _, t)) = Abs (v, termT, reflect_term t)
haftmann@31183
   618
  | reflect_term t = t;
haftmann@31183
   619
haftmann@31183
   620
haftmann@31183
   621
(* open state monads *)
haftmann@31183
   622
haftmann@31183
   623
fun mk_return T U x = pair_const T U $ x;
haftmann@31183
   624
haftmann@31183
   625
fun mk_ST clauses t U (someT, V) =
haftmann@31183
   626
  let
haftmann@31183
   627
    val R = case someT of SOME T => mk_prodT (T, V) | NONE => V
haftmann@31183
   628
    fun mk_clause ((t, U), SOME (v, T)) (t', U') =
haftmann@31183
   629
          (Const ("Product_Type.scomp", (U --> mk_prodT (T, U')) --> (T --> U' --> R) --> U --> R)
haftmann@31183
   630
            $ t $ lambda (Free (v, T)) t', U)
haftmann@31183
   631
      | mk_clause ((t, U), NONE) (t', U') =
haftmann@31183
   632
          (Const ("Product_Type.fcomp", (U --> U') --> (U' --> R) --> U --> R)
haftmann@31183
   633
            $ t $ t', U)
haftmann@31183
   634
  in fold_rev mk_clause clauses (t, U) |> fst end;
haftmann@31135
   635
clasohm@923
   636
end;