src/HOL/Tools/hologic.ML
author haftmann
Wed May 05 18:25:34 2010 +0200 (2010-05-05)
changeset 36692 54b64d4ad524
parent 35625 9c818cab0dd0
child 37145 01aa36932739
permissions -rw-r--r--
farewell to old-style mem infixes -- type inference in situations with mem_int and mem_string should provide enough information to resolve the type of (op =)
clasohm@923
     1
(*  Title:      HOL/hologic.ML
clasohm@923
     2
    Author:     Lawrence C Paulson and Markus Wenzel
clasohm@923
     3
clasohm@923
     4
Abstract syntax operations for HOL.
clasohm@923
     5
*)
clasohm@923
     6
clasohm@923
     7
signature HOLOGIC =
clasohm@923
     8
sig
wenzelm@12338
     9
  val typeS: sort
wenzelm@12338
    10
  val typeT: typ
wenzelm@8275
    11
  val boolN: string
clasohm@923
    12
  val boolT: typ
haftmann@30450
    13
  val Trueprop: term
haftmann@30450
    14
  val mk_Trueprop: term -> term
haftmann@30450
    15
  val dest_Trueprop: term -> term
wenzelm@21829
    16
  val true_const: term
paulson@7073
    17
  val false_const: term
clasohm@923
    18
  val mk_setT: typ -> typ
clasohm@923
    19
  val dest_setT: typ -> typ
haftmann@30450
    20
  val Collect_const: typ -> term
haftmann@30450
    21
  val mk_Collect: string * typ * term -> term
haftmann@30450
    22
  val mk_mem: term * term -> term
haftmann@30450
    23
  val dest_mem: term -> term * term
haftmann@30450
    24
  val mk_set: typ -> term list -> term
haftmann@30450
    25
  val dest_set: term -> term list
haftmann@30450
    26
  val mk_UNIV: typ -> term
wenzelm@23555
    27
  val conj_intr: thm -> thm -> thm
wenzelm@23555
    28
  val conj_elim: thm -> thm * thm
wenzelm@23555
    29
  val conj_elims: thm -> thm list
clasohm@923
    30
  val conj: term
clasohm@923
    31
  val disj: term
clasohm@923
    32
  val imp: term
wenzelm@8429
    33
  val Not: term
wenzelm@7690
    34
  val mk_conj: term * term -> term
wenzelm@7690
    35
  val mk_disj: term * term -> term
wenzelm@7690
    36
  val mk_imp: term * term -> term
wenzelm@16835
    37
  val mk_not: term -> term
paulson@15151
    38
  val dest_conj: term -> term list
paulson@15945
    39
  val dest_disj: term -> term list
paulson@24958
    40
  val disjuncts: term -> term list
wenzelm@4571
    41
  val dest_imp: term -> term * term
paulson@15151
    42
  val dest_not: term -> term
clasohm@923
    43
  val eq_const: typ -> term
wenzelm@21829
    44
  val mk_eq: term * term -> term
wenzelm@21829
    45
  val dest_eq: term -> term * term
clasohm@923
    46
  val all_const: typ -> term
wenzelm@21829
    47
  val mk_all: string * typ * term -> term
wenzelm@21829
    48
  val list_all: (string * typ) list * term -> term
clasohm@923
    49
  val exists_const: typ -> term
wenzelm@21829
    50
  val mk_exists: string * typ * term -> term
paulson@15945
    51
  val choice_const: typ -> term
wenzelm@21829
    52
  val class_eq: string
wenzelm@2510
    53
  val mk_binop: string -> term * term -> term
wenzelm@2510
    54
  val mk_binrel: string -> term * term -> term
wenzelm@2510
    55
  val dest_bin: string -> typ -> term -> term * term
wenzelm@4571
    56
  val unitT: typ
wenzelm@9362
    57
  val is_unitT: typ -> bool
wenzelm@4571
    58
  val unit: term
wenzelm@4571
    59
  val is_unit: term -> bool
wenzelm@4571
    60
  val mk_prodT: typ * typ -> typ
wenzelm@4571
    61
  val dest_prodT: typ -> typ * typ
berghofe@14048
    62
  val pair_const: typ -> typ -> term
wenzelm@4571
    63
  val mk_prod: term * term -> term
wenzelm@4571
    64
  val dest_prod: term -> term * term
wenzelm@4571
    65
  val mk_fst: term -> term
wenzelm@4571
    66
  val mk_snd: term -> term
wenzelm@21829
    67
  val split_const: typ * typ * typ -> term
wenzelm@18285
    68
  val mk_split: term -> term
haftmann@32287
    69
  val flatten_tupleT: typ -> typ list
haftmann@32342
    70
  val mk_tupleT: typ list -> typ
haftmann@32342
    71
  val strip_tupleT: typ -> typ list
haftmann@32342
    72
  val mk_tuple: term list -> term
haftmann@32342
    73
  val strip_tuple: term -> term list
haftmann@32342
    74
  val mk_ptupleT: int list list -> typ list -> typ
haftmann@32342
    75
  val strip_ptupleT: int list list -> typ -> typ list
haftmann@32287
    76
  val flat_tupleT_paths: typ -> int list list
haftmann@32342
    77
  val mk_ptuple: int list list -> typ -> term list -> term
haftmann@32342
    78
  val strip_ptuple: int list list -> term -> term list
haftmann@32287
    79
  val flat_tuple_paths: term -> int list list
haftmann@32342
    80
  val mk_psplits: int list list -> typ -> typ -> term -> term
haftmann@32342
    81
  val strip_psplits: term -> term * typ list * int list list
wenzelm@5207
    82
  val natT: typ
wenzelm@5207
    83
  val zero: term
wenzelm@5207
    84
  val is_zero: term -> bool
wenzelm@5207
    85
  val mk_Suc: term -> term
wenzelm@5207
    86
  val dest_Suc: term -> term
haftmann@21621
    87
  val Suc_zero: term
wenzelm@24630
    88
  val mk_nat: int -> term
wenzelm@24630
    89
  val dest_nat: term -> int
haftmann@22994
    90
  val class_size: string
haftmann@22994
    91
  val size_const: typ -> term
haftmann@31205
    92
  val code_numeralT: typ
wenzelm@21829
    93
  val intT: typ
paulson@7073
    94
  val pls_const: term
paulson@7073
    95
  val min_const: term
huffman@26086
    96
  val bit0_const: term
huffman@26086
    97
  val bit1_const: term
huffman@26086
    98
  val mk_bit: int -> term
huffman@26086
    99
  val dest_bit: term -> int
wenzelm@24630
   100
  val mk_numeral: int -> term
wenzelm@24630
   101
  val dest_numeral: term -> int
wenzelm@21829
   102
  val number_of_const: typ -> term
wenzelm@23269
   103
  val add_numerals: term -> (term * typ) list -> (term * typ) list
wenzelm@24630
   104
  val mk_number: typ -> int -> term
wenzelm@24630
   105
  val dest_number: term -> typ * int
wenzelm@21778
   106
  val realT: typ
wenzelm@21755
   107
  val nibbleT: typ
wenzelm@21755
   108
  val mk_nibble: int -> term
wenzelm@21755
   109
  val dest_nibble: term -> int
wenzelm@21755
   110
  val charT: typ
wenzelm@21755
   111
  val mk_char: int -> term
wenzelm@21755
   112
  val dest_char: term -> int
wenzelm@21829
   113
  val listT: typ -> typ
berghofe@25887
   114
  val nil_const: typ -> term
berghofe@25887
   115
  val cons_const: typ -> term
wenzelm@21829
   116
  val mk_list: typ -> term list -> term
wenzelm@21829
   117
  val dest_list: term -> term list
wenzelm@21778
   118
  val stringT: typ
haftmann@21820
   119
  val mk_string: string -> term
haftmann@21820
   120
  val dest_string: term -> string
haftmann@31205
   121
  val literalT: typ
haftmann@31205
   122
  val mk_literal: string -> term
haftmann@31205
   123
  val dest_literal: term -> string
haftmann@31135
   124
  val mk_typerep: typ -> term
haftmann@32339
   125
  val termT: typ
haftmann@32339
   126
  val term_of_const: typ -> term
haftmann@31135
   127
  val mk_term_of: typ -> term -> term
haftmann@31135
   128
  val reflect_term: term -> term
haftmann@31463
   129
  val mk_valtermify_app: string -> (string * typ) list -> typ -> term
haftmann@31183
   130
  val mk_return: typ -> typ -> term -> term
haftmann@31183
   131
  val mk_ST: ((term * typ) * (string * typ) option)  list -> term -> typ -> typ option * typ -> term
haftmann@31463
   132
  val mk_random: typ -> term -> term
clasohm@923
   133
end;
clasohm@923
   134
clasohm@923
   135
structure HOLogic: HOLOGIC =
clasohm@923
   136
struct
clasohm@923
   137
wenzelm@12338
   138
(* HOL syntax *)
clasohm@923
   139
wenzelm@12338
   140
val typeS: sort = ["HOL.type"];
wenzelm@12338
   141
val typeT = TypeInfer.anyT typeS;
wenzelm@12338
   142
clasohm@923
   143
wenzelm@2510
   144
(* bool and set *)
clasohm@923
   145
wenzelm@8275
   146
val boolN = "bool";
wenzelm@8275
   147
val boolT = Type (boolN, []);
clasohm@923
   148
wenzelm@9856
   149
val true_const =  Const ("True", boolT);
wenzelm@9856
   150
val false_const = Const ("False", boolT);
paulson@7073
   151
berghofe@26804
   152
fun mk_setT T = T --> boolT;
clasohm@923
   153
berghofe@26804
   154
fun dest_setT (Type ("fun", [T, Type ("bool", [])])) = T
wenzelm@3794
   155
  | dest_setT T = raise TYPE ("dest_setT: set type expected", [T], []);
clasohm@923
   156
haftmann@30450
   157
fun mk_set T ts =
haftmann@30450
   158
  let
haftmann@30450
   159
    val sT = mk_setT T;
haftmann@32264
   160
    val empty = Const ("Orderings.bot_class.bot", sT);
haftmann@31456
   161
    fun insert t u = Const ("Set.insert", T --> sT --> sT) $ t $ u;
haftmann@30450
   162
  in fold_rev insert ts empty end;
haftmann@30450
   163
haftmann@32264
   164
fun mk_UNIV T = Const ("Orderings.top_class.top", mk_setT T);
haftmann@30450
   165
haftmann@32264
   166
fun dest_set (Const ("Orderings.bot_class.bot", _)) = []
haftmann@31456
   167
  | dest_set (Const ("Set.insert", _) $ t $ u) = t :: dest_set u
haftmann@30450
   168
  | dest_set t = raise TERM ("dest_set", [t]);
haftmann@30450
   169
haftmann@30450
   170
fun Collect_const T = Const ("Collect", (T --> boolT) --> mk_setT T);
haftmann@30450
   171
fun mk_Collect (a, T, t) = Collect_const T $ absfree (a, T, t);
haftmann@30450
   172
haftmann@30450
   173
fun mk_mem (x, A) =
haftmann@30450
   174
  let val setT = fastype_of A in
haftmann@30450
   175
    Const ("op :", dest_setT setT --> setT --> boolT) $ x $ A
haftmann@30450
   176
  end;
haftmann@30450
   177
haftmann@30450
   178
fun dest_mem (Const ("op :", _) $ x $ A) = (x, A)
haftmann@30450
   179
  | dest_mem t = raise TERM ("dest_mem", [t]);
haftmann@30450
   180
wenzelm@8275
   181
paulson@7073
   182
(* logic *)
clasohm@923
   183
clasohm@923
   184
val Trueprop = Const ("Trueprop", boolT --> propT);
clasohm@923
   185
clasohm@923
   186
fun mk_Trueprop P = Trueprop $ P;
clasohm@923
   187
clasohm@923
   188
fun dest_Trueprop (Const ("Trueprop", _) $ P) = P
wenzelm@3794
   189
  | dest_Trueprop t = raise TERM ("dest_Trueprop", [t]);
clasohm@923
   190
wenzelm@23555
   191
fun conj_intr thP thQ =
wenzelm@23555
   192
  let
wenzelm@35625
   193
    val (P, Q) = pairself (Object_Logic.dest_judgment o Thm.cprop_of) (thP, thQ)
wenzelm@23555
   194
      handle CTERM (msg, _) => raise THM (msg, 0, [thP, thQ]);
wenzelm@23555
   195
    val inst = Thm.instantiate ([], [(@{cpat "?P::bool"}, P), (@{cpat "?Q::bool"}, Q)]);
wenzelm@23555
   196
  in Drule.implies_elim_list (inst @{thm conjI}) [thP, thQ] end;
clasohm@923
   197
wenzelm@23555
   198
fun conj_elim thPQ =
wenzelm@23555
   199
  let
wenzelm@35625
   200
    val (P, Q) = Thm.dest_binop (Object_Logic.dest_judgment (Thm.cprop_of thPQ))
wenzelm@23555
   201
      handle CTERM (msg, _) => raise THM (msg, 0, [thPQ]);
wenzelm@23555
   202
    val inst = Thm.instantiate ([], [(@{cpat "?P::bool"}, P), (@{cpat "?Q::bool"}, Q)]);
wenzelm@23555
   203
    val thP = Thm.implies_elim (inst @{thm conjunct1}) thPQ;
wenzelm@23555
   204
    val thQ = Thm.implies_elim (inst @{thm conjunct2}) thPQ;
wenzelm@23555
   205
  in (thP, thQ) end;
wenzelm@23555
   206
wenzelm@23555
   207
fun conj_elims th =
wenzelm@23555
   208
  let val (th1, th2) = conj_elim th
wenzelm@23555
   209
  in conj_elims th1 @ conj_elims th2 end handle THM _ => [th];
wenzelm@23555
   210
wenzelm@23555
   211
val conj = @{term "op &"}
wenzelm@23555
   212
and disj = @{term "op |"}
wenzelm@23555
   213
and imp = @{term "op -->"}
wenzelm@23555
   214
and Not = @{term "Not"};
clasohm@923
   215
wenzelm@7690
   216
fun mk_conj (t1, t2) = conj $ t1 $ t2
wenzelm@7690
   217
and mk_disj (t1, t2) = disj $ t1 $ t2
wenzelm@16835
   218
and mk_imp (t1, t2) = imp $ t1 $ t2
wenzelm@16835
   219
and mk_not t = Not $ t;
wenzelm@7690
   220
paulson@15151
   221
fun dest_conj (Const ("op &", _) $ t $ t') = t :: dest_conj t'
paulson@15151
   222
  | dest_conj t = [t];
paulson@15151
   223
paulson@15945
   224
fun dest_disj (Const ("op |", _) $ t $ t') = t :: dest_disj t'
paulson@15945
   225
  | dest_disj t = [t];
paulson@15945
   226
paulson@24958
   227
(*Like dest_disj, but flattens disjunctions however nested*)
paulson@24958
   228
fun disjuncts_aux (Const ("op |", _) $ t $ t') disjs = disjuncts_aux t (disjuncts_aux t' disjs)
paulson@24958
   229
  | disjuncts_aux t disjs = t::disjs;
paulson@24958
   230
paulson@24958
   231
fun disjuncts t = disjuncts_aux t [];
paulson@24958
   232
paulson@4466
   233
fun dest_imp (Const("op -->",_) $ A $ B) = (A, B)
paulson@4466
   234
  | dest_imp  t = raise TERM ("dest_imp", [t]);
paulson@4466
   235
paulson@15151
   236
fun dest_not (Const ("Not", _) $ t) = t
paulson@15151
   237
  | dest_not t = raise TERM ("dest_not", [t]);
wenzelm@8302
   238
clasohm@923
   239
fun eq_const T = Const ("op =", [T, T] ---> boolT);
clasohm@923
   240
fun mk_eq (t, u) = eq_const (fastype_of t) $ t $ u;
clasohm@923
   241
paulson@6031
   242
fun dest_eq (Const ("op =", _) $ lhs $ rhs) = (lhs, rhs)
paulson@6031
   243
  | dest_eq t = raise TERM ("dest_eq", [t])
paulson@6031
   244
clasohm@923
   245
fun all_const T = Const ("All", [T --> boolT] ---> boolT);
clasohm@923
   246
fun mk_all (x, T, P) = all_const T $ absfree (x, T, P);
wenzelm@21173
   247
fun list_all (xs, t) = fold_rev (fn (x, T) => fn P => all_const T $ Abs (x, T, P)) xs t;
clasohm@923
   248
clasohm@923
   249
fun exists_const T = Const ("Ex", [T --> boolT] ---> boolT);
clasohm@923
   250
fun mk_exists (x, T, P) = exists_const T $ absfree (x, T, P);
clasohm@923
   251
wenzelm@21755
   252
fun choice_const T = Const("Hilbert_Choice.Eps", (T --> boolT) --> T);
paulson@15945
   253
haftmann@23247
   254
val class_eq = "HOL.eq";
haftmann@21045
   255
clasohm@923
   256
ballarin@13743
   257
(* binary operations and relations *)
wenzelm@2510
   258
wenzelm@2510
   259
fun mk_binop c (t, u) =
wenzelm@2510
   260
  let val T = fastype_of t in
wenzelm@2510
   261
    Const (c, [T, T] ---> T) $ t $ u
wenzelm@2510
   262
  end;
wenzelm@2510
   263
wenzelm@2510
   264
fun mk_binrel c (t, u) =
wenzelm@2510
   265
  let val T = fastype_of t in
wenzelm@2510
   266
    Const (c, [T, T] ---> boolT) $ t $ u
wenzelm@2510
   267
  end;
wenzelm@2510
   268
paulson@14387
   269
(*destruct the application of a binary operator. The dummyT case is a crude
paulson@14387
   270
  way of handling polymorphic operators.*)
wenzelm@2510
   271
fun dest_bin c T (tm as Const (c', Type ("fun", [T', _])) $ t $ u) =
paulson@14387
   272
      if c = c' andalso (T=T' orelse T=dummyT) then (t, u)
wenzelm@3794
   273
      else raise TERM ("dest_bin " ^ c, [tm])
wenzelm@3794
   274
  | dest_bin c _ tm = raise TERM ("dest_bin " ^ c, [tm]);
wenzelm@2510
   275
wenzelm@2510
   276
wenzelm@4571
   277
(* unit *)
wenzelm@4571
   278
wenzelm@11604
   279
val unitT = Type ("Product_Type.unit", []);
wenzelm@4571
   280
wenzelm@11604
   281
fun is_unitT (Type ("Product_Type.unit", [])) = true
wenzelm@9362
   282
  | is_unitT _ = false;
wenzelm@9362
   283
wenzelm@11604
   284
val unit = Const ("Product_Type.Unity", unitT);
wenzelm@4571
   285
wenzelm@11604
   286
fun is_unit (Const ("Product_Type.Unity", _)) = true
wenzelm@4571
   287
  | is_unit _ = false;
wenzelm@4571
   288
wenzelm@4571
   289
wenzelm@4571
   290
(* prod *)
wenzelm@4571
   291
wenzelm@4571
   292
fun mk_prodT (T1, T2) = Type ("*", [T1, T2]);
wenzelm@4571
   293
wenzelm@4571
   294
fun dest_prodT (Type ("*", [T1, T2])) = (T1, T2)
wenzelm@4571
   295
  | dest_prodT T = raise TYPE ("dest_prodT", [T], []);
wenzelm@4571
   296
berghofe@14048
   297
fun pair_const T1 T2 = Const ("Pair", [T1, T2] ---> mk_prodT (T1, T2));
berghofe@14048
   298
wenzelm@4571
   299
fun mk_prod (t1, t2) =
wenzelm@4571
   300
  let val T1 = fastype_of t1 and T2 = fastype_of t2 in
berghofe@14048
   301
    pair_const T1 T2 $ t1 $ t2
wenzelm@4571
   302
  end;
wenzelm@4571
   303
wenzelm@4571
   304
fun dest_prod (Const ("Pair", _) $ t1 $ t2) = (t1, t2)
wenzelm@4571
   305
  | dest_prod t = raise TERM ("dest_prod", [t]);
wenzelm@4571
   306
wenzelm@4571
   307
fun mk_fst p =
wenzelm@4571
   308
  let val pT = fastype_of p in
wenzelm@4571
   309
    Const ("fst", pT --> fst (dest_prodT pT)) $ p
wenzelm@4571
   310
  end;
wenzelm@4571
   311
wenzelm@4571
   312
fun mk_snd p =
wenzelm@4571
   313
  let val pT = fastype_of p in
wenzelm@4571
   314
    Const ("snd", pT --> snd (dest_prodT pT)) $ p
wenzelm@4571
   315
  end;
wenzelm@4571
   316
wenzelm@18285
   317
fun split_const (A, B, C) =
wenzelm@18285
   318
  Const ("split", (A --> B --> C) --> mk_prodT (A, B) --> C);
wenzelm@18285
   319
wenzelm@18285
   320
fun mk_split t =
wenzelm@18285
   321
  (case Term.fastype_of t of
wenzelm@18285
   322
    T as (Type ("fun", [A, Type ("fun", [B, C])])) =>
wenzelm@18285
   323
      Const ("split", T --> mk_prodT (A, B) --> C) $ t
wenzelm@18285
   324
  | _ => raise TERM ("mk_split: bad body type", [t]));
wenzelm@18285
   325
berghofe@5096
   326
(*Maps the type T1 * ... * Tn to [T1, ..., Tn], however nested*)
haftmann@32287
   327
fun flatten_tupleT (Type ("*", [T1, T2])) = flatten_tupleT T1 @ flatten_tupleT T2
haftmann@32287
   328
  | flatten_tupleT T = [T];
berghofe@23745
   329
haftmann@32342
   330
haftmann@32342
   331
(* tuples with right-fold structure *)
haftmann@32342
   332
haftmann@32342
   333
fun mk_tupleT [] = unitT
haftmann@32342
   334
  | mk_tupleT Ts = foldr1 mk_prodT Ts;
haftmann@32342
   335
haftmann@32342
   336
fun strip_tupleT (Type ("Product_Type.unit", [])) = []
haftmann@32342
   337
  | strip_tupleT (Type ("*", [T1, T2])) = T1 :: strip_tupleT T2
haftmann@32342
   338
  | strip_tupleT T = [T];
haftmann@32342
   339
haftmann@32342
   340
fun mk_tuple [] = unit
haftmann@32342
   341
  | mk_tuple ts = foldr1 mk_prod ts;
haftmann@32342
   342
haftmann@32342
   343
fun strip_tuple (Const ("Product_Type.Unity", _)) = []
haftmann@32342
   344
  | strip_tuple (Const ("Pair", _) $ t1 $ t2) = t1 :: strip_tuple t2
haftmann@32342
   345
  | strip_tuple t = [t];
haftmann@32342
   346
haftmann@32342
   347
haftmann@32287
   348
(* tuples with specific arities
berghofe@23745
   349
haftmann@32342
   350
   an "arity" of a tuple is a list of lists of integers,
haftmann@32342
   351
   denoting paths to subterms that are pairs
wenzelm@25172
   352
*)
berghofe@23745
   353
haftmann@32342
   354
fun ptuple_err s = raise TERM (s ^ ": inconsistent use of nested products", []);
berghofe@23745
   355
haftmann@32342
   356
fun mk_ptupleT ps =
berghofe@23745
   357
  let
berghofe@23745
   358
    fun mk p Ts =
haftmann@36692
   359
      if member (op =) ps p then
berghofe@23745
   360
        let
berghofe@23745
   361
          val (T, Ts') = mk (1::p) Ts;
berghofe@23745
   362
          val (U, Ts'') = mk (2::p) Ts'
berghofe@23745
   363
        in (mk_prodT (T, U), Ts'') end
berghofe@23745
   364
      else (hd Ts, tl Ts)
berghofe@23745
   365
  in fst o mk [] end;
berghofe@23745
   366
haftmann@32342
   367
fun strip_ptupleT ps =
haftmann@32287
   368
  let
haftmann@36692
   369
    fun factors p T = if member (op =) ps p then (case T of
haftmann@32287
   370
        Type ("*", [T1, T2]) =>
haftmann@32287
   371
          factors (1::p) T1 @ factors (2::p) T2
haftmann@32342
   372
      | _ => ptuple_err "strip_ptupleT") else [T]
haftmann@32287
   373
  in factors [] end;
haftmann@32287
   374
haftmann@32287
   375
val flat_tupleT_paths =
haftmann@32287
   376
  let
haftmann@32287
   377
    fun factors p (Type ("*", [T1, T2])) =
haftmann@32287
   378
          p :: factors (1::p) T1 @ factors (2::p) T2
haftmann@32287
   379
      | factors p _ = []
haftmann@32287
   380
  in factors [] end;
haftmann@32287
   381
haftmann@32342
   382
fun mk_ptuple ps =
haftmann@32287
   383
  let
haftmann@32287
   384
    fun mk p T ts =
haftmann@36692
   385
      if member (op =) ps p then (case T of
haftmann@32287
   386
          Type ("*", [T1, T2]) =>
haftmann@32287
   387
            let
haftmann@32287
   388
              val (t, ts') = mk (1::p) T1 ts;
haftmann@32287
   389
              val (u, ts'') = mk (2::p) T2 ts'
haftmann@32287
   390
            in (pair_const T1 T2 $ t $ u, ts'') end
haftmann@32342
   391
        | _ => ptuple_err "mk_ptuple")
haftmann@32287
   392
      else (hd ts, tl ts)
haftmann@32287
   393
  in fst oo mk [] end;
haftmann@32287
   394
haftmann@32342
   395
fun strip_ptuple ps =
haftmann@32287
   396
  let
haftmann@36692
   397
    fun dest p t = if member (op =) ps p then (case t of
haftmann@32287
   398
        Const ("Pair", _) $ t $ u =>
haftmann@32287
   399
          dest (1::p) t @ dest (2::p) u
haftmann@32342
   400
      | _ => ptuple_err "strip_ptuple") else [t]
haftmann@32287
   401
  in dest [] end;
haftmann@32287
   402
haftmann@32287
   403
val flat_tuple_paths =
haftmann@32287
   404
  let
haftmann@32287
   405
    fun factors p (Const ("Pair", _) $ t $ u) =
haftmann@32287
   406
          p :: factors (1::p) t @ factors (2::p) u
haftmann@32287
   407
      | factors p _ = []
haftmann@32287
   408
  in factors [] end;
haftmann@32287
   409
haftmann@32342
   410
(*In mk_psplits ps S T u, term u expects separate arguments for the factors of S,
haftmann@32287
   411
  with result type T.  The call creates a new term expecting one argument
haftmann@32287
   412
  of type S.*)
haftmann@32342
   413
fun mk_psplits ps T T3 u =
haftmann@32287
   414
  let
haftmann@32287
   415
    fun ap ((p, T) :: pTs) =
haftmann@36692
   416
          if member (op =) ps p then (case T of
haftmann@32287
   417
              Type ("*", [T1, T2]) =>
haftmann@32287
   418
                split_const (T1, T2, map snd pTs ---> T3) $
haftmann@32287
   419
                  ap ((1::p, T1) :: (2::p, T2) :: pTs)
haftmann@32342
   420
            | _ => ptuple_err "mk_psplits")
haftmann@32287
   421
          else Abs ("x", T, ap pTs)
haftmann@32287
   422
      | ap [] =
haftmann@32287
   423
          let val k = length ps
haftmann@32287
   424
          in list_comb (incr_boundvars (k + 1) u, map Bound (k downto 0)) end
haftmann@32287
   425
  in ap [([], T)] end;
haftmann@32287
   426
haftmann@32342
   427
val strip_psplits =
berghofe@23745
   428
  let
haftmann@34962
   429
    fun strip [] qs Ts t = (t, rev Ts, qs)
berghofe@23745
   430
      | strip (p :: ps) qs Ts (Const ("split", _) $ t) =
berghofe@23745
   431
          strip ((1 :: p) :: (2 :: p) :: ps) (p :: qs) Ts t
berghofe@23745
   432
      | strip (p :: ps) qs Ts (Abs (s, T, t)) = strip ps qs (T :: Ts) t
berghofe@23745
   433
      | strip (p :: ps) qs Ts t = strip ps qs
berghofe@23745
   434
          (hd (binder_types (fastype_of1 (Ts, t))) :: Ts)
berghofe@23745
   435
          (incr_boundvars 1 t $ Bound 0)
haftmann@32287
   436
  in strip [[]] [] [] end;
berghofe@23745
   437
wenzelm@5207
   438
wenzelm@5207
   439
(* nat *)
wenzelm@5207
   440
wenzelm@5207
   441
val natT = Type ("nat", []);
wenzelm@5207
   442
haftmann@35267
   443
val zero = Const ("Groups.zero_class.zero", natT);
wenzelm@5207
   444
haftmann@35267
   445
fun is_zero (Const ("Groups.zero_class.zero", _)) = true
wenzelm@5207
   446
  | is_zero _ = false;
wenzelm@5207
   447
wenzelm@5207
   448
fun mk_Suc t = Const ("Suc", natT --> natT) $ t;
wenzelm@5207
   449
wenzelm@5207
   450
fun dest_Suc (Const ("Suc", _) $ t) = t
wenzelm@5207
   451
  | dest_Suc t = raise TERM ("dest_Suc", [t]);
wenzelm@5207
   452
haftmann@21621
   453
val Suc_zero = mk_Suc zero;
haftmann@21621
   454
wenzelm@24630
   455
fun mk_nat n =
haftmann@22994
   456
  let
haftmann@22994
   457
    fun mk 0 = zero
wenzelm@23297
   458
      | mk n = mk_Suc (mk (n - 1));
wenzelm@23576
   459
  in if n < 0 then raise TERM ("mk_nat: negative number", []) else mk n end;
wenzelm@5207
   460
haftmann@35267
   461
fun dest_nat (Const ("Groups.zero_class.zero", _)) = 0
wenzelm@23297
   462
  | dest_nat (Const ("Suc", _) $ t) = dest_nat t + 1
wenzelm@5207
   463
  | dest_nat t = raise TERM ("dest_nat", [t]);
wenzelm@5207
   464
haftmann@22994
   465
val class_size = "Nat.size";
haftmann@22994
   466
haftmann@22994
   467
fun size_const T = Const ("Nat.size_class.size", T --> natT);
haftmann@22994
   468
wenzelm@5207
   469
haftmann@31205
   470
(* code numeral *)
haftmann@26036
   471
haftmann@31205
   472
val code_numeralT = Type ("Code_Numeral.code_numeral", []);
haftmann@26036
   473
haftmann@26036
   474
wenzelm@21778
   475
(* binary numerals and int -- non-unique representation due to leading zeros/ones! *)
wenzelm@21778
   476
haftmann@25919
   477
val intT = Type ("Int.int", []);
wenzelm@21778
   478
haftmann@25919
   479
val pls_const = Const ("Int.Pls", intT)
haftmann@25919
   480
and min_const = Const ("Int.Min", intT)
huffman@26086
   481
and bit0_const = Const ("Int.Bit0", intT --> intT)
huffman@26086
   482
and bit1_const = Const ("Int.Bit1", intT --> intT);
huffman@26086
   483
huffman@26086
   484
fun mk_bit 0 = bit0_const
huffman@26086
   485
  | mk_bit 1 = bit1_const
huffman@26086
   486
  | mk_bit _ = raise TERM ("mk_bit", []);
huffman@26086
   487
huffman@26086
   488
fun dest_bit (Const ("Int.Bit0", _)) = 0
huffman@26086
   489
  | dest_bit (Const ("Int.Bit1", _)) = 1
huffman@26086
   490
  | dest_bit t = raise TERM ("dest_bit", [t]);
paulson@8768
   491
wenzelm@21829
   492
fun mk_numeral 0 = pls_const
wenzelm@21829
   493
  | mk_numeral ~1 = min_const
wenzelm@21829
   494
  | mk_numeral i =
wenzelm@24630
   495
      let val (q, r) = Integer.div_mod i 2;
huffman@26086
   496
      in mk_bit r $ mk_numeral q end;
berghofe@13755
   497
haftmann@25919
   498
fun dest_numeral (Const ("Int.Pls", _)) = 0
haftmann@25919
   499
  | dest_numeral (Const ("Int.Min", _)) = ~1
huffman@26086
   500
  | dest_numeral (Const ("Int.Bit0", _) $ bs) = 2 * dest_numeral bs
huffman@26086
   501
  | dest_numeral (Const ("Int.Bit1", _) $ bs) = 2 * dest_numeral bs + 1
wenzelm@21829
   502
  | dest_numeral t = raise TERM ("dest_numeral", [t]);
berghofe@13755
   503
haftmann@25919
   504
fun number_of_const T = Const ("Int.number_class.number_of", intT --> T);
haftmann@21820
   505
haftmann@25919
   506
fun add_numerals (Const ("Int.number_class.number_of", Type (_, [_, T])) $ t) = cons (t, T)
wenzelm@23269
   507
  | add_numerals (t $ u) = add_numerals t #> add_numerals u
wenzelm@23269
   508
  | add_numerals (Abs (_, _, t)) = add_numerals t
wenzelm@23269
   509
  | add_numerals _ = I;
haftmann@22391
   510
haftmann@35267
   511
fun mk_number T 0 = Const ("Groups.zero_class.zero", T)
haftmann@35267
   512
  | mk_number T 1 = Const ("Groups.one_class.one", T)
haftmann@21820
   513
  | mk_number T i = number_of_const T $ mk_numeral i;
haftmann@21820
   514
haftmann@35267
   515
fun dest_number (Const ("Groups.zero_class.zero", T)) = (T, 0)
haftmann@35267
   516
  | dest_number (Const ("Groups.one_class.one", T)) = (T, 1)
haftmann@25919
   517
  | dest_number (Const ("Int.number_class.number_of", Type ("fun", [_, T])) $ t) =
haftmann@22994
   518
      (T, dest_numeral t)
haftmann@21820
   519
  | dest_number t = raise TERM ("dest_number", [t]);
berghofe@13755
   520
wenzelm@21829
   521
berghofe@13755
   522
(* real *)
berghofe@13755
   523
wenzelm@16971
   524
val realT = Type ("RealDef.real", []);
berghofe@13755
   525
berghofe@13755
   526
wenzelm@21755
   527
(* list *)
haftmann@21455
   528
wenzelm@21755
   529
fun listT T = Type ("List.list", [T]);
haftmann@21455
   530
berghofe@25887
   531
fun nil_const T = Const ("List.list.Nil", listT T);
berghofe@25887
   532
berghofe@25887
   533
fun cons_const T =
berghofe@25887
   534
  let val lT = listT T
berghofe@25887
   535
  in Const ("List.list.Cons", T --> lT --> lT) end;
berghofe@25887
   536
wenzelm@21755
   537
fun mk_list T ts =
haftmann@21455
   538
  let
wenzelm@21755
   539
    val lT = listT T;
wenzelm@21755
   540
    val Nil = Const ("List.list.Nil", lT);
wenzelm@21755
   541
    fun Cons t u = Const ("List.list.Cons", T --> lT --> lT) $ t $ u;
wenzelm@21755
   542
  in fold_rev Cons ts Nil end;
wenzelm@21755
   543
wenzelm@21755
   544
fun dest_list (Const ("List.list.Nil", _)) = []
wenzelm@21755
   545
  | dest_list (Const ("List.list.Cons", _) $ t $ u) = t :: dest_list u
wenzelm@21755
   546
  | dest_list t = raise TERM ("dest_list", [t]);
haftmann@21455
   547
haftmann@21455
   548
haftmann@31048
   549
(* nibble *)
haftmann@31048
   550
haftmann@31048
   551
val nibbleT = Type ("String.nibble", []);
haftmann@31048
   552
haftmann@31048
   553
fun mk_nibble n =
haftmann@31048
   554
  let val s =
haftmann@31048
   555
    if 0 <= n andalso n <= 9 then chr (n + ord "0")
haftmann@31048
   556
    else if 10 <= n andalso n <= 15 then chr (n + ord "A" - 10)
haftmann@31048
   557
    else raise TERM ("mk_nibble", [])
haftmann@31048
   558
  in Const ("String.nibble.Nibble" ^ s, nibbleT) end;
haftmann@31048
   559
haftmann@31048
   560
fun dest_nibble t =
haftmann@31048
   561
  let fun err () = raise TERM ("dest_nibble", [t]) in
haftmann@31048
   562
    (case try (unprefix "String.nibble.Nibble" o fst o Term.dest_Const) t of
haftmann@31048
   563
      NONE => err ()
haftmann@31048
   564
    | SOME c =>
haftmann@31048
   565
        if size c <> 1 then err ()
haftmann@31048
   566
        else if "0" <= c andalso c <= "9" then ord c - ord "0"
haftmann@31048
   567
        else if "A" <= c andalso c <= "F" then ord c - ord "A" + 10
haftmann@31048
   568
        else err ())
haftmann@31048
   569
  end;
haftmann@31048
   570
haftmann@31048
   571
haftmann@31048
   572
(* char *)
haftmann@31048
   573
haftmann@31048
   574
val charT = Type ("String.char", []);
haftmann@31048
   575
haftmann@31048
   576
fun mk_char n =
haftmann@31048
   577
  if 0 <= n andalso n <= 255 then
haftmann@31048
   578
    Const ("String.char.Char", nibbleT --> nibbleT --> charT) $
haftmann@31048
   579
      mk_nibble (n div 16) $ mk_nibble (n mod 16)
haftmann@31048
   580
  else raise TERM ("mk_char", []);
haftmann@31048
   581
haftmann@31048
   582
fun dest_char (Const ("String.char.Char", _) $ t $ u) =
haftmann@31048
   583
      dest_nibble t * 16 + dest_nibble u
haftmann@31048
   584
  | dest_char t = raise TERM ("dest_char", [t]);
haftmann@31048
   585
haftmann@31048
   586
haftmann@21455
   587
(* string *)
haftmann@21455
   588
krauss@32446
   589
val stringT = listT charT;
haftmann@21455
   590
wenzelm@21755
   591
val mk_string = mk_list charT o map (mk_char o ord) o explode;
wenzelm@21755
   592
val dest_string = implode o map (chr o dest_char) o dest_list;
haftmann@21455
   593
haftmann@31048
   594
haftmann@31205
   595
(* literal *)
haftmann@31048
   596
haftmann@31205
   597
val literalT = Type ("String.literal", []);
haftmann@31048
   598
haftmann@31205
   599
fun mk_literal s = Const ("String.literal.STR", stringT --> literalT)
haftmann@31048
   600
      $ mk_string s;
haftmann@31205
   601
fun dest_literal (Const ("String.literal.STR", _) $ t) =
haftmann@31048
   602
      dest_string t
haftmann@31205
   603
  | dest_literal t = raise TERM ("dest_literal", [t]);
haftmann@31048
   604
haftmann@31135
   605
haftmann@31135
   606
(* typerep and term *)
haftmann@31135
   607
haftmann@31135
   608
val typerepT = Type ("Typerep.typerep", []);
haftmann@31135
   609
haftmann@31736
   610
fun mk_typerep (Type (tyco, Ts)) = Const ("Typerep.typerep.Typerep",
haftmann@31736
   611
      literalT --> listT typerepT --> typerepT) $ mk_literal tyco
haftmann@31736
   612
        $ mk_list typerepT (map mk_typerep Ts)
haftmann@31736
   613
  | mk_typerep (T as TFree _) = Const ("Typerep.typerep_class.typerep",
haftmann@31736
   614
      Term.itselfT T --> typerepT) $ Logic.mk_type T;
haftmann@31135
   615
haftmann@32657
   616
val termT = Type ("Code_Evaluation.term", []);
haftmann@31135
   617
haftmann@32657
   618
fun term_of_const T = Const ("Code_Evaluation.term_of_class.term_of", T --> termT);
haftmann@32339
   619
haftmann@32339
   620
fun mk_term_of T t = term_of_const T $ t;
haftmann@31135
   621
haftmann@31135
   622
fun reflect_term (Const (c, T)) =
haftmann@32657
   623
      Const ("Code_Evaluation.Const", literalT --> typerepT --> termT)
haftmann@31205
   624
        $ mk_literal c $ mk_typerep T
haftmann@31135
   625
  | reflect_term (t1 $ t2) =
haftmann@32657
   626
      Const ("Code_Evaluation.App", termT --> termT --> termT)
haftmann@31135
   627
        $ reflect_term t1 $ reflect_term t2
haftmann@31183
   628
  | reflect_term (Abs (v, _, t)) = Abs (v, termT, reflect_term t)
haftmann@31183
   629
  | reflect_term t = t;
haftmann@31183
   630
haftmann@31463
   631
fun mk_valtermify_app c vs T =
haftmann@31463
   632
  let
haftmann@31463
   633
    fun termifyT T = mk_prodT (T, unitT --> termT);
haftmann@32657
   634
    fun valapp T T' = Const ("Code_Evaluation.valapp",
haftmann@31463
   635
      termifyT (T --> T') --> termifyT T --> termifyT T');
haftmann@31463
   636
    fun mk_fTs [] _ = []
haftmann@31463
   637
      | mk_fTs (_ :: Ts) T = (Ts ---> T) :: mk_fTs Ts T;
haftmann@31463
   638
    val Ts = map snd vs;
haftmann@31463
   639
    val t = Const (c, Ts ---> T);
haftmann@31463
   640
    val tt = mk_prod (t, Abs ("u", unitT, reflect_term t));
wenzelm@33245
   641
    fun app (fT, (v, T)) t = valapp T fT $ t $ Free (v, termifyT T);
wenzelm@33245
   642
  in fold app (mk_fTs Ts T ~~ vs) tt end;
haftmann@31463
   643
haftmann@31183
   644
haftmann@31183
   645
(* open state monads *)
haftmann@31183
   646
haftmann@31183
   647
fun mk_return T U x = pair_const T U $ x;
haftmann@31183
   648
haftmann@31183
   649
fun mk_ST clauses t U (someT, V) =
haftmann@31183
   650
  let
haftmann@31183
   651
    val R = case someT of SOME T => mk_prodT (T, V) | NONE => V
haftmann@31183
   652
    fun mk_clause ((t, U), SOME (v, T)) (t', U') =
haftmann@31183
   653
          (Const ("Product_Type.scomp", (U --> mk_prodT (T, U')) --> (T --> U' --> R) --> U --> R)
haftmann@31183
   654
            $ t $ lambda (Free (v, T)) t', U)
haftmann@31183
   655
      | mk_clause ((t, U), NONE) (t', U') =
haftmann@31183
   656
          (Const ("Product_Type.fcomp", (U --> U') --> (U' --> R) --> U --> R)
haftmann@31183
   657
            $ t $ t', U)
haftmann@31183
   658
  in fold_rev mk_clause clauses (t, U) |> fst end;
haftmann@31135
   659
haftmann@31463
   660
val code_numeralT = Type ("Code_Numeral.code_numeral", []);
haftmann@31463
   661
val random_seedT = mk_prodT (code_numeralT, code_numeralT);
haftmann@31463
   662
haftmann@31463
   663
fun mk_random T t = Const ("Quickcheck.random_class.random", code_numeralT
haftmann@31463
   664
  --> random_seedT --> mk_prodT (mk_prodT (T, unitT --> termT), random_seedT)) $ t;
haftmann@31463
   665
clasohm@923
   666
end;