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