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