src/HOL/hologic.ML
author wenzelm
Mon Mar 13 13:17:52 2000 +0100 (2000-03-13)
changeset 8429 515fa7533354
parent 8302 da404f79c1fc
child 8739 60a1ed9e3c34
permissions -rw-r--r--
added Not;
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
clasohm@923
    10
  val termC: class
clasohm@923
    11
  val termS: sort
wenzelm@8100
    12
  val termT: typ
wenzelm@8275
    13
  val boolN: string
clasohm@923
    14
  val boolT: typ
paulson@7073
    15
  val false_const: term
paulson@7073
    16
  val true_const: term
clasohm@923
    17
  val mk_setT: typ -> typ
clasohm@923
    18
  val dest_setT: typ -> typ
clasohm@923
    19
  val mk_Trueprop: term -> term
clasohm@923
    20
  val dest_Trueprop: term -> term
clasohm@923
    21
  val conj: term
clasohm@923
    22
  val disj: term
clasohm@923
    23
  val imp: term
wenzelm@8429
    24
  val Not: term
wenzelm@7690
    25
  val mk_conj: term * term -> term
wenzelm@7690
    26
  val mk_disj: term * term -> term
wenzelm@7690
    27
  val mk_imp: term * term -> term
wenzelm@4571
    28
  val dest_imp: term -> term * term
wenzelm@8302
    29
  val dest_conj: term -> term list
clasohm@923
    30
  val eq_const: typ -> term
clasohm@923
    31
  val all_const: typ -> term
clasohm@923
    32
  val exists_const: typ -> term
clasohm@923
    33
  val Collect_const: typ -> term
clasohm@923
    34
  val mk_eq: term * term -> term
paulson@6031
    35
  val dest_eq: term -> term * term
clasohm@923
    36
  val mk_all: string * typ * term -> term
clasohm@923
    37
  val mk_exists: string * typ * term -> term
clasohm@923
    38
  val mk_Collect: string * typ * term -> term
clasohm@923
    39
  val mk_mem: term * term -> term
wenzelm@6380
    40
  val dest_mem: term -> term * term
wenzelm@2510
    41
  val mk_binop: string -> term * term -> term
wenzelm@2510
    42
  val mk_binrel: string -> term * term -> term
wenzelm@2510
    43
  val dest_bin: string -> typ -> term -> term * term
wenzelm@4571
    44
  val unitT: typ
wenzelm@4571
    45
  val unit: term
wenzelm@4571
    46
  val is_unit: term -> bool
wenzelm@4571
    47
  val mk_prodT: typ * typ -> typ
wenzelm@4571
    48
  val dest_prodT: typ -> typ * typ
wenzelm@4571
    49
  val mk_prod: term * term -> term
wenzelm@4571
    50
  val dest_prod: term -> term * term
wenzelm@4571
    51
  val mk_fst: term -> term
wenzelm@4571
    52
  val mk_snd: term -> term
berghofe@5096
    53
  val prodT_factors: typ -> typ list
berghofe@5096
    54
  val split_const: typ * typ * typ -> term
berghofe@5096
    55
  val mk_tuple: typ -> term list -> term
wenzelm@5207
    56
  val natT: typ
wenzelm@5207
    57
  val zero: term
wenzelm@5207
    58
  val is_zero: term -> bool
wenzelm@5207
    59
  val mk_Suc: term -> term
wenzelm@5207
    60
  val dest_Suc: term -> term
wenzelm@5207
    61
  val mk_nat: int -> term
wenzelm@5207
    62
  val dest_nat: term -> int
paulson@7073
    63
  val intT: typ
paulson@7163
    64
  val realT: typ
paulson@7073
    65
  val binT: typ
paulson@7073
    66
  val pls_const: term
paulson@7073
    67
  val min_const: term
paulson@7073
    68
  val bit_const: term
nipkow@7548
    69
  val int_of: int list -> int
nipkow@7548
    70
  val dest_binum: term -> int
clasohm@923
    71
end;
clasohm@923
    72
wenzelm@2510
    73
clasohm@923
    74
structure HOLogic: HOLOGIC =
clasohm@923
    75
struct
clasohm@923
    76
wenzelm@2510
    77
(* basics *)
clasohm@923
    78
clasohm@923
    79
val termC: class = "term";
clasohm@923
    80
val termS: sort = [termC];
wenzelm@8100
    81
val termT = TypeInfer.anyT termS;
clasohm@923
    82
clasohm@923
    83
wenzelm@2510
    84
(* bool and set *)
clasohm@923
    85
wenzelm@8275
    86
val boolN = "bool";
wenzelm@8275
    87
val boolT = Type (boolN, []);
clasohm@923
    88
paulson@7073
    89
val true_const =  Const ("True", boolT)
paulson@7073
    90
and false_const = Const ("False", boolT);
paulson@7073
    91
clasohm@923
    92
fun mk_setT T = Type ("set", [T]);
clasohm@923
    93
clasohm@923
    94
fun dest_setT (Type ("set", [T])) = T
wenzelm@3794
    95
  | dest_setT T = raise TYPE ("dest_setT: set type expected", [T], []);
clasohm@923
    96
wenzelm@8275
    97
paulson@7073
    98
(* logic *)
clasohm@923
    99
clasohm@923
   100
val Trueprop = Const ("Trueprop", boolT --> propT);
clasohm@923
   101
clasohm@923
   102
fun mk_Trueprop P = Trueprop $ P;
clasohm@923
   103
clasohm@923
   104
fun dest_Trueprop (Const ("Trueprop", _) $ P) = P
wenzelm@3794
   105
  | dest_Trueprop t = raise TERM ("dest_Trueprop", [t]);
clasohm@923
   106
clasohm@923
   107
clasohm@923
   108
val conj = Const ("op &", [boolT, boolT] ---> boolT)
clasohm@923
   109
and disj = Const ("op |", [boolT, boolT] ---> boolT)
wenzelm@8429
   110
and imp = Const ("op -->", [boolT, boolT] ---> boolT)
wenzelm@8429
   111
and Not = Const ("Not", boolT --> boolT);
clasohm@923
   112
wenzelm@7690
   113
fun mk_conj (t1, t2) = conj $ t1 $ t2
wenzelm@7690
   114
and mk_disj (t1, t2) = disj $ t1 $ t2
wenzelm@7690
   115
and mk_imp (t1, t2) = imp $ t1 $ t2;
wenzelm@7690
   116
paulson@4466
   117
fun dest_imp (Const("op -->",_) $ A $ B) = (A, B)
paulson@4466
   118
  | dest_imp  t = raise TERM ("dest_imp", [t]);
paulson@4466
   119
wenzelm@8302
   120
fun dest_conj (Const ("op &", _) $ t $ t') = t :: dest_conj t'
wenzelm@8302
   121
  | dest_conj t = [t];
wenzelm@8302
   122
clasohm@923
   123
fun eq_const T = Const ("op =", [T, T] ---> boolT);
clasohm@923
   124
fun mk_eq (t, u) = eq_const (fastype_of t) $ t $ u;
clasohm@923
   125
paulson@6031
   126
fun dest_eq (Const ("op =", _) $ lhs $ rhs) = (lhs, rhs)
paulson@6031
   127
  | dest_eq t = raise TERM ("dest_eq", [t])
paulson@6031
   128
clasohm@923
   129
fun all_const T = Const ("All", [T --> boolT] ---> boolT);
clasohm@923
   130
fun mk_all (x, T, P) = all_const T $ absfree (x, T, P);
clasohm@923
   131
clasohm@923
   132
fun exists_const T = Const ("Ex", [T --> boolT] ---> boolT);
clasohm@923
   133
fun mk_exists (x, T, P) = exists_const T $ absfree (x, T, P);
clasohm@923
   134
clasohm@923
   135
fun Collect_const T = Const ("Collect", [T --> boolT] ---> mk_setT T);
clasohm@923
   136
fun mk_Collect (a, T, t) = Collect_const T $ absfree (a, T, t);
clasohm@923
   137
clasohm@923
   138
fun mk_mem (x, A) =
clasohm@923
   139
  let val setT = fastype_of A in
clasohm@923
   140
    Const ("op :", [dest_setT setT, setT] ---> boolT) $ x $ A
clasohm@923
   141
  end;
clasohm@923
   142
wenzelm@6380
   143
fun dest_mem (Const ("op :", _) $ x $ A) = (x, A)
wenzelm@6380
   144
  | dest_mem t = raise TERM ("dest_mem", [t]);
wenzelm@6380
   145
clasohm@923
   146
wenzelm@2510
   147
(* binary oprations and relations *)
wenzelm@2510
   148
wenzelm@2510
   149
fun mk_binop c (t, u) =
wenzelm@2510
   150
  let val T = fastype_of t in
wenzelm@2510
   151
    Const (c, [T, T] ---> T) $ t $ u
wenzelm@2510
   152
  end;
wenzelm@2510
   153
wenzelm@2510
   154
fun mk_binrel c (t, u) =
wenzelm@2510
   155
  let val T = fastype_of t in
wenzelm@2510
   156
    Const (c, [T, T] ---> boolT) $ t $ u
wenzelm@2510
   157
  end;
wenzelm@2510
   158
wenzelm@2510
   159
fun dest_bin c T (tm as Const (c', Type ("fun", [T', _])) $ t $ u) =
wenzelm@2510
   160
      if c = c' andalso T = T' then (t, u)
wenzelm@3794
   161
      else raise TERM ("dest_bin " ^ c, [tm])
wenzelm@3794
   162
  | dest_bin c _ tm = raise TERM ("dest_bin " ^ c, [tm]);
wenzelm@2510
   163
wenzelm@2510
   164
wenzelm@4571
   165
(* unit *)
wenzelm@4571
   166
wenzelm@4571
   167
val unitT = Type ("unit", []);
wenzelm@4571
   168
wenzelm@4571
   169
val unit = Const ("()", unitT);
wenzelm@4571
   170
wenzelm@4571
   171
fun is_unit (Const ("()", _)) = true
wenzelm@4571
   172
  | is_unit _ = false;
wenzelm@4571
   173
wenzelm@4571
   174
wenzelm@4571
   175
(* prod *)
wenzelm@4571
   176
wenzelm@4571
   177
fun mk_prodT (T1, T2) = Type ("*", [T1, T2]);
wenzelm@4571
   178
wenzelm@4571
   179
fun dest_prodT (Type ("*", [T1, T2])) = (T1, T2)
wenzelm@4571
   180
  | dest_prodT T = raise TYPE ("dest_prodT", [T], []);
wenzelm@4571
   181
wenzelm@4571
   182
fun mk_prod (t1, t2) =
wenzelm@4571
   183
  let val T1 = fastype_of t1 and T2 = fastype_of t2 in
wenzelm@4571
   184
    Const ("Pair", [T1, T2] ---> mk_prodT (T1, T2)) $ t1 $ t2
wenzelm@4571
   185
  end;
wenzelm@4571
   186
wenzelm@4571
   187
fun dest_prod (Const ("Pair", _) $ t1 $ t2) = (t1, t2)
wenzelm@4571
   188
  | dest_prod t = raise TERM ("dest_prod", [t]);
wenzelm@4571
   189
wenzelm@4571
   190
fun mk_fst p =
wenzelm@4571
   191
  let val pT = fastype_of p in
wenzelm@4571
   192
    Const ("fst", pT --> fst (dest_prodT pT)) $ p
wenzelm@4571
   193
  end;
wenzelm@4571
   194
wenzelm@4571
   195
fun mk_snd p =
wenzelm@4571
   196
  let val pT = fastype_of p in
wenzelm@4571
   197
    Const ("snd", pT --> snd (dest_prodT pT)) $ p
wenzelm@4571
   198
  end;
wenzelm@4571
   199
berghofe@5096
   200
(*Maps the type T1 * ... * Tn to [T1, ..., Tn], however nested*)
berghofe@5096
   201
fun prodT_factors (Type ("*", [T1, T2])) = prodT_factors T1 @ prodT_factors T2
berghofe@5096
   202
  | prodT_factors T = [T];
berghofe@5096
   203
berghofe@5096
   204
fun split_const (Ta, Tb, Tc) = 
berghofe@5096
   205
    Const ("split", [[Ta, Tb] ---> Tc, mk_prodT (Ta, Tb)] ---> Tc);
berghofe@5096
   206
berghofe@5096
   207
(*Makes a nested tuple from a list, following the product type structure*)
berghofe@5096
   208
fun mk_tuple (Type ("*", [T1, T2])) tms = 
berghofe@5096
   209
        mk_prod (mk_tuple T1 tms, 
berghofe@5096
   210
                 mk_tuple T2 (drop (length (prodT_factors T1), tms)))
berghofe@5096
   211
  | mk_tuple T (t::_) = t;
wenzelm@4571
   212
wenzelm@5207
   213
wenzelm@5207
   214
wenzelm@5207
   215
(* nat *)
wenzelm@5207
   216
wenzelm@5207
   217
val natT = Type ("nat", []);
wenzelm@5207
   218
wenzelm@5207
   219
val zero = Const ("0", natT);
wenzelm@5207
   220
wenzelm@5207
   221
fun is_zero (Const ("0", _)) = true
wenzelm@5207
   222
  | is_zero _ = false;
wenzelm@5207
   223
wenzelm@5207
   224
fun mk_Suc t = Const ("Suc", natT --> natT) $ t;
wenzelm@5207
   225
wenzelm@5207
   226
fun dest_Suc (Const ("Suc", _) $ t) = t
wenzelm@5207
   227
  | dest_Suc t = raise TERM ("dest_Suc", [t]);
wenzelm@5207
   228
wenzelm@5207
   229
fun mk_nat 0 = zero
wenzelm@5207
   230
  | mk_nat n = mk_Suc (mk_nat (n - 1));
wenzelm@5207
   231
wenzelm@5207
   232
fun dest_nat (Const ("0", _)) = 0
wenzelm@5207
   233
  | dest_nat (Const ("Suc", _) $ t) = dest_nat t + 1
wenzelm@5207
   234
  | dest_nat t = raise TERM ("dest_nat", [t]);
wenzelm@5207
   235
wenzelm@5207
   236
paulson@7073
   237
val intT = Type ("IntDef.int", []);
paulson@7073
   238
paulson@7163
   239
val realT = Type("RealDef.real",[]);
paulson@7163
   240
paulson@7073
   241
paulson@7073
   242
(* binary numerals *)
paulson@7073
   243
paulson@7073
   244
val binT = Type ("Numeral.bin", []);
paulson@7073
   245
paulson@7073
   246
val pls_const =  Const ("Numeral.bin.Pls", binT)
paulson@7073
   247
and min_const = Const ("Numeral.bin.Min", binT)
paulson@7073
   248
and bit_const = Const ("Numeral.bin.Bit", [binT, boolT] ---> binT);
paulson@7073
   249
nipkow@7548
   250
fun int_of [] = 0
nipkow@7548
   251
  | int_of (b :: bs) = b + 2 * int_of bs;
nipkow@7548
   252
nipkow@7548
   253
fun dest_bit (Const ("False", _)) = 0
nipkow@7548
   254
  | dest_bit (Const ("True", _)) = 1
nipkow@7548
   255
  | dest_bit t = raise TERM("dest_bit", [t]);
nipkow@7548
   256
nipkow@7548
   257
fun bin_of (Const ("Numeral.bin.Pls", _)) = []
nipkow@7548
   258
  | bin_of (Const ("Numeral.bin.Min", _)) = [~1]
nipkow@7548
   259
  | bin_of (Const ("Numeral.bin.Bit", _) $ bs $ b) = dest_bit b :: bin_of bs
nipkow@7548
   260
  | bin_of t = raise TERM("bin_of", [t]);
nipkow@7548
   261
nipkow@7548
   262
val dest_binum = int_of o bin_of;
nipkow@7548
   263
clasohm@923
   264
end;