src/HOL/hologic.ML
author haftmann
Mon Aug 14 13:46:06 2006 +0200 (2006-08-14)
changeset 20380 14f9f2a1caa6
parent 19481 a6205c6203ea
child 20485 3078fd2eec7b
permissions -rw-r--r--
simplified code generator setup
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
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@16835
    28
  val mk_not: 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
wenzelm@18285
    62
  val mk_split: term -> term
berghofe@5096
    63
  val prodT_factors: typ -> typ list
berghofe@5096
    64
  val split_const: typ * typ * typ -> term
berghofe@5096
    65
  val mk_tuple: typ -> term list -> term
wenzelm@5207
    66
  val natT: typ
wenzelm@5207
    67
  val zero: term
wenzelm@5207
    68
  val is_zero: term -> bool
wenzelm@5207
    69
  val mk_Suc: term -> term
wenzelm@5207
    70
  val dest_Suc: term -> term
wenzelm@5207
    71
  val mk_nat: int -> term
wenzelm@5207
    72
  val dest_nat: term -> int
paulson@7073
    73
  val intT: typ
paulson@15965
    74
  val mk_int: IntInf.int -> term
paulson@7163
    75
  val realT: typ
paulson@15620
    76
  val bitT: typ
paulson@15620
    77
  val B0_const: term
paulson@15620
    78
  val B1_const: term
paulson@7073
    79
  val binT: typ
paulson@7073
    80
  val pls_const: term
paulson@7073
    81
  val min_const: term
paulson@7073
    82
  val bit_const: term
paulson@8768
    83
  val number_of_const: typ -> term
wenzelm@16971
    84
  val int_of: int list -> IntInf.int
paulson@15965
    85
  val dest_binum: term -> IntInf.int
paulson@19481
    86
  val mk_binum: IntInf.int -> term
paulson@15620
    87
  val bin_of : term -> int list
nipkow@17083
    88
  val listT : typ -> typ
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
clasohm@923
   102
wenzelm@2510
   103
(* bool and set *)
clasohm@923
   104
wenzelm@8275
   105
val boolN = "bool";
wenzelm@8275
   106
val boolT = Type (boolN, []);
clasohm@923
   107
wenzelm@9856
   108
val true_const =  Const ("True", boolT);
wenzelm@9856
   109
val false_const = Const ("False", boolT);
paulson@7073
   110
clasohm@923
   111
fun mk_setT T = Type ("set", [T]);
clasohm@923
   112
clasohm@923
   113
fun dest_setT (Type ("set", [T])) = T
wenzelm@3794
   114
  | dest_setT T = raise TYPE ("dest_setT: set type expected", [T], []);
clasohm@923
   115
wenzelm@8275
   116
paulson@7073
   117
(* logic *)
clasohm@923
   118
clasohm@923
   119
val Trueprop = Const ("Trueprop", boolT --> propT);
clasohm@923
   120
clasohm@923
   121
fun mk_Trueprop P = Trueprop $ P;
clasohm@923
   122
clasohm@923
   123
fun dest_Trueprop (Const ("Trueprop", _) $ P) = P
wenzelm@3794
   124
  | dest_Trueprop t = raise TERM ("dest_Trueprop", [t]);
clasohm@923
   125
clasohm@923
   126
clasohm@923
   127
val conj = Const ("op &", [boolT, boolT] ---> boolT)
clasohm@923
   128
and disj = Const ("op |", [boolT, boolT] ---> boolT)
wenzelm@8429
   129
and imp = Const ("op -->", [boolT, boolT] ---> boolT)
wenzelm@8429
   130
and Not = Const ("Not", boolT --> boolT);
clasohm@923
   131
wenzelm@7690
   132
fun mk_conj (t1, t2) = conj $ t1 $ t2
wenzelm@7690
   133
and mk_disj (t1, t2) = disj $ t1 $ t2
wenzelm@16835
   134
and mk_imp (t1, t2) = imp $ t1 $ t2
wenzelm@16835
   135
and mk_not t = Not $ t;
wenzelm@7690
   136
paulson@15151
   137
fun dest_conj (Const ("op &", _) $ t $ t') = t :: dest_conj t'
paulson@15151
   138
  | dest_conj t = [t];
paulson@15151
   139
paulson@15945
   140
fun dest_disj (Const ("op |", _) $ t $ t') = t :: dest_disj t'
paulson@15945
   141
  | dest_disj t = [t];
paulson@15945
   142
paulson@4466
   143
fun dest_imp (Const("op -->",_) $ A $ B) = (A, B)
paulson@4466
   144
  | dest_imp  t = raise TERM ("dest_imp", [t]);
paulson@4466
   145
paulson@15151
   146
fun dest_not (Const ("Not", _) $ t) = t
paulson@15151
   147
  | dest_not t = raise TERM ("dest_not", [t]);
wenzelm@8302
   148
wenzelm@11683
   149
fun imp_concl_of t = imp_concl_of (#2 (dest_imp t)) handle TERM _ => t;
wenzelm@11683
   150
val dest_concls = map imp_concl_of o dest_conj o dest_Trueprop;
wenzelm@11683
   151
clasohm@923
   152
fun eq_const T = Const ("op =", [T, T] ---> boolT);
clasohm@923
   153
fun mk_eq (t, u) = eq_const (fastype_of t) $ t $ u;
clasohm@923
   154
paulson@6031
   155
fun dest_eq (Const ("op =", _) $ lhs $ rhs) = (lhs, rhs)
paulson@6031
   156
  | dest_eq t = raise TERM ("dest_eq", [t])
paulson@6031
   157
clasohm@923
   158
fun all_const T = Const ("All", [T --> boolT] ---> boolT);
clasohm@923
   159
fun mk_all (x, T, P) = all_const T $ absfree (x, T, P);
skalberg@15574
   160
fun list_all (vs,x) = foldr (fn ((x, T), P) => all_const T $ Abs (x, T, P)) x vs;
clasohm@923
   161
clasohm@923
   162
fun exists_const T = Const ("Ex", [T --> boolT] ---> boolT);
clasohm@923
   163
fun mk_exists (x, T, P) = exists_const T $ absfree (x, T, P);
clasohm@923
   164
paulson@15945
   165
fun choice_const T = Const("Hilbert_Choice.Eps", (T --> boolT) --> T)
paulson@15945
   166
clasohm@923
   167
fun Collect_const T = Const ("Collect", [T --> boolT] ---> mk_setT T);
clasohm@923
   168
fun mk_Collect (a, T, t) = Collect_const T $ absfree (a, T, t);
clasohm@923
   169
clasohm@923
   170
fun mk_mem (x, A) =
clasohm@923
   171
  let val setT = fastype_of A in
clasohm@923
   172
    Const ("op :", [dest_setT setT, setT] ---> boolT) $ x $ A
clasohm@923
   173
  end;
clasohm@923
   174
wenzelm@6380
   175
fun dest_mem (Const ("op :", _) $ x $ A) = (x, A)
wenzelm@6380
   176
  | dest_mem t = raise TERM ("dest_mem", [t]);
wenzelm@6380
   177
wenzelm@11818
   178
fun mk_UNIV T = Const ("UNIV", mk_setT T);
wenzelm@11818
   179
clasohm@923
   180
ballarin@13743
   181
(* binary operations and relations *)
wenzelm@2510
   182
wenzelm@2510
   183
fun mk_binop c (t, u) =
wenzelm@2510
   184
  let val T = fastype_of t in
wenzelm@2510
   185
    Const (c, [T, T] ---> T) $ t $ u
wenzelm@2510
   186
  end;
wenzelm@2510
   187
wenzelm@2510
   188
fun mk_binrel c (t, u) =
wenzelm@2510
   189
  let val T = fastype_of t in
wenzelm@2510
   190
    Const (c, [T, T] ---> boolT) $ t $ u
wenzelm@2510
   191
  end;
wenzelm@2510
   192
paulson@14387
   193
(*destruct the application of a binary operator. The dummyT case is a crude
paulson@14387
   194
  way of handling polymorphic operators.*)
wenzelm@2510
   195
fun dest_bin c T (tm as Const (c', Type ("fun", [T', _])) $ t $ u) =
paulson@14387
   196
      if c = c' andalso (T=T' orelse T=dummyT) then (t, u)
wenzelm@3794
   197
      else raise TERM ("dest_bin " ^ c, [tm])
wenzelm@3794
   198
  | dest_bin c _ tm = raise TERM ("dest_bin " ^ c, [tm]);
wenzelm@2510
   199
wenzelm@2510
   200
wenzelm@4571
   201
(* unit *)
wenzelm@4571
   202
wenzelm@11604
   203
val unitT = Type ("Product_Type.unit", []);
wenzelm@4571
   204
wenzelm@11604
   205
fun is_unitT (Type ("Product_Type.unit", [])) = true
wenzelm@9362
   206
  | is_unitT _ = false;
wenzelm@9362
   207
wenzelm@11604
   208
val unit = Const ("Product_Type.Unity", unitT);
wenzelm@4571
   209
wenzelm@11604
   210
fun is_unit (Const ("Product_Type.Unity", _)) = true
wenzelm@4571
   211
  | is_unit _ = false;
wenzelm@4571
   212
wenzelm@4571
   213
wenzelm@4571
   214
(* prod *)
wenzelm@4571
   215
wenzelm@4571
   216
fun mk_prodT (T1, T2) = Type ("*", [T1, T2]);
wenzelm@4571
   217
wenzelm@4571
   218
fun dest_prodT (Type ("*", [T1, T2])) = (T1, T2)
wenzelm@4571
   219
  | dest_prodT T = raise TYPE ("dest_prodT", [T], []);
wenzelm@4571
   220
berghofe@14048
   221
fun pair_const T1 T2 = Const ("Pair", [T1, T2] ---> mk_prodT (T1, T2));
berghofe@14048
   222
wenzelm@4571
   223
fun mk_prod (t1, t2) =
wenzelm@4571
   224
  let val T1 = fastype_of t1 and T2 = fastype_of t2 in
berghofe@14048
   225
    pair_const T1 T2 $ t1 $ t2
wenzelm@4571
   226
  end;
wenzelm@4571
   227
wenzelm@4571
   228
fun dest_prod (Const ("Pair", _) $ t1 $ t2) = (t1, t2)
wenzelm@4571
   229
  | dest_prod t = raise TERM ("dest_prod", [t]);
wenzelm@4571
   230
wenzelm@4571
   231
fun mk_fst p =
wenzelm@4571
   232
  let val pT = fastype_of p in
wenzelm@4571
   233
    Const ("fst", pT --> fst (dest_prodT pT)) $ p
wenzelm@4571
   234
  end;
wenzelm@4571
   235
wenzelm@4571
   236
fun mk_snd p =
wenzelm@4571
   237
  let val pT = fastype_of p in
wenzelm@4571
   238
    Const ("snd", pT --> snd (dest_prodT pT)) $ p
wenzelm@4571
   239
  end;
wenzelm@4571
   240
wenzelm@18285
   241
fun split_const (A, B, C) =
wenzelm@18285
   242
  Const ("split", (A --> B --> C) --> mk_prodT (A, B) --> C);
wenzelm@18285
   243
wenzelm@18285
   244
fun mk_split t =
wenzelm@18285
   245
  (case Term.fastype_of t of
wenzelm@18285
   246
    T as (Type ("fun", [A, Type ("fun", [B, C])])) =>
wenzelm@18285
   247
      Const ("split", T --> mk_prodT (A, B) --> C) $ t
wenzelm@18285
   248
  | _ => raise TERM ("mk_split: bad body type", [t]));
wenzelm@18285
   249
berghofe@5096
   250
(*Maps the type T1 * ... * Tn to [T1, ..., Tn], however nested*)
berghofe@5096
   251
fun prodT_factors (Type ("*", [T1, T2])) = prodT_factors T1 @ prodT_factors T2
berghofe@5096
   252
  | prodT_factors T = [T];
berghofe@5096
   253
berghofe@5096
   254
(*Makes a nested tuple from a list, following the product type structure*)
wenzelm@16971
   255
fun mk_tuple (Type ("*", [T1, T2])) tms =
wenzelm@16971
   256
        mk_prod (mk_tuple T1 tms,
skalberg@15570
   257
                 mk_tuple T2 (Library.drop (length (prodT_factors T1), tms)))
berghofe@5096
   258
  | mk_tuple T (t::_) = t;
wenzelm@4571
   259
wenzelm@5207
   260
wenzelm@5207
   261
(* nat *)
wenzelm@5207
   262
wenzelm@5207
   263
val natT = Type ("nat", []);
wenzelm@5207
   264
wenzelm@5207
   265
val zero = Const ("0", natT);
wenzelm@5207
   266
wenzelm@5207
   267
fun is_zero (Const ("0", _)) = true
wenzelm@5207
   268
  | is_zero _ = false;
wenzelm@5207
   269
wenzelm@5207
   270
fun mk_Suc t = Const ("Suc", natT --> natT) $ t;
wenzelm@5207
   271
wenzelm@5207
   272
fun dest_Suc (Const ("Suc", _) $ t) = t
wenzelm@5207
   273
  | dest_Suc t = raise TERM ("dest_Suc", [t]);
wenzelm@5207
   274
wenzelm@5207
   275
fun mk_nat 0 = zero
wenzelm@5207
   276
  | mk_nat n = mk_Suc (mk_nat (n - 1));
wenzelm@5207
   277
wenzelm@5207
   278
fun dest_nat (Const ("0", _)) = 0
wenzelm@5207
   279
  | dest_nat (Const ("Suc", _) $ t) = dest_nat t + 1
wenzelm@5207
   280
  | dest_nat t = raise TERM ("dest_nat", [t]);
wenzelm@5207
   281
wenzelm@5207
   282
paulson@7073
   283
(* binary numerals *)
paulson@7073
   284
paulson@7073
   285
val binT = Type ("Numeral.bin", []);
paulson@7073
   286
paulson@15620
   287
val bitT = Type ("Numeral.bit", []);
paulson@15620
   288
paulson@15620
   289
val B0_const = Const ("Numeral.bit.B0", bitT);
paulson@15620
   290
val B1_const =  Const ("Numeral.bit.B1", bitT);
paulson@15620
   291
paulson@15013
   292
val pls_const = Const ("Numeral.Pls", binT)
paulson@15013
   293
and min_const = Const ("Numeral.Min", binT)
paulson@15620
   294
and bit_const = Const ("Numeral.Bit", [binT, bitT] ---> binT);
paulson@8768
   295
paulson@8768
   296
fun number_of_const T = Const ("Numeral.number_of", binT --> T);
paulson@8739
   297
wenzelm@16971
   298
fun int_of [] = 0
paulson@15965
   299
  | int_of (b :: bs) = IntInf.fromInt b + (2 * int_of bs);
obua@15595
   300
paulson@15620
   301
(*When called from a print translation, the Numeral qualifier will probably have
paulson@15620
   302
  been removed from Bit, bin.B0, etc.*)
paulson@15620
   303
fun dest_bit (Const ("Numeral.bit.B0", _)) = 0
paulson@15620
   304
  | dest_bit (Const ("Numeral.bit.B1", _)) = 1
paulson@15620
   305
  | dest_bit (Const ("bit.B0", _)) = 0
paulson@15620
   306
  | dest_bit (Const ("bit.B1", _)) = 1
nipkow@7548
   307
  | dest_bit t = raise TERM("dest_bit", [t]);
nipkow@7548
   308
paulson@15013
   309
fun bin_of (Const ("Numeral.Pls", _)) = []
paulson@15013
   310
  | bin_of (Const ("Numeral.Min", _)) = [~1]
paulson@15013
   311
  | bin_of (Const ("Numeral.Bit", _) $ bs $ b) = dest_bit b :: bin_of bs
paulson@15620
   312
  | bin_of (Const ("Bit", _) $ bs $ b) = dest_bit b :: bin_of bs
nipkow@7548
   313
  | bin_of t = raise TERM("bin_of", [t]);
nipkow@7548
   314
nipkow@7548
   315
val dest_binum = int_of o bin_of;
nipkow@7548
   316
paulson@15620
   317
fun mk_bit 0 = B0_const
paulson@15620
   318
  | mk_bit 1 = B1_const
nipkow@10693
   319
  | mk_bit _ = sys_error "mk_bit";
nipkow@10693
   320
paulson@19481
   321
fun mk_binum n =
wenzelm@16971
   322
  let
wenzelm@16971
   323
    fun mk_bit n = if n = 0 then B0_const else B1_const;
wenzelm@16971
   324
wenzelm@16971
   325
    fun bin_of n =
wenzelm@16971
   326
      if n = 0 then pls_const
wenzelm@16971
   327
      else if n = ~1 then min_const
wenzelm@16971
   328
      else
wenzelm@16971
   329
        let
wenzelm@16971
   330
          (*val (q,r) = IntInf.divMod (n, 2): doesn't work in SML 110.0.7,
wenzelm@16971
   331
            but in newer versions!  FIXME: put this back after new SML released!*)
wenzelm@16971
   332
          val q = IntInf.div (n, 2);
wenzelm@16971
   333
          val r = IntInf.mod (n, 2);
wenzelm@16971
   334
        in bit_const $ bin_of q $ mk_bit r end;
wenzelm@16971
   335
  in bin_of n end;
berghofe@13755
   336
paulson@15620
   337
berghofe@13755
   338
(* int *)
berghofe@13755
   339
berghofe@13755
   340
val intT = Type ("IntDef.int", []);
berghofe@13755
   341
berghofe@14103
   342
fun mk_int 0 = Const ("0", intT)
berghofe@14103
   343
  | mk_int 1 = Const ("1", 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;