src/HOL/hologic.ML
author wenzelm
Tue Jul 03 22:27:11 2007 +0200 (2007-07-03)
changeset 23555 16e5fd18905c
parent 23297 06f108974fa1
child 23566 b65692d4adcd
permissions -rw-r--r--
assume basic HOL context for compilation (antiquotations);
added dest_cTrueprop;
tuned Trueprop_conv;
added low-level conj_intr/elim/elis (dire need for @{rule} antiquotation!);
clasohm@923
     1
(*  Title:      HOL/hologic.ML
clasohm@923
     2
    ID:         $Id$
clasohm@923
     3
    Author:     Lawrence C Paulson and Markus Wenzel
clasohm@923
     4
clasohm@923
     5
Abstract syntax operations for HOL.
clasohm@923
     6
*)
clasohm@923
     7
clasohm@923
     8
signature HOLOGIC =
clasohm@923
     9
sig
wenzelm@12338
    10
  val typeS: sort
wenzelm@12338
    11
  val typeT: typ
wenzelm@8275
    12
  val boolN: string
clasohm@923
    13
  val boolT: typ
wenzelm@21829
    14
  val true_const: term
paulson@7073
    15
  val false_const: term
clasohm@923
    16
  val mk_setT: typ -> typ
clasohm@923
    17
  val dest_setT: typ -> typ
paulson@15965
    18
  val Trueprop: term
clasohm@923
    19
  val mk_Trueprop: term -> term
clasohm@923
    20
  val dest_Trueprop: term -> term
wenzelm@23555
    21
  val dest_cTrueprop: cterm -> cterm
wenzelm@23555
    22
  val Trueprop_conv: conv -> conv
wenzelm@23555
    23
  val conj_intr: thm -> thm -> thm
wenzelm@23555
    24
  val conj_elim: thm -> thm * thm
wenzelm@23555
    25
  val conj_elims: thm -> thm list
clasohm@923
    26
  val conj: term
clasohm@923
    27
  val disj: term
clasohm@923
    28
  val imp: term
wenzelm@8429
    29
  val Not: term
wenzelm@7690
    30
  val mk_conj: term * term -> term
wenzelm@7690
    31
  val mk_disj: term * term -> term
wenzelm@7690
    32
  val mk_imp: term * term -> term
wenzelm@16835
    33
  val mk_not: term -> term
paulson@15151
    34
  val dest_conj: term -> term list
paulson@15945
    35
  val dest_disj: term -> term list
wenzelm@4571
    36
  val dest_imp: term -> term * term
paulson@15151
    37
  val dest_not: term -> term
wenzelm@11683
    38
  val dest_concls: term -> term list
clasohm@923
    39
  val eq_const: typ -> term
wenzelm@21829
    40
  val mk_eq: term * term -> term
wenzelm@21829
    41
  val dest_eq: term -> term * term
clasohm@923
    42
  val all_const: typ -> term
wenzelm@21829
    43
  val mk_all: string * typ * term -> term
wenzelm@21829
    44
  val list_all: (string * typ) list * term -> term
clasohm@923
    45
  val exists_const: typ -> term
wenzelm@21829
    46
  val mk_exists: string * typ * term -> term
paulson@15945
    47
  val choice_const: typ -> term
clasohm@923
    48
  val Collect_const: typ -> term
clasohm@923
    49
  val mk_Collect: string * typ * term -> term
wenzelm@21829
    50
  val class_eq: string
clasohm@923
    51
  val mk_mem: term * term -> term
wenzelm@6380
    52
  val dest_mem: term -> term * term
wenzelm@11818
    53
  val mk_UNIV: typ -> term
wenzelm@2510
    54
  val mk_binop: string -> term * term -> term
wenzelm@2510
    55
  val mk_binrel: string -> term * term -> term
wenzelm@2510
    56
  val dest_bin: string -> typ -> term -> term * term
wenzelm@4571
    57
  val unitT: typ
wenzelm@9362
    58
  val is_unitT: typ -> bool
wenzelm@4571
    59
  val unit: term
wenzelm@4571
    60
  val is_unit: term -> bool
wenzelm@4571
    61
  val mk_prodT: typ * typ -> typ
wenzelm@4571
    62
  val dest_prodT: typ -> typ * typ
berghofe@14048
    63
  val pair_const: typ -> typ -> term
wenzelm@4571
    64
  val mk_prod: term * term -> term
wenzelm@4571
    65
  val dest_prod: term -> term * term
wenzelm@4571
    66
  val mk_fst: term -> term
wenzelm@4571
    67
  val mk_snd: term -> term
wenzelm@21829
    68
  val split_const: typ * typ * typ -> term
wenzelm@18285
    69
  val mk_split: term -> term
berghofe@5096
    70
  val prodT_factors: typ -> typ list
berghofe@5096
    71
  val mk_tuple: typ -> term list -> term
wenzelm@5207
    72
  val natT: typ
wenzelm@5207
    73
  val zero: term
wenzelm@5207
    74
  val is_zero: term -> bool
wenzelm@5207
    75
  val mk_Suc: term -> term
wenzelm@5207
    76
  val dest_Suc: term -> term
haftmann@21621
    77
  val Suc_zero: term
haftmann@23247
    78
  val mk_nat: integer -> term
haftmann@23247
    79
  val dest_nat: term -> integer
haftmann@22994
    80
  val class_size: string
haftmann@22994
    81
  val size_const: typ -> term
paulson@15620
    82
  val bitT: typ
paulson@15620
    83
  val B0_const: term
paulson@15620
    84
  val B1_const: term
wenzelm@21778
    85
  val mk_bit: int -> term
wenzelm@21778
    86
  val dest_bit: term -> int
wenzelm@21829
    87
  val intT: typ
paulson@7073
    88
  val pls_const: term
paulson@7073
    89
  val min_const: term
paulson@7073
    90
  val bit_const: term
haftmann@23247
    91
  val mk_numeral: integer -> term
haftmann@23247
    92
  val dest_numeral: term -> integer
wenzelm@21829
    93
  val number_of_const: typ -> term
wenzelm@23269
    94
  val add_numerals: term -> (term * typ) list -> (term * typ) list
haftmann@23247
    95
  val mk_number: typ -> integer -> term
haftmann@23247
    96
  val dest_number: term -> typ * integer
wenzelm@21778
    97
  val realT: typ
wenzelm@21755
    98
  val nibbleT: typ
wenzelm@21755
    99
  val mk_nibble: int -> term
wenzelm@21755
   100
  val dest_nibble: term -> int
wenzelm@21755
   101
  val charT: typ
wenzelm@21755
   102
  val mk_char: int -> term
wenzelm@21755
   103
  val dest_char: term -> int
wenzelm@21829
   104
  val listT: typ -> typ
wenzelm@21829
   105
  val mk_list: typ -> term list -> term
wenzelm@21829
   106
  val dest_list: term -> term list
wenzelm@21778
   107
  val stringT: typ
haftmann@21820
   108
  val mk_string: string -> term
haftmann@21820
   109
  val dest_string: term -> string
clasohm@923
   110
end;
clasohm@923
   111
clasohm@923
   112
structure HOLogic: HOLOGIC =
clasohm@923
   113
struct
clasohm@923
   114
wenzelm@12338
   115
(* HOL syntax *)
clasohm@923
   116
wenzelm@12338
   117
val typeS: sort = ["HOL.type"];
wenzelm@12338
   118
val typeT = TypeInfer.anyT typeS;
wenzelm@12338
   119
clasohm@923
   120
wenzelm@2510
   121
(* bool and set *)
clasohm@923
   122
wenzelm@8275
   123
val boolN = "bool";
wenzelm@8275
   124
val boolT = Type (boolN, []);
clasohm@923
   125
wenzelm@9856
   126
val true_const =  Const ("True", boolT);
wenzelm@9856
   127
val false_const = Const ("False", boolT);
paulson@7073
   128
clasohm@923
   129
fun mk_setT T = Type ("set", [T]);
clasohm@923
   130
clasohm@923
   131
fun dest_setT (Type ("set", [T])) = T
wenzelm@3794
   132
  | dest_setT T = raise TYPE ("dest_setT: set type expected", [T], []);
clasohm@923
   133
wenzelm@8275
   134
paulson@7073
   135
(* logic *)
clasohm@923
   136
clasohm@923
   137
val Trueprop = Const ("Trueprop", boolT --> propT);
clasohm@923
   138
clasohm@923
   139
fun mk_Trueprop P = Trueprop $ P;
clasohm@923
   140
clasohm@923
   141
fun dest_Trueprop (Const ("Trueprop", _) $ P) = P
wenzelm@3794
   142
  | dest_Trueprop t = raise TERM ("dest_Trueprop", [t]);
clasohm@923
   143
wenzelm@23555
   144
fun dest_cTrueprop ct =
wenzelm@23555
   145
  if can dest_Trueprop (Thm.term_of ct) then Thm.dest_arg ct
wenzelm@23555
   146
  else raise CTERM ("cdest_Trueprop", [ct]);
wenzelm@23555
   147
wenzelm@23555
   148
fun Trueprop_conv conv ct =
wenzelm@23555
   149
  if can dest_Trueprop (Thm.term_of ct) then Conv.arg_conv conv ct
wenzelm@23555
   150
  else raise CTERM ("Trueprop_conv", [ct]);
wenzelm@23555
   151
wenzelm@23555
   152
fun conj_intr thP thQ =
wenzelm@23555
   153
  let
wenzelm@23555
   154
    val (P, Q) = pairself (dest_cTrueprop o Thm.cprop_of) (thP, thQ)
wenzelm@23555
   155
      handle CTERM (msg, _) => raise THM (msg, 0, [thP, thQ]);
wenzelm@23555
   156
    val inst = Thm.instantiate ([], [(@{cpat "?P::bool"}, P), (@{cpat "?Q::bool"}, Q)]);
wenzelm@23555
   157
  in Drule.implies_elim_list (inst @{thm conjI}) [thP, thQ] end;
clasohm@923
   158
wenzelm@23555
   159
fun conj_elim thPQ =
wenzelm@23555
   160
  let
wenzelm@23555
   161
    val (P, Q) = Thm.dest_binop (dest_cTrueprop (Thm.cprop_of thPQ))
wenzelm@23555
   162
      handle CTERM (msg, _) => raise THM (msg, 0, [thPQ]);
wenzelm@23555
   163
    val inst = Thm.instantiate ([], [(@{cpat "?P::bool"}, P), (@{cpat "?Q::bool"}, Q)]);
wenzelm@23555
   164
    val thP = Thm.implies_elim (inst @{thm conjunct1}) thPQ;
wenzelm@23555
   165
    val thQ = Thm.implies_elim (inst @{thm conjunct2}) thPQ;
wenzelm@23555
   166
  in (thP, thQ) end;
wenzelm@23555
   167
wenzelm@23555
   168
fun conj_elims th =
wenzelm@23555
   169
  let val (th1, th2) = conj_elim th
wenzelm@23555
   170
  in conj_elims th1 @ conj_elims th2 end handle THM _ => [th];
wenzelm@23555
   171
wenzelm@23555
   172
val conj = @{term "op &"}
wenzelm@23555
   173
and disj = @{term "op |"}
wenzelm@23555
   174
and imp = @{term "op -->"}
wenzelm@23555
   175
and Not = @{term "Not"};
clasohm@923
   176
wenzelm@7690
   177
fun mk_conj (t1, t2) = conj $ t1 $ t2
wenzelm@7690
   178
and mk_disj (t1, t2) = disj $ t1 $ t2
wenzelm@16835
   179
and mk_imp (t1, t2) = imp $ t1 $ t2
wenzelm@16835
   180
and mk_not t = Not $ t;
wenzelm@7690
   181
paulson@15151
   182
fun dest_conj (Const ("op &", _) $ t $ t') = t :: dest_conj t'
paulson@15151
   183
  | dest_conj t = [t];
paulson@15151
   184
paulson@15945
   185
fun dest_disj (Const ("op |", _) $ t $ t') = t :: dest_disj t'
paulson@15945
   186
  | dest_disj t = [t];
paulson@15945
   187
paulson@4466
   188
fun dest_imp (Const("op -->",_) $ A $ B) = (A, B)
paulson@4466
   189
  | dest_imp  t = raise TERM ("dest_imp", [t]);
paulson@4466
   190
paulson@15151
   191
fun dest_not (Const ("Not", _) $ t) = t
paulson@15151
   192
  | dest_not t = raise TERM ("dest_not", [t]);
wenzelm@8302
   193
wenzelm@11683
   194
fun imp_concl_of t = imp_concl_of (#2 (dest_imp t)) handle TERM _ => t;
wenzelm@11683
   195
val dest_concls = map imp_concl_of o dest_conj o dest_Trueprop;
wenzelm@11683
   196
clasohm@923
   197
fun eq_const T = Const ("op =", [T, T] ---> boolT);
clasohm@923
   198
fun mk_eq (t, u) = eq_const (fastype_of t) $ t $ u;
clasohm@923
   199
paulson@6031
   200
fun dest_eq (Const ("op =", _) $ lhs $ rhs) = (lhs, rhs)
paulson@6031
   201
  | dest_eq t = raise TERM ("dest_eq", [t])
paulson@6031
   202
clasohm@923
   203
fun all_const T = Const ("All", [T --> boolT] ---> boolT);
clasohm@923
   204
fun mk_all (x, T, P) = all_const T $ absfree (x, T, P);
wenzelm@21173
   205
fun list_all (xs, t) = fold_rev (fn (x, T) => fn P => all_const T $ Abs (x, T, P)) xs t;
clasohm@923
   206
clasohm@923
   207
fun exists_const T = Const ("Ex", [T --> boolT] ---> boolT);
clasohm@923
   208
fun mk_exists (x, T, P) = exists_const T $ absfree (x, T, P);
clasohm@923
   209
wenzelm@21755
   210
fun choice_const T = Const("Hilbert_Choice.Eps", (T --> boolT) --> T);
paulson@15945
   211
clasohm@923
   212
fun Collect_const T = Const ("Collect", [T --> boolT] ---> mk_setT T);
clasohm@923
   213
fun mk_Collect (a, T, t) = Collect_const T $ absfree (a, T, t);
clasohm@923
   214
haftmann@23247
   215
val class_eq = "HOL.eq";
haftmann@21045
   216
clasohm@923
   217
fun mk_mem (x, A) =
clasohm@923
   218
  let val setT = fastype_of A in
clasohm@923
   219
    Const ("op :", [dest_setT setT, setT] ---> boolT) $ x $ A
clasohm@923
   220
  end;
clasohm@923
   221
wenzelm@6380
   222
fun dest_mem (Const ("op :", _) $ x $ A) = (x, A)
wenzelm@6380
   223
  | dest_mem t = raise TERM ("dest_mem", [t]);
wenzelm@6380
   224
wenzelm@11818
   225
fun mk_UNIV T = Const ("UNIV", mk_setT T);
wenzelm@11818
   226
clasohm@923
   227
ballarin@13743
   228
(* binary operations and relations *)
wenzelm@2510
   229
wenzelm@2510
   230
fun mk_binop c (t, u) =
wenzelm@2510
   231
  let val T = fastype_of t in
wenzelm@2510
   232
    Const (c, [T, T] ---> T) $ t $ u
wenzelm@2510
   233
  end;
wenzelm@2510
   234
wenzelm@2510
   235
fun mk_binrel c (t, u) =
wenzelm@2510
   236
  let val T = fastype_of t in
wenzelm@2510
   237
    Const (c, [T, T] ---> boolT) $ t $ u
wenzelm@2510
   238
  end;
wenzelm@2510
   239
paulson@14387
   240
(*destruct the application of a binary operator. The dummyT case is a crude
paulson@14387
   241
  way of handling polymorphic operators.*)
wenzelm@2510
   242
fun dest_bin c T (tm as Const (c', Type ("fun", [T', _])) $ t $ u) =
paulson@14387
   243
      if c = c' andalso (T=T' orelse T=dummyT) then (t, u)
wenzelm@3794
   244
      else raise TERM ("dest_bin " ^ c, [tm])
wenzelm@3794
   245
  | dest_bin c _ tm = raise TERM ("dest_bin " ^ c, [tm]);
wenzelm@2510
   246
wenzelm@2510
   247
wenzelm@4571
   248
(* unit *)
wenzelm@4571
   249
wenzelm@11604
   250
val unitT = Type ("Product_Type.unit", []);
wenzelm@4571
   251
wenzelm@11604
   252
fun is_unitT (Type ("Product_Type.unit", [])) = true
wenzelm@9362
   253
  | is_unitT _ = false;
wenzelm@9362
   254
wenzelm@11604
   255
val unit = Const ("Product_Type.Unity", unitT);
wenzelm@4571
   256
wenzelm@11604
   257
fun is_unit (Const ("Product_Type.Unity", _)) = true
wenzelm@4571
   258
  | is_unit _ = false;
wenzelm@4571
   259
wenzelm@4571
   260
wenzelm@4571
   261
(* prod *)
wenzelm@4571
   262
wenzelm@4571
   263
fun mk_prodT (T1, T2) = Type ("*", [T1, T2]);
wenzelm@4571
   264
wenzelm@4571
   265
fun dest_prodT (Type ("*", [T1, T2])) = (T1, T2)
wenzelm@4571
   266
  | dest_prodT T = raise TYPE ("dest_prodT", [T], []);
wenzelm@4571
   267
berghofe@14048
   268
fun pair_const T1 T2 = Const ("Pair", [T1, T2] ---> mk_prodT (T1, T2));
berghofe@14048
   269
wenzelm@4571
   270
fun mk_prod (t1, t2) =
wenzelm@4571
   271
  let val T1 = fastype_of t1 and T2 = fastype_of t2 in
berghofe@14048
   272
    pair_const T1 T2 $ t1 $ t2
wenzelm@4571
   273
  end;
wenzelm@4571
   274
wenzelm@4571
   275
fun dest_prod (Const ("Pair", _) $ t1 $ t2) = (t1, t2)
wenzelm@4571
   276
  | dest_prod t = raise TERM ("dest_prod", [t]);
wenzelm@4571
   277
wenzelm@4571
   278
fun mk_fst p =
wenzelm@4571
   279
  let val pT = fastype_of p in
wenzelm@4571
   280
    Const ("fst", pT --> fst (dest_prodT pT)) $ p
wenzelm@4571
   281
  end;
wenzelm@4571
   282
wenzelm@4571
   283
fun mk_snd p =
wenzelm@4571
   284
  let val pT = fastype_of p in
wenzelm@4571
   285
    Const ("snd", pT --> snd (dest_prodT pT)) $ p
wenzelm@4571
   286
  end;
wenzelm@4571
   287
wenzelm@18285
   288
fun split_const (A, B, C) =
wenzelm@18285
   289
  Const ("split", (A --> B --> C) --> mk_prodT (A, B) --> C);
wenzelm@18285
   290
wenzelm@18285
   291
fun mk_split t =
wenzelm@18285
   292
  (case Term.fastype_of t of
wenzelm@18285
   293
    T as (Type ("fun", [A, Type ("fun", [B, C])])) =>
wenzelm@18285
   294
      Const ("split", T --> mk_prodT (A, B) --> C) $ t
wenzelm@18285
   295
  | _ => raise TERM ("mk_split: bad body type", [t]));
wenzelm@18285
   296
berghofe@5096
   297
(*Maps the type T1 * ... * Tn to [T1, ..., Tn], however nested*)
berghofe@5096
   298
fun prodT_factors (Type ("*", [T1, T2])) = prodT_factors T1 @ prodT_factors T2
berghofe@5096
   299
  | prodT_factors T = [T];
berghofe@5096
   300
berghofe@5096
   301
(*Makes a nested tuple from a list, following the product type structure*)
wenzelm@16971
   302
fun mk_tuple (Type ("*", [T1, T2])) tms =
wenzelm@16971
   303
        mk_prod (mk_tuple T1 tms,
skalberg@15570
   304
                 mk_tuple T2 (Library.drop (length (prodT_factors T1), tms)))
berghofe@5096
   305
  | mk_tuple T (t::_) = t;
wenzelm@4571
   306
wenzelm@5207
   307
wenzelm@5207
   308
(* nat *)
wenzelm@5207
   309
wenzelm@5207
   310
val natT = Type ("nat", []);
wenzelm@5207
   311
haftmann@22994
   312
val zero = Const ("HOL.zero_class.zero", natT);
wenzelm@5207
   313
haftmann@22994
   314
fun is_zero (Const ("HOL.zero_class.zero", _)) = true
wenzelm@5207
   315
  | is_zero _ = false;
wenzelm@5207
   316
wenzelm@5207
   317
fun mk_Suc t = Const ("Suc", natT --> natT) $ t;
wenzelm@5207
   318
wenzelm@5207
   319
fun dest_Suc (Const ("Suc", _) $ t) = t
wenzelm@5207
   320
  | dest_Suc t = raise TERM ("dest_Suc", [t]);
wenzelm@5207
   321
haftmann@21621
   322
val Suc_zero = mk_Suc zero;
haftmann@21621
   323
wenzelm@23297
   324
fun mk_nat (n: integer) =
haftmann@22994
   325
  let
haftmann@22994
   326
    fun mk 0 = zero
wenzelm@23297
   327
      | mk n = mk_Suc (mk (n - 1));
wenzelm@23297
   328
  in if n < 0 then raise TERM ("mk_nat: negative numeral", []) else mk n end;
wenzelm@5207
   329
wenzelm@23297
   330
fun dest_nat (Const ("HOL.zero_class.zero", _)) = (0: integer)
wenzelm@23297
   331
  | dest_nat (Const ("Suc", _) $ t) = dest_nat t + 1
wenzelm@5207
   332
  | dest_nat t = raise TERM ("dest_nat", [t]);
wenzelm@5207
   333
haftmann@22994
   334
val class_size = "Nat.size";
haftmann@22994
   335
haftmann@22994
   336
fun size_const T = Const ("Nat.size_class.size", T --> natT);
haftmann@22994
   337
wenzelm@5207
   338
wenzelm@21778
   339
(* bit *)
paulson@7073
   340
paulson@15620
   341
val bitT = Type ("Numeral.bit", []);
paulson@15620
   342
paulson@15620
   343
val B0_const = Const ("Numeral.bit.B0", bitT);
paulson@15620
   344
val B1_const =  Const ("Numeral.bit.B1", bitT);
paulson@15620
   345
wenzelm@21778
   346
fun mk_bit 0 = B0_const
wenzelm@21778
   347
  | mk_bit 1 = B1_const
wenzelm@21778
   348
  | mk_bit _ = raise TERM ("mk_bit", []);
wenzelm@21778
   349
wenzelm@21778
   350
fun dest_bit (Const ("Numeral.bit.B0", _)) = 0
wenzelm@21778
   351
  | dest_bit (Const ("Numeral.bit.B1", _)) = 1
wenzelm@21778
   352
  | dest_bit t = raise TERM ("dest_bit", [t]);
wenzelm@21778
   353
wenzelm@21778
   354
wenzelm@21778
   355
(* binary numerals and int -- non-unique representation due to leading zeros/ones! *)
wenzelm@21778
   356
wenzelm@21778
   357
val intT = Type ("IntDef.int", []);
wenzelm@21778
   358
haftmann@20485
   359
val pls_const = Const ("Numeral.Pls", intT)
haftmann@20485
   360
and min_const = Const ("Numeral.Min", intT)
haftmann@23247
   361
and bit_const = Const ("Numeral.Bit", intT --> bitT --> intT);
paulson@8768
   362
wenzelm@21829
   363
fun mk_numeral 0 = pls_const
wenzelm@21829
   364
  | mk_numeral ~1 = min_const
wenzelm@21829
   365
  | mk_numeral i =
haftmann@23247
   366
      let val (q, r) = Integer.divmod i 2
haftmann@23247
   367
      in bit_const $ mk_numeral q $ mk_bit (Integer.machine_int r) end;
berghofe@13755
   368
wenzelm@21829
   369
fun dest_numeral (Const ("Numeral.Pls", _)) = 0
wenzelm@21829
   370
  | dest_numeral (Const ("Numeral.Min", _)) = ~1
wenzelm@21829
   371
  | dest_numeral (Const ("Numeral.Bit", _) $ bs $ b) =
wenzelm@23297
   372
      2 * dest_numeral bs + Integer.int (dest_bit b)
wenzelm@21829
   373
  | dest_numeral t = raise TERM ("dest_numeral", [t]);
berghofe@13755
   374
haftmann@22994
   375
fun number_of_const T = Const ("Numeral.number_class.number_of", intT --> T);
haftmann@21820
   376
wenzelm@23269
   377
fun add_numerals (Const ("Numeral.number_class.number_of", Type (_, [_, T])) $ t) = cons (t, T)
wenzelm@23269
   378
  | add_numerals (t $ u) = add_numerals t #> add_numerals u
wenzelm@23269
   379
  | add_numerals (Abs (_, _, t)) = add_numerals t
wenzelm@23269
   380
  | add_numerals _ = I;
haftmann@22391
   381
haftmann@22994
   382
fun mk_number T 0 = Const ("HOL.zero_class.zero", T)
haftmann@22994
   383
  | mk_number T 1 = Const ("HOL.one_class.one", T)
haftmann@21820
   384
  | mk_number T i = number_of_const T $ mk_numeral i;
haftmann@21820
   385
haftmann@22994
   386
fun dest_number (Const ("HOL.zero_class.zero", T)) = (T, 0)
haftmann@22994
   387
  | dest_number (Const ("HOL.one_class.one", T)) = (T, 1)
haftmann@22994
   388
  | dest_number (Const ("Numeral.number_class.number_of", Type ("fun", [_, T])) $ t) =
haftmann@22994
   389
      (T, dest_numeral t)
haftmann@21820
   390
  | dest_number t = raise TERM ("dest_number", [t]);
berghofe@13755
   391
wenzelm@21829
   392
berghofe@13755
   393
(* real *)
berghofe@13755
   394
wenzelm@16971
   395
val realT = Type ("RealDef.real", []);
berghofe@13755
   396
berghofe@13755
   397
wenzelm@21755
   398
(* nibble *)
wenzelm@21755
   399
wenzelm@21755
   400
val nibbleT = Type ("List.nibble", []);
berghofe@13755
   401
wenzelm@21755
   402
fun mk_nibble n =
wenzelm@21755
   403
  let val s =
wenzelm@21755
   404
    if 0 <= n andalso n <= 9 then chr (n + ord "0")
wenzelm@21755
   405
    else if 10 <= n andalso n <= 15 then chr (n + ord "A" - 10)
wenzelm@21755
   406
    else raise TERM ("mk_nibble", [])
wenzelm@21755
   407
  in Const ("List.nibble.Nibble" ^ s, nibbleT) end;
nipkow@17083
   408
wenzelm@21755
   409
fun dest_nibble t =
wenzelm@21755
   410
  let fun err () = raise TERM ("dest_nibble", [t]) in
wenzelm@21755
   411
    (case try (unprefix "List.nibble.Nibble" o fst o Term.dest_Const) t of
wenzelm@21755
   412
      NONE => err ()
wenzelm@21755
   413
    | SOME c =>
wenzelm@21755
   414
        if size c <> 1 then err ()
wenzelm@21755
   415
        else if "0" <= c andalso c <= "9" then ord c - ord "0"
wenzelm@21755
   416
        else if "A" <= c andalso c <= "F" then ord c - ord "A" + 10
wenzelm@21755
   417
        else err ())
wenzelm@21755
   418
  end;
berghofe@15062
   419
haftmann@21455
   420
haftmann@21455
   421
(* char *)
haftmann@21455
   422
haftmann@21455
   423
val charT = Type ("List.char", []);
haftmann@21455
   424
wenzelm@21755
   425
fun mk_char n =
wenzelm@21755
   426
  if 0 <= n andalso n <= 255 then
wenzelm@21755
   427
    Const ("List.char.Char", nibbleT --> nibbleT --> charT) $
wenzelm@21755
   428
      mk_nibble (n div 16) $ mk_nibble (n mod 16)
wenzelm@21755
   429
  else raise TERM ("mk_char", []);
haftmann@21455
   430
wenzelm@21755
   431
fun dest_char (Const ("List.char.Char", _) $ t $ u) =
wenzelm@21755
   432
      dest_nibble t * 16 + dest_nibble u
wenzelm@21755
   433
  | dest_char t = raise TERM ("dest_char", [t]);
haftmann@21455
   434
wenzelm@21755
   435
wenzelm@21755
   436
(* list *)
haftmann@21455
   437
wenzelm@21755
   438
fun listT T = Type ("List.list", [T]);
haftmann@21455
   439
wenzelm@21755
   440
fun mk_list T ts =
haftmann@21455
   441
  let
wenzelm@21755
   442
    val lT = listT T;
wenzelm@21755
   443
    val Nil = Const ("List.list.Nil", lT);
wenzelm@21755
   444
    fun Cons t u = Const ("List.list.Cons", T --> lT --> lT) $ t $ u;
wenzelm@21755
   445
  in fold_rev Cons ts Nil end;
wenzelm@21755
   446
wenzelm@21755
   447
fun dest_list (Const ("List.list.Nil", _)) = []
wenzelm@21755
   448
  | dest_list (Const ("List.list.Cons", _) $ t $ u) = t :: dest_list u
wenzelm@21755
   449
  | dest_list t = raise TERM ("dest_list", [t]);
haftmann@21455
   450
haftmann@21455
   451
haftmann@21455
   452
(* string *)
haftmann@21455
   453
haftmann@21820
   454
val stringT = Type ("List.string", []);
haftmann@21455
   455
wenzelm@21755
   456
val mk_string = mk_list charT o map (mk_char o ord) o explode;
wenzelm@21755
   457
val dest_string = implode o map (chr o dest_char) o dest_list;
haftmann@21455
   458
clasohm@923
   459
end;