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