src/HOL/hologic.ML
author haftmann
Mon Oct 16 14:07:21 2006 +0200 (2006-10-16)
changeset 21045 66d6d1b0ddfa
parent 20973 0b8e436ed071
child 21078 101aefd61aac
permissions -rw-r--r--
slight cleanup
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
paulson@7073
    14
  val false_const: term
paulson@7073
    15
  val true_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
paulson@20827
    20
  val is_Trueprop: term -> bool
clasohm@923
    21
  val dest_Trueprop: term -> term
clasohm@923
    22
  val conj: term
clasohm@923
    23
  val disj: term
clasohm@923
    24
  val imp: term
wenzelm@8429
    25
  val Not: term
wenzelm@7690
    26
  val mk_conj: term * term -> term
wenzelm@7690
    27
  val mk_disj: term * term -> term
wenzelm@7690
    28
  val mk_imp: term * term -> term
wenzelm@16835
    29
  val mk_not: term -> term
paulson@15151
    30
  val dest_conj: term -> term list
paulson@15945
    31
  val dest_disj: term -> term list
wenzelm@4571
    32
  val dest_imp: term -> term * term
paulson@15151
    33
  val dest_not: term -> term
wenzelm@11683
    34
  val dest_concls: term -> term list
clasohm@923
    35
  val eq_const: typ -> term
clasohm@923
    36
  val all_const: typ -> term
clasohm@923
    37
  val exists_const: typ -> term
paulson@15945
    38
  val choice_const: typ -> term
clasohm@923
    39
  val Collect_const: typ -> term
clasohm@923
    40
  val mk_eq: term * term -> term
paulson@6031
    41
  val dest_eq: term -> term * term
haftmann@20973
    42
  val dest_eq_typ: term -> (term * term) * typ
clasohm@923
    43
  val mk_all: string * typ * term -> term
berghofe@13640
    44
  val list_all: (string * typ) list * term -> term
clasohm@923
    45
  val mk_exists: string * typ * term -> term
clasohm@923
    46
  val mk_Collect: string * typ * term -> term
haftmann@21045
    47
  val class_eq: string
clasohm@923
    48
  val mk_mem: term * term -> term
wenzelm@6380
    49
  val dest_mem: term -> term * term
wenzelm@11818
    50
  val mk_UNIV: typ -> term
wenzelm@2510
    51
  val mk_binop: string -> term * term -> term
wenzelm@2510
    52
  val mk_binrel: string -> term * term -> term
wenzelm@2510
    53
  val dest_bin: string -> typ -> term -> term * term
wenzelm@4571
    54
  val unitT: typ
wenzelm@9362
    55
  val is_unitT: typ -> bool
wenzelm@4571
    56
  val unit: term
wenzelm@4571
    57
  val is_unit: term -> bool
wenzelm@4571
    58
  val mk_prodT: typ * typ -> typ
wenzelm@4571
    59
  val dest_prodT: typ -> typ * typ
berghofe@14048
    60
  val pair_const: typ -> typ -> term
wenzelm@4571
    61
  val mk_prod: term * term -> term
wenzelm@4571
    62
  val dest_prod: term -> term * term
wenzelm@4571
    63
  val mk_fst: term -> term
wenzelm@4571
    64
  val mk_snd: term -> term
wenzelm@18285
    65
  val mk_split: term -> term
berghofe@5096
    66
  val prodT_factors: typ -> typ list
berghofe@5096
    67
  val split_const: typ * typ * typ -> term
berghofe@5096
    68
  val mk_tuple: typ -> term list -> term
wenzelm@5207
    69
  val natT: typ
wenzelm@5207
    70
  val zero: term
wenzelm@5207
    71
  val is_zero: term -> bool
wenzelm@5207
    72
  val mk_Suc: term -> term
wenzelm@5207
    73
  val dest_Suc: term -> term
wenzelm@5207
    74
  val mk_nat: int -> term
wenzelm@5207
    75
  val dest_nat: term -> int
paulson@7073
    76
  val intT: typ
paulson@15965
    77
  val mk_int: IntInf.int -> term
paulson@7163
    78
  val realT: typ
paulson@15620
    79
  val bitT: typ
paulson@15620
    80
  val B0_const: term
paulson@15620
    81
  val B1_const: term
paulson@7073
    82
  val pls_const: term
paulson@7073
    83
  val min_const: term
paulson@7073
    84
  val bit_const: term
paulson@8768
    85
  val number_of_const: typ -> term
wenzelm@16971
    86
  val int_of: int list -> IntInf.int
paulson@15965
    87
  val dest_binum: term -> IntInf.int
paulson@19481
    88
  val mk_binum: IntInf.int -> term
paulson@15620
    89
  val bin_of : term -> int list
nipkow@17083
    90
  val listT : typ -> typ
berghofe@13755
    91
  val mk_list: ('a -> term) -> typ -> 'a list -> term
berghofe@15062
    92
  val dest_list: term -> term list
clasohm@923
    93
end;
clasohm@923
    94
wenzelm@2510
    95
clasohm@923
    96
structure HOLogic: HOLOGIC =
clasohm@923
    97
struct
clasohm@923
    98
wenzelm@12338
    99
(* HOL syntax *)
clasohm@923
   100
wenzelm@12338
   101
val typeS: sort = ["HOL.type"];
wenzelm@12338
   102
val typeT = TypeInfer.anyT typeS;
wenzelm@12338
   103
clasohm@923
   104
wenzelm@2510
   105
(* bool and set *)
clasohm@923
   106
wenzelm@8275
   107
val boolN = "bool";
wenzelm@8275
   108
val boolT = Type (boolN, []);
clasohm@923
   109
wenzelm@9856
   110
val true_const =  Const ("True", boolT);
wenzelm@9856
   111
val false_const = Const ("False", boolT);
paulson@7073
   112
clasohm@923
   113
fun mk_setT T = Type ("set", [T]);
clasohm@923
   114
clasohm@923
   115
fun dest_setT (Type ("set", [T])) = T
wenzelm@3794
   116
  | dest_setT T = raise TYPE ("dest_setT: set type expected", [T], []);
clasohm@923
   117
wenzelm@8275
   118
paulson@7073
   119
(* logic *)
clasohm@923
   120
clasohm@923
   121
val Trueprop = Const ("Trueprop", boolT --> propT);
clasohm@923
   122
clasohm@923
   123
fun mk_Trueprop P = Trueprop $ P;
clasohm@923
   124
paulson@20827
   125
fun is_Trueprop (Const ("Trueprop", _) $ _) = true
paulson@20827
   126
  | is_Trueprop t = false;
paulson@20827
   127
clasohm@923
   128
fun dest_Trueprop (Const ("Trueprop", _) $ P) = P
wenzelm@3794
   129
  | dest_Trueprop t = raise TERM ("dest_Trueprop", [t]);
clasohm@923
   130
clasohm@923
   131
clasohm@923
   132
val conj = Const ("op &", [boolT, boolT] ---> boolT)
clasohm@923
   133
and disj = Const ("op |", [boolT, boolT] ---> boolT)
wenzelm@8429
   134
and imp = Const ("op -->", [boolT, boolT] ---> boolT)
wenzelm@8429
   135
and Not = Const ("Not", boolT --> boolT);
clasohm@923
   136
wenzelm@7690
   137
fun mk_conj (t1, t2) = conj $ t1 $ t2
wenzelm@7690
   138
and mk_disj (t1, t2) = disj $ t1 $ t2
wenzelm@16835
   139
and mk_imp (t1, t2) = imp $ t1 $ t2
wenzelm@16835
   140
and mk_not t = Not $ t;
wenzelm@7690
   141
paulson@15151
   142
fun dest_conj (Const ("op &", _) $ t $ t') = t :: dest_conj t'
paulson@15151
   143
  | dest_conj t = [t];
paulson@15151
   144
paulson@15945
   145
fun dest_disj (Const ("op |", _) $ t $ t') = t :: dest_disj t'
paulson@15945
   146
  | dest_disj t = [t];
paulson@15945
   147
paulson@4466
   148
fun dest_imp (Const("op -->",_) $ A $ B) = (A, B)
paulson@4466
   149
  | dest_imp  t = raise TERM ("dest_imp", [t]);
paulson@4466
   150
paulson@15151
   151
fun dest_not (Const ("Not", _) $ t) = t
paulson@15151
   152
  | dest_not t = raise TERM ("dest_not", [t]);
wenzelm@8302
   153
wenzelm@11683
   154
fun imp_concl_of t = imp_concl_of (#2 (dest_imp t)) handle TERM _ => t;
wenzelm@11683
   155
val dest_concls = map imp_concl_of o dest_conj o dest_Trueprop;
wenzelm@11683
   156
clasohm@923
   157
fun eq_const T = Const ("op =", [T, T] ---> boolT);
clasohm@923
   158
fun mk_eq (t, u) = eq_const (fastype_of t) $ t $ u;
clasohm@923
   159
paulson@6031
   160
fun dest_eq (Const ("op =", _) $ lhs $ rhs) = (lhs, rhs)
paulson@6031
   161
  | dest_eq t = raise TERM ("dest_eq", [t])
paulson@6031
   162
haftmann@20973
   163
fun dest_eq_typ (Const ("op =", T) $ lhs $ rhs) = ((lhs, rhs), domain_type T)
haftmann@20973
   164
  | dest_eq_typ t = raise TERM ("dest_eq_typ", [t])
haftmann@20973
   165
clasohm@923
   166
fun all_const T = Const ("All", [T --> boolT] ---> boolT);
clasohm@923
   167
fun mk_all (x, T, P) = all_const T $ absfree (x, T, P);
skalberg@15574
   168
fun list_all (vs,x) = foldr (fn ((x, T), P) => all_const T $ Abs (x, T, P)) x vs;
clasohm@923
   169
clasohm@923
   170
fun exists_const T = Const ("Ex", [T --> boolT] ---> boolT);
clasohm@923
   171
fun mk_exists (x, T, P) = exists_const T $ absfree (x, T, P);
clasohm@923
   172
paulson@15945
   173
fun choice_const T = Const("Hilbert_Choice.Eps", (T --> boolT) --> T)
paulson@15945
   174
clasohm@923
   175
fun Collect_const T = Const ("Collect", [T --> boolT] ---> mk_setT T);
clasohm@923
   176
fun mk_Collect (a, T, t) = Collect_const T $ absfree (a, T, t);
clasohm@923
   177
haftmann@21045
   178
val class_eq = "Code_Generator.eq";
haftmann@21045
   179
clasohm@923
   180
fun mk_mem (x, A) =
clasohm@923
   181
  let val setT = fastype_of A in
clasohm@923
   182
    Const ("op :", [dest_setT setT, setT] ---> boolT) $ x $ A
clasohm@923
   183
  end;
clasohm@923
   184
wenzelm@6380
   185
fun dest_mem (Const ("op :", _) $ x $ A) = (x, A)
wenzelm@6380
   186
  | dest_mem t = raise TERM ("dest_mem", [t]);
wenzelm@6380
   187
wenzelm@11818
   188
fun mk_UNIV T = Const ("UNIV", mk_setT T);
wenzelm@11818
   189
clasohm@923
   190
ballarin@13743
   191
(* binary operations and relations *)
wenzelm@2510
   192
wenzelm@2510
   193
fun mk_binop c (t, u) =
wenzelm@2510
   194
  let val T = fastype_of t in
wenzelm@2510
   195
    Const (c, [T, T] ---> T) $ t $ u
wenzelm@2510
   196
  end;
wenzelm@2510
   197
wenzelm@2510
   198
fun mk_binrel c (t, u) =
wenzelm@2510
   199
  let val T = fastype_of t in
wenzelm@2510
   200
    Const (c, [T, T] ---> boolT) $ t $ u
wenzelm@2510
   201
  end;
wenzelm@2510
   202
paulson@14387
   203
(*destruct the application of a binary operator. The dummyT case is a crude
paulson@14387
   204
  way of handling polymorphic operators.*)
wenzelm@2510
   205
fun dest_bin c T (tm as Const (c', Type ("fun", [T', _])) $ t $ u) =
paulson@14387
   206
      if c = c' andalso (T=T' orelse T=dummyT) then (t, u)
wenzelm@3794
   207
      else raise TERM ("dest_bin " ^ c, [tm])
wenzelm@3794
   208
  | dest_bin c _ tm = raise TERM ("dest_bin " ^ c, [tm]);
wenzelm@2510
   209
wenzelm@2510
   210
wenzelm@4571
   211
(* unit *)
wenzelm@4571
   212
wenzelm@11604
   213
val unitT = Type ("Product_Type.unit", []);
wenzelm@4571
   214
wenzelm@11604
   215
fun is_unitT (Type ("Product_Type.unit", [])) = true
wenzelm@9362
   216
  | is_unitT _ = false;
wenzelm@9362
   217
wenzelm@11604
   218
val unit = Const ("Product_Type.Unity", unitT);
wenzelm@4571
   219
wenzelm@11604
   220
fun is_unit (Const ("Product_Type.Unity", _)) = true
wenzelm@4571
   221
  | is_unit _ = false;
wenzelm@4571
   222
wenzelm@4571
   223
wenzelm@4571
   224
(* prod *)
wenzelm@4571
   225
wenzelm@4571
   226
fun mk_prodT (T1, T2) = Type ("*", [T1, T2]);
wenzelm@4571
   227
wenzelm@4571
   228
fun dest_prodT (Type ("*", [T1, T2])) = (T1, T2)
wenzelm@4571
   229
  | dest_prodT T = raise TYPE ("dest_prodT", [T], []);
wenzelm@4571
   230
berghofe@14048
   231
fun pair_const T1 T2 = Const ("Pair", [T1, T2] ---> mk_prodT (T1, T2));
berghofe@14048
   232
wenzelm@4571
   233
fun mk_prod (t1, t2) =
wenzelm@4571
   234
  let val T1 = fastype_of t1 and T2 = fastype_of t2 in
berghofe@14048
   235
    pair_const T1 T2 $ t1 $ t2
wenzelm@4571
   236
  end;
wenzelm@4571
   237
wenzelm@4571
   238
fun dest_prod (Const ("Pair", _) $ t1 $ t2) = (t1, t2)
wenzelm@4571
   239
  | dest_prod t = raise TERM ("dest_prod", [t]);
wenzelm@4571
   240
wenzelm@4571
   241
fun mk_fst p =
wenzelm@4571
   242
  let val pT = fastype_of p in
wenzelm@4571
   243
    Const ("fst", pT --> fst (dest_prodT pT)) $ p
wenzelm@4571
   244
  end;
wenzelm@4571
   245
wenzelm@4571
   246
fun mk_snd p =
wenzelm@4571
   247
  let val pT = fastype_of p in
wenzelm@4571
   248
    Const ("snd", pT --> snd (dest_prodT pT)) $ p
wenzelm@4571
   249
  end;
wenzelm@4571
   250
wenzelm@18285
   251
fun split_const (A, B, C) =
wenzelm@18285
   252
  Const ("split", (A --> B --> C) --> mk_prodT (A, B) --> C);
wenzelm@18285
   253
wenzelm@18285
   254
fun mk_split t =
wenzelm@18285
   255
  (case Term.fastype_of t of
wenzelm@18285
   256
    T as (Type ("fun", [A, Type ("fun", [B, C])])) =>
wenzelm@18285
   257
      Const ("split", T --> mk_prodT (A, B) --> C) $ t
wenzelm@18285
   258
  | _ => raise TERM ("mk_split: bad body type", [t]));
wenzelm@18285
   259
berghofe@5096
   260
(*Maps the type T1 * ... * Tn to [T1, ..., Tn], however nested*)
berghofe@5096
   261
fun prodT_factors (Type ("*", [T1, T2])) = prodT_factors T1 @ prodT_factors T2
berghofe@5096
   262
  | prodT_factors T = [T];
berghofe@5096
   263
berghofe@5096
   264
(*Makes a nested tuple from a list, following the product type structure*)
wenzelm@16971
   265
fun mk_tuple (Type ("*", [T1, T2])) tms =
wenzelm@16971
   266
        mk_prod (mk_tuple T1 tms,
skalberg@15570
   267
                 mk_tuple T2 (Library.drop (length (prodT_factors T1), tms)))
berghofe@5096
   268
  | mk_tuple T (t::_) = t;
wenzelm@4571
   269
wenzelm@5207
   270
wenzelm@5207
   271
(* nat *)
wenzelm@5207
   272
wenzelm@5207
   273
val natT = Type ("nat", []);
wenzelm@5207
   274
haftmann@20713
   275
val zero = Const ("HOL.zero", natT);
wenzelm@5207
   276
haftmann@20713
   277
fun is_zero (Const ("HOL.zero", _)) = true
wenzelm@5207
   278
  | is_zero _ = false;
wenzelm@5207
   279
wenzelm@5207
   280
fun mk_Suc t = Const ("Suc", natT --> natT) $ t;
wenzelm@5207
   281
wenzelm@5207
   282
fun dest_Suc (Const ("Suc", _) $ t) = t
wenzelm@5207
   283
  | dest_Suc t = raise TERM ("dest_Suc", [t]);
wenzelm@5207
   284
wenzelm@5207
   285
fun mk_nat 0 = zero
wenzelm@5207
   286
  | mk_nat n = mk_Suc (mk_nat (n - 1));
wenzelm@5207
   287
haftmann@20713
   288
fun dest_nat (Const ("HOL.zero", _)) = 0
wenzelm@5207
   289
  | dest_nat (Const ("Suc", _) $ t) = dest_nat t + 1
wenzelm@5207
   290
  | dest_nat t = raise TERM ("dest_nat", [t]);
wenzelm@5207
   291
wenzelm@5207
   292
haftmann@20485
   293
(* binary numerals and int *)
paulson@7073
   294
haftmann@20485
   295
val intT = Type ("IntDef.int", []);
paulson@15620
   296
val bitT = Type ("Numeral.bit", []);
paulson@15620
   297
paulson@15620
   298
val B0_const = Const ("Numeral.bit.B0", bitT);
paulson@15620
   299
val B1_const =  Const ("Numeral.bit.B1", bitT);
paulson@15620
   300
haftmann@20485
   301
val pls_const = Const ("Numeral.Pls", intT)
haftmann@20485
   302
and min_const = Const ("Numeral.Min", intT)
haftmann@20485
   303
and bit_const = Const ("Numeral.Bit", [intT, bitT] ---> intT);
paulson@8768
   304
haftmann@20485
   305
fun number_of_const T = Const ("Numeral.number_of", intT --> T);
paulson@8739
   306
wenzelm@16971
   307
fun int_of [] = 0
paulson@15965
   308
  | int_of (b :: bs) = IntInf.fromInt b + (2 * int_of bs);
obua@15595
   309
paulson@15620
   310
(*When called from a print translation, the Numeral qualifier will probably have
haftmann@20485
   311
  been removed from Bit, bit.B0, etc.*)
paulson@15620
   312
fun dest_bit (Const ("Numeral.bit.B0", _)) = 0
paulson@15620
   313
  | dest_bit (Const ("Numeral.bit.B1", _)) = 1
paulson@15620
   314
  | dest_bit (Const ("bit.B0", _)) = 0
paulson@15620
   315
  | dest_bit (Const ("bit.B1", _)) = 1
nipkow@7548
   316
  | dest_bit t = raise TERM("dest_bit", [t]);
nipkow@7548
   317
paulson@15013
   318
fun bin_of (Const ("Numeral.Pls", _)) = []
paulson@15013
   319
  | bin_of (Const ("Numeral.Min", _)) = [~1]
paulson@15013
   320
  | bin_of (Const ("Numeral.Bit", _) $ bs $ b) = dest_bit b :: bin_of bs
paulson@15620
   321
  | bin_of (Const ("Bit", _) $ bs $ b) = dest_bit b :: bin_of bs
nipkow@7548
   322
  | bin_of t = raise TERM("bin_of", [t]);
nipkow@7548
   323
nipkow@7548
   324
val dest_binum = int_of o bin_of;
nipkow@7548
   325
paulson@15620
   326
fun mk_bit 0 = B0_const
paulson@15620
   327
  | mk_bit 1 = B1_const
nipkow@10693
   328
  | mk_bit _ = sys_error "mk_bit";
nipkow@10693
   329
paulson@19481
   330
fun mk_binum n =
wenzelm@16971
   331
  let
wenzelm@16971
   332
    fun mk_bit n = if n = 0 then B0_const else B1_const;
wenzelm@16971
   333
    fun bin_of n =
wenzelm@16971
   334
      if n = 0 then pls_const
wenzelm@16971
   335
      else if n = ~1 then min_const
wenzelm@16971
   336
      else
wenzelm@16971
   337
        let
haftmann@20713
   338
          val (q,r) = IntInf.divMod (n, 2);
wenzelm@16971
   339
        in bit_const $ bin_of q $ mk_bit r end;
wenzelm@16971
   340
  in bin_of n end;
berghofe@13755
   341
haftmann@20713
   342
fun mk_int 0 = Const ("HOL.zero", intT)
haftmann@20713
   343
  | mk_int 1 = Const ("HOL.one", intT)
paulson@19481
   344
  | mk_int i = number_of_const intT $ mk_binum i;
berghofe@13755
   345
berghofe@13755
   346
berghofe@13755
   347
(* real *)
berghofe@13755
   348
wenzelm@16971
   349
val realT = Type ("RealDef.real", []);
berghofe@13755
   350
berghofe@13755
   351
berghofe@13755
   352
(* list *)
berghofe@13755
   353
nipkow@17083
   354
fun listT T =  Type ("List.list", [T])
nipkow@17083
   355
nipkow@17083
   356
fun mk_list f T [] = Const ("List.list.Nil", listT T)
berghofe@13755
   357
  | mk_list f T (x :: xs) = Const ("List.list.Cons",
nipkow@17083
   358
      T --> listT T --> listT T) $ f x $
berghofe@13755
   359
        mk_list f T xs;
berghofe@13755
   360
berghofe@15062
   361
fun dest_list (Const ("List.list.Nil", _)) = []
berghofe@15062
   362
  | dest_list (Const ("List.list.Cons", _) $ x $ xs) = x :: dest_list xs
berghofe@15062
   363
  | dest_list t = raise TERM ("dest_list", [t]);
berghofe@15062
   364
clasohm@923
   365
end;