src/HOL/hologic.ML
author wenzelm
Tue Jul 28 16:59:15 1998 +0200 (1998-07-28)
changeset 5207 dd4f51adfff3
parent 5096 84b00be693b4
child 6031 d9fa148383e2
permissions -rw-r--r--
tuned;
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
clasohm@923
    12
  val termTVar: typ
clasohm@923
    13
  val boolT: typ
clasohm@923
    14
  val mk_setT: typ -> typ
clasohm@923
    15
  val dest_setT: typ -> typ
clasohm@923
    16
  val mk_Trueprop: term -> term
clasohm@923
    17
  val dest_Trueprop: term -> term
clasohm@923
    18
  val conj: term
clasohm@923
    19
  val disj: term
clasohm@923
    20
  val imp: term
wenzelm@4571
    21
  val dest_imp: term -> term * term
clasohm@923
    22
  val eq_const: typ -> term
clasohm@923
    23
  val all_const: typ -> term
clasohm@923
    24
  val exists_const: typ -> term
clasohm@923
    25
  val Collect_const: typ -> term
clasohm@923
    26
  val mk_eq: term * term -> term
clasohm@923
    27
  val mk_all: string * typ * term -> term
clasohm@923
    28
  val mk_exists: string * typ * term -> term
clasohm@923
    29
  val mk_Collect: string * typ * term -> term
clasohm@923
    30
  val mk_mem: term * term -> term
wenzelm@2510
    31
  val mk_binop: string -> term * term -> term
wenzelm@2510
    32
  val mk_binrel: string -> term * term -> term
wenzelm@2510
    33
  val dest_bin: string -> typ -> term -> term * term
wenzelm@4571
    34
  val unitT: typ
wenzelm@4571
    35
  val unit: term
wenzelm@4571
    36
  val is_unit: term -> bool
wenzelm@4571
    37
  val mk_prodT: typ * typ -> typ
wenzelm@4571
    38
  val dest_prodT: typ -> typ * typ
wenzelm@4571
    39
  val mk_prod: term * term -> term
wenzelm@4571
    40
  val dest_prod: term -> term * term
wenzelm@4571
    41
  val mk_fst: term -> term
wenzelm@4571
    42
  val mk_snd: term -> term
berghofe@5096
    43
  val prodT_factors: typ -> typ list
berghofe@5096
    44
  val split_const: typ * typ * typ -> term
berghofe@5096
    45
  val mk_tuple: typ -> term list -> term
wenzelm@5207
    46
  val natT: typ
wenzelm@5207
    47
  val zero: term
wenzelm@5207
    48
  val is_zero: term -> bool
wenzelm@5207
    49
  val mk_Suc: term -> term
wenzelm@5207
    50
  val dest_Suc: term -> term
wenzelm@5207
    51
  val mk_nat: int -> term
wenzelm@5207
    52
  val dest_nat: term -> int
clasohm@923
    53
end;
clasohm@923
    54
wenzelm@2510
    55
clasohm@923
    56
structure HOLogic: HOLOGIC =
clasohm@923
    57
struct
clasohm@923
    58
wenzelm@2510
    59
(* basics *)
clasohm@923
    60
clasohm@923
    61
val termC: class = "term";
clasohm@923
    62
val termS: sort = [termC];
clasohm@923
    63
wenzelm@2510
    64
val termTVar = TVar (("'a", 0), termS);
clasohm@923
    65
clasohm@923
    66
wenzelm@2510
    67
(* bool and set *)
clasohm@923
    68
clasohm@923
    69
val boolT = Type ("bool", []);
clasohm@923
    70
clasohm@923
    71
fun mk_setT T = Type ("set", [T]);
clasohm@923
    72
clasohm@923
    73
fun dest_setT (Type ("set", [T])) = T
wenzelm@3794
    74
  | dest_setT T = raise TYPE ("dest_setT: set type expected", [T], []);
clasohm@923
    75
clasohm@923
    76
clasohm@923
    77
val Trueprop = Const ("Trueprop", boolT --> propT);
clasohm@923
    78
clasohm@923
    79
fun mk_Trueprop P = Trueprop $ P;
clasohm@923
    80
clasohm@923
    81
fun dest_Trueprop (Const ("Trueprop", _) $ P) = P
wenzelm@3794
    82
  | dest_Trueprop t = raise TERM ("dest_Trueprop", [t]);
clasohm@923
    83
clasohm@923
    84
clasohm@923
    85
val conj = Const ("op &", [boolT, boolT] ---> boolT)
clasohm@923
    86
and disj = Const ("op |", [boolT, boolT] ---> boolT)
clasohm@923
    87
and imp = Const ("op -->", [boolT, boolT] ---> boolT);
clasohm@923
    88
paulson@4466
    89
fun dest_imp (Const("op -->",_) $ A $ B) = (A, B)
paulson@4466
    90
  | dest_imp  t = raise TERM ("dest_imp", [t]);
paulson@4466
    91
clasohm@923
    92
fun eq_const T = Const ("op =", [T, T] ---> boolT);
clasohm@923
    93
fun mk_eq (t, u) = eq_const (fastype_of t) $ t $ u;
clasohm@923
    94
clasohm@923
    95
fun all_const T = Const ("All", [T --> boolT] ---> boolT);
clasohm@923
    96
fun mk_all (x, T, P) = all_const T $ absfree (x, T, P);
clasohm@923
    97
clasohm@923
    98
fun exists_const T = Const ("Ex", [T --> boolT] ---> boolT);
clasohm@923
    99
fun mk_exists (x, T, P) = exists_const T $ absfree (x, T, P);
clasohm@923
   100
clasohm@923
   101
fun Collect_const T = Const ("Collect", [T --> boolT] ---> mk_setT T);
clasohm@923
   102
fun mk_Collect (a, T, t) = Collect_const T $ absfree (a, T, t);
clasohm@923
   103
clasohm@923
   104
fun mk_mem (x, A) =
clasohm@923
   105
  let val setT = fastype_of A in
clasohm@923
   106
    Const ("op :", [dest_setT setT, setT] ---> boolT) $ x $ A
clasohm@923
   107
  end;
clasohm@923
   108
clasohm@923
   109
wenzelm@2510
   110
(* binary oprations and relations *)
wenzelm@2510
   111
wenzelm@2510
   112
fun mk_binop c (t, u) =
wenzelm@2510
   113
  let val T = fastype_of t in
wenzelm@2510
   114
    Const (c, [T, T] ---> T) $ t $ u
wenzelm@2510
   115
  end;
wenzelm@2510
   116
wenzelm@2510
   117
fun mk_binrel c (t, u) =
wenzelm@2510
   118
  let val T = fastype_of t in
wenzelm@2510
   119
    Const (c, [T, T] ---> boolT) $ t $ u
wenzelm@2510
   120
  end;
wenzelm@2510
   121
wenzelm@2510
   122
fun dest_bin c T (tm as Const (c', Type ("fun", [T', _])) $ t $ u) =
wenzelm@2510
   123
      if c = c' andalso T = T' then (t, u)
wenzelm@3794
   124
      else raise TERM ("dest_bin " ^ c, [tm])
wenzelm@3794
   125
  | dest_bin c _ tm = raise TERM ("dest_bin " ^ c, [tm]);
wenzelm@2510
   126
wenzelm@2510
   127
wenzelm@4571
   128
(* unit *)
wenzelm@4571
   129
wenzelm@4571
   130
val unitT = Type ("unit", []);
wenzelm@4571
   131
wenzelm@4571
   132
val unit = Const ("()", unitT);
wenzelm@4571
   133
wenzelm@4571
   134
fun is_unit (Const ("()", _)) = true
wenzelm@4571
   135
  | is_unit _ = false;
wenzelm@4571
   136
wenzelm@4571
   137
wenzelm@4571
   138
(* prod *)
wenzelm@4571
   139
wenzelm@4571
   140
fun mk_prodT (T1, T2) = Type ("*", [T1, T2]);
wenzelm@4571
   141
wenzelm@4571
   142
fun dest_prodT (Type ("*", [T1, T2])) = (T1, T2)
wenzelm@4571
   143
  | dest_prodT T = raise TYPE ("dest_prodT", [T], []);
wenzelm@4571
   144
wenzelm@4571
   145
fun mk_prod (t1, t2) =
wenzelm@4571
   146
  let val T1 = fastype_of t1 and T2 = fastype_of t2 in
wenzelm@4571
   147
    Const ("Pair", [T1, T2] ---> mk_prodT (T1, T2)) $ t1 $ t2
wenzelm@4571
   148
  end;
wenzelm@4571
   149
wenzelm@4571
   150
fun dest_prod (Const ("Pair", _) $ t1 $ t2) = (t1, t2)
wenzelm@4571
   151
  | dest_prod t = raise TERM ("dest_prod", [t]);
wenzelm@4571
   152
wenzelm@4571
   153
fun mk_fst p =
wenzelm@4571
   154
  let val pT = fastype_of p in
wenzelm@4571
   155
    Const ("fst", pT --> fst (dest_prodT pT)) $ p
wenzelm@4571
   156
  end;
wenzelm@4571
   157
wenzelm@4571
   158
fun mk_snd p =
wenzelm@4571
   159
  let val pT = fastype_of p in
wenzelm@4571
   160
    Const ("snd", pT --> snd (dest_prodT pT)) $ p
wenzelm@4571
   161
  end;
wenzelm@4571
   162
berghofe@5096
   163
(*Maps the type T1 * ... * Tn to [T1, ..., Tn], however nested*)
berghofe@5096
   164
fun prodT_factors (Type ("*", [T1, T2])) = prodT_factors T1 @ prodT_factors T2
berghofe@5096
   165
  | prodT_factors T = [T];
berghofe@5096
   166
berghofe@5096
   167
fun split_const (Ta, Tb, Tc) = 
berghofe@5096
   168
    Const ("split", [[Ta, Tb] ---> Tc, mk_prodT (Ta, Tb)] ---> Tc);
berghofe@5096
   169
berghofe@5096
   170
(*Makes a nested tuple from a list, following the product type structure*)
berghofe@5096
   171
fun mk_tuple (Type ("*", [T1, T2])) tms = 
berghofe@5096
   172
        mk_prod (mk_tuple T1 tms, 
berghofe@5096
   173
                 mk_tuple T2 (drop (length (prodT_factors T1), tms)))
berghofe@5096
   174
  | mk_tuple T (t::_) = t;
wenzelm@4571
   175
wenzelm@5207
   176
wenzelm@5207
   177
wenzelm@5207
   178
(* nat *)
wenzelm@5207
   179
wenzelm@5207
   180
val natT = Type ("nat", []);
wenzelm@5207
   181
wenzelm@5207
   182
val zero = Const ("0", natT);
wenzelm@5207
   183
wenzelm@5207
   184
fun is_zero (Const ("0", _)) = true
wenzelm@5207
   185
  | is_zero _ = false;
wenzelm@5207
   186
wenzelm@5207
   187
fun mk_Suc t = Const ("Suc", natT --> natT) $ t;
wenzelm@5207
   188
wenzelm@5207
   189
fun dest_Suc (Const ("Suc", _) $ t) = t
wenzelm@5207
   190
  | dest_Suc t = raise TERM ("dest_Suc", [t]);
wenzelm@5207
   191
wenzelm@5207
   192
fun mk_nat 0 = zero
wenzelm@5207
   193
  | mk_nat n = mk_Suc (mk_nat (n - 1));
wenzelm@5207
   194
wenzelm@5207
   195
fun dest_nat (Const ("0", _)) = 0
wenzelm@5207
   196
  | dest_nat (Const ("Suc", _) $ t) = dest_nat t + 1
wenzelm@5207
   197
  | dest_nat t = raise TERM ("dest_nat", [t]);
wenzelm@5207
   198
wenzelm@5207
   199
clasohm@923
   200
end;