src/HOL/Random.thy
author wenzelm
Sat, 07 Apr 2012 16:41:59 +0200
changeset 47389 e8552cba702d
parent 46311 56fae81902ce
child 51143 0a2371e7ced3
permissions -rw-r--r--
explicit checks stable_finished_theory/stable_command allow parallel asynchronous command transactions; tuned;
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
36020
3ee4c29ead7f adding values command for new monad; added new random monad compilation to predicate_compile_quickcheck
bulwahn
parents: 35266
diff changeset
     1
29815
9e94b7078fa5 mandatory prefix for index conversion operations
haftmann
parents: 29806
diff changeset
     2
(* Author: Florian Haftmann, TU Muenchen *)
22528
8501c4a62a3c cleaned up HOL/ex/Code*.thy
haftmann
parents:
diff changeset
     3
26265
4b63b9e9b10d separated Random.thy from Quickcheck.thy
haftmann
parents: 26261
diff changeset
     4
header {* A HOL random engine *}
22528
8501c4a62a3c cleaned up HOL/ex/Code*.thy
haftmann
parents:
diff changeset
     5
8501c4a62a3c cleaned up HOL/ex/Code*.thy
haftmann
parents:
diff changeset
     6
theory Random
31205
98370b26c2ce String.literal replaces message_string, code_numeral replaces (code_)index
haftmann
parents: 31203
diff changeset
     7
imports Code_Numeral List
22528
8501c4a62a3c cleaned up HOL/ex/Code*.thy
haftmann
parents:
diff changeset
     8
begin
8501c4a62a3c cleaned up HOL/ex/Code*.thy
haftmann
parents:
diff changeset
     9
37751
89e16802b6cc nicer xsymbol syntax for fcomp and scomp
haftmann
parents: 36538
diff changeset
    10
notation fcomp (infixl "\<circ>>" 60)
89e16802b6cc nicer xsymbol syntax for fcomp and scomp
haftmann
parents: 36538
diff changeset
    11
notation scomp (infixl "\<circ>\<rightarrow>" 60)
29823
0ab754d13ccd session Reflecion renamed to Decision_Procs, moved Dense_Linear_Order there
haftmann
parents: 29815
diff changeset
    12
0ab754d13ccd session Reflecion renamed to Decision_Procs, moved Dense_Linear_Order there
haftmann
parents: 29815
diff changeset
    13
26265
4b63b9e9b10d separated Random.thy from Quickcheck.thy
haftmann
parents: 26261
diff changeset
    14
subsection {* Auxiliary functions *}
4b63b9e9b10d separated Random.thy from Quickcheck.thy
haftmann
parents: 26261
diff changeset
    15
33236
haftmann
parents: 32740
diff changeset
    16
fun log :: "code_numeral \<Rightarrow> code_numeral \<Rightarrow> code_numeral" where
haftmann
parents: 32740
diff changeset
    17
  "log b i = (if b \<le> 1 \<or> i < b then 1 else 1 + log b (i div b))"
haftmann
parents: 32740
diff changeset
    18
31205
98370b26c2ce String.literal replaces message_string, code_numeral replaces (code_)index
haftmann
parents: 31203
diff changeset
    19
definition inc_shift :: "code_numeral \<Rightarrow> code_numeral \<Rightarrow> code_numeral" where
26265
4b63b9e9b10d separated Random.thy from Quickcheck.thy
haftmann
parents: 26261
diff changeset
    20
  "inc_shift v k = (if v = k then 1 else k + 1)"
4b63b9e9b10d separated Random.thy from Quickcheck.thy
haftmann
parents: 26261
diff changeset
    21
31205
98370b26c2ce String.literal replaces message_string, code_numeral replaces (code_)index
haftmann
parents: 31203
diff changeset
    22
definition minus_shift :: "code_numeral \<Rightarrow> code_numeral \<Rightarrow> code_numeral \<Rightarrow> code_numeral" where
26265
4b63b9e9b10d separated Random.thy from Quickcheck.thy
haftmann
parents: 26261
diff changeset
    23
  "minus_shift r k l = (if k < l then r + k - l else k - l)"
4b63b9e9b10d separated Random.thy from Quickcheck.thy
haftmann
parents: 26261
diff changeset
    24
30495
haftmann
parents: 29823
diff changeset
    25
26265
4b63b9e9b10d separated Random.thy from Quickcheck.thy
haftmann
parents: 26261
diff changeset
    26
subsection {* Random seeds *}
26038
55a02586776d towards quickcheck
haftmann
parents: 24994
diff changeset
    27
42163
392fd6c4669c renewing specifications in HOL: replacing types by type_synonym
bulwahn
parents: 39302
diff changeset
    28
type_synonym seed = "code_numeral \<times> code_numeral"
22528
8501c4a62a3c cleaned up HOL/ex/Code*.thy
haftmann
parents:
diff changeset
    29
31205
98370b26c2ce String.literal replaces message_string, code_numeral replaces (code_)index
haftmann
parents: 31203
diff changeset
    30
primrec "next" :: "seed \<Rightarrow> code_numeral \<times> seed" where
26265
4b63b9e9b10d separated Random.thy from Quickcheck.thy
haftmann
parents: 26261
diff changeset
    31
  "next (v, w) = (let
4b63b9e9b10d separated Random.thy from Quickcheck.thy
haftmann
parents: 26261
diff changeset
    32
     k =  v div 53668;
33236
haftmann
parents: 32740
diff changeset
    33
     v' = minus_shift 2147483563 ((v mod 53668) * 40014) (k * 12211);
26265
4b63b9e9b10d separated Random.thy from Quickcheck.thy
haftmann
parents: 26261
diff changeset
    34
     l =  w div 52774;
33236
haftmann
parents: 32740
diff changeset
    35
     w' = minus_shift 2147483399 ((w mod 52774) * 40692) (l * 3791);
26265
4b63b9e9b10d separated Random.thy from Quickcheck.thy
haftmann
parents: 26261
diff changeset
    36
     z =  minus_shift 2147483562 v' (w' + 1) + 1
4b63b9e9b10d separated Random.thy from Quickcheck.thy
haftmann
parents: 26261
diff changeset
    37
   in (z, (v', w')))"
4b63b9e9b10d separated Random.thy from Quickcheck.thy
haftmann
parents: 26261
diff changeset
    38
29823
0ab754d13ccd session Reflecion renamed to Decision_Procs, moved Dense_Linear_Order there
haftmann
parents: 29815
diff changeset
    39
definition split_seed :: "seed \<Rightarrow> seed \<times> seed" where
26038
55a02586776d towards quickcheck
haftmann
parents: 24994
diff changeset
    40
  "split_seed s = (let
55a02586776d towards quickcheck
haftmann
parents: 24994
diff changeset
    41
     (v, w) = s;
55a02586776d towards quickcheck
haftmann
parents: 24994
diff changeset
    42
     (v', w') = snd (next s);
26265
4b63b9e9b10d separated Random.thy from Quickcheck.thy
haftmann
parents: 26261
diff changeset
    43
     v'' = inc_shift 2147483562 v;
33236
haftmann
parents: 32740
diff changeset
    44
     w'' = inc_shift 2147483398 w
haftmann
parents: 32740
diff changeset
    45
   in ((v'', w'), (v', w'')))"
26038
55a02586776d towards quickcheck
haftmann
parents: 24994
diff changeset
    46
55a02586776d towards quickcheck
haftmann
parents: 24994
diff changeset
    47
26265
4b63b9e9b10d separated Random.thy from Quickcheck.thy
haftmann
parents: 26261
diff changeset
    48
subsection {* Base selectors *}
22528
8501c4a62a3c cleaned up HOL/ex/Code*.thy
haftmann
parents:
diff changeset
    49
31205
98370b26c2ce String.literal replaces message_string, code_numeral replaces (code_)index
haftmann
parents: 31203
diff changeset
    50
fun iterate :: "code_numeral \<Rightarrow> ('b \<Rightarrow> 'a \<Rightarrow> 'b \<times> 'a) \<Rightarrow> 'b \<Rightarrow> 'a \<Rightarrow> 'b \<times> 'a" where
37751
89e16802b6cc nicer xsymbol syntax for fcomp and scomp
haftmann
parents: 36538
diff changeset
    51
  "iterate k f x = (if k = 0 then Pair x else f x \<circ>\<rightarrow> iterate (k - 1) f)"
22528
8501c4a62a3c cleaned up HOL/ex/Code*.thy
haftmann
parents:
diff changeset
    52
31205
98370b26c2ce String.literal replaces message_string, code_numeral replaces (code_)index
haftmann
parents: 31203
diff changeset
    53
definition range :: "code_numeral \<Rightarrow> seed \<Rightarrow> code_numeral \<times> seed" where
30495
haftmann
parents: 29823
diff changeset
    54
  "range k = iterate (log 2147483561 k)
37751
89e16802b6cc nicer xsymbol syntax for fcomp and scomp
haftmann
parents: 36538
diff changeset
    55
      (\<lambda>l. next \<circ>\<rightarrow> (\<lambda>v. Pair (v + l * 2147483561))) 1
89e16802b6cc nicer xsymbol syntax for fcomp and scomp
haftmann
parents: 36538
diff changeset
    56
    \<circ>\<rightarrow> (\<lambda>v. Pair (v mod k))"
26265
4b63b9e9b10d separated Random.thy from Quickcheck.thy
haftmann
parents: 26261
diff changeset
    57
4b63b9e9b10d separated Random.thy from Quickcheck.thy
haftmann
parents: 26261
diff changeset
    58
lemma range:
30495
haftmann
parents: 29823
diff changeset
    59
  "k > 0 \<Longrightarrow> fst (range k s) < k"
44921
58eef4843641 tuned proofs
huffman
parents: 42163
diff changeset
    60
  by (simp add: range_def split_def del: log.simps iterate.simps)
26038
55a02586776d towards quickcheck
haftmann
parents: 24994
diff changeset
    61
29823
0ab754d13ccd session Reflecion renamed to Decision_Procs, moved Dense_Linear_Order there
haftmann
parents: 29815
diff changeset
    62
definition select :: "'a list \<Rightarrow> seed \<Rightarrow> 'a \<times> seed" where
31205
98370b26c2ce String.literal replaces message_string, code_numeral replaces (code_)index
haftmann
parents: 31203
diff changeset
    63
  "select xs = range (Code_Numeral.of_nat (length xs))
37751
89e16802b6cc nicer xsymbol syntax for fcomp and scomp
haftmann
parents: 36538
diff changeset
    64
    \<circ>\<rightarrow> (\<lambda>k. Pair (nth xs (Code_Numeral.nat_of k)))"
29823
0ab754d13ccd session Reflecion renamed to Decision_Procs, moved Dense_Linear_Order there
haftmann
parents: 29815
diff changeset
    65
     
26265
4b63b9e9b10d separated Random.thy from Quickcheck.thy
haftmann
parents: 26261
diff changeset
    66
lemma select:
4b63b9e9b10d separated Random.thy from Quickcheck.thy
haftmann
parents: 26261
diff changeset
    67
  assumes "xs \<noteq> []"
4b63b9e9b10d separated Random.thy from Quickcheck.thy
haftmann
parents: 26261
diff changeset
    68
  shows "fst (select xs s) \<in> set xs"
4b63b9e9b10d separated Random.thy from Quickcheck.thy
haftmann
parents: 26261
diff changeset
    69
proof -
31205
98370b26c2ce String.literal replaces message_string, code_numeral replaces (code_)index
haftmann
parents: 31203
diff changeset
    70
  from assms have "Code_Numeral.of_nat (length xs) > 0" by simp
26265
4b63b9e9b10d separated Random.thy from Quickcheck.thy
haftmann
parents: 26261
diff changeset
    71
  with range have
31205
98370b26c2ce String.literal replaces message_string, code_numeral replaces (code_)index
haftmann
parents: 31203
diff changeset
    72
    "fst (range (Code_Numeral.of_nat (length xs)) s) < Code_Numeral.of_nat (length xs)" by best
26265
4b63b9e9b10d separated Random.thy from Quickcheck.thy
haftmann
parents: 26261
diff changeset
    73
  then have
31205
98370b26c2ce String.literal replaces message_string, code_numeral replaces (code_)index
haftmann
parents: 31203
diff changeset
    74
    "Code_Numeral.nat_of (fst (range (Code_Numeral.of_nat (length xs)) s)) < length xs" by simp
26265
4b63b9e9b10d separated Random.thy from Quickcheck.thy
haftmann
parents: 26261
diff changeset
    75
  then show ?thesis
44921
58eef4843641 tuned proofs
huffman
parents: 42163
diff changeset
    76
    by (simp add: split_beta select_def)
26265
4b63b9e9b10d separated Random.thy from Quickcheck.thy
haftmann
parents: 26261
diff changeset
    77
qed
22528
8501c4a62a3c cleaned up HOL/ex/Code*.thy
haftmann
parents:
diff changeset
    78
31205
98370b26c2ce String.literal replaces message_string, code_numeral replaces (code_)index
haftmann
parents: 31203
diff changeset
    79
primrec pick :: "(code_numeral \<times> 'a) list \<Rightarrow> code_numeral \<Rightarrow> 'a" where
31180
dae7be64d614 hide names in theory Random
haftmann
parents: 30500
diff changeset
    80
  "pick (x # xs) i = (if i < fst x then snd x else pick xs (i - fst x))"
dae7be64d614 hide names in theory Random
haftmann
parents: 30500
diff changeset
    81
dae7be64d614 hide names in theory Random
haftmann
parents: 30500
diff changeset
    82
lemma pick_member:
dae7be64d614 hide names in theory Random
haftmann
parents: 30500
diff changeset
    83
  "i < listsum (map fst xs) \<Longrightarrow> pick xs i \<in> set (map snd xs)"
dae7be64d614 hide names in theory Random
haftmann
parents: 30500
diff changeset
    84
  by (induct xs arbitrary: i) simp_all
dae7be64d614 hide names in theory Random
haftmann
parents: 30500
diff changeset
    85
dae7be64d614 hide names in theory Random
haftmann
parents: 30500
diff changeset
    86
lemma pick_drop_zero:
dae7be64d614 hide names in theory Random
haftmann
parents: 30500
diff changeset
    87
  "pick (filter (\<lambda>(k, _). k > 0) xs) = pick xs"
39302
d7728f65b353 renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents: 39198
diff changeset
    88
  by (induct xs) (auto simp add: fun_eq_iff)
31180
dae7be64d614 hide names in theory Random
haftmann
parents: 30500
diff changeset
    89
31203
5c8fb4fd67e0 moved Code_Index, Random and Quickcheck before Main
haftmann
parents: 31196
diff changeset
    90
lemma pick_same:
31205
98370b26c2ce String.literal replaces message_string, code_numeral replaces (code_)index
haftmann
parents: 31203
diff changeset
    91
  "l < length xs \<Longrightarrow> Random.pick (map (Pair 1) xs) (Code_Numeral.of_nat l) = nth xs l"
31203
5c8fb4fd67e0 moved Code_Index, Random and Quickcheck before Main
haftmann
parents: 31196
diff changeset
    92
proof (induct xs arbitrary: l)
5c8fb4fd67e0 moved Code_Index, Random and Quickcheck before Main
haftmann
parents: 31196
diff changeset
    93
  case Nil then show ?case by simp
5c8fb4fd67e0 moved Code_Index, Random and Quickcheck before Main
haftmann
parents: 31196
diff changeset
    94
next
5c8fb4fd67e0 moved Code_Index, Random and Quickcheck before Main
haftmann
parents: 31196
diff changeset
    95
  case (Cons x xs) then show ?case by (cases l) simp_all
5c8fb4fd67e0 moved Code_Index, Random and Quickcheck before Main
haftmann
parents: 31196
diff changeset
    96
qed
5c8fb4fd67e0 moved Code_Index, Random and Quickcheck before Main
haftmann
parents: 31196
diff changeset
    97
31205
98370b26c2ce String.literal replaces message_string, code_numeral replaces (code_)index
haftmann
parents: 31203
diff changeset
    98
definition select_weight :: "(code_numeral \<times> 'a) list \<Rightarrow> seed \<Rightarrow> 'a \<times> seed" where
31180
dae7be64d614 hide names in theory Random
haftmann
parents: 30500
diff changeset
    99
  "select_weight xs = range (listsum (map fst xs))
37751
89e16802b6cc nicer xsymbol syntax for fcomp and scomp
haftmann
parents: 36538
diff changeset
   100
   \<circ>\<rightarrow> (\<lambda>k. Pair (pick xs k))"
31180
dae7be64d614 hide names in theory Random
haftmann
parents: 30500
diff changeset
   101
dae7be64d614 hide names in theory Random
haftmann
parents: 30500
diff changeset
   102
lemma select_weight_member:
dae7be64d614 hide names in theory Random
haftmann
parents: 30500
diff changeset
   103
  assumes "0 < listsum (map fst xs)"
dae7be64d614 hide names in theory Random
haftmann
parents: 30500
diff changeset
   104
  shows "fst (select_weight xs s) \<in> set (map snd xs)"
dae7be64d614 hide names in theory Random
haftmann
parents: 30500
diff changeset
   105
proof -
dae7be64d614 hide names in theory Random
haftmann
parents: 30500
diff changeset
   106
  from range assms
dae7be64d614 hide names in theory Random
haftmann
parents: 30500
diff changeset
   107
    have "fst (range (listsum (map fst xs)) s) < listsum (map fst xs)" .
dae7be64d614 hide names in theory Random
haftmann
parents: 30500
diff changeset
   108
  with pick_member
dae7be64d614 hide names in theory Random
haftmann
parents: 30500
diff changeset
   109
    have "pick xs (fst (range (listsum (map fst xs)) s)) \<in> set (map snd xs)" .
dae7be64d614 hide names in theory Random
haftmann
parents: 30500
diff changeset
   110
  then show ?thesis by (simp add: select_weight_def scomp_def split_def) 
dae7be64d614 hide names in theory Random
haftmann
parents: 30500
diff changeset
   111
qed
dae7be64d614 hide names in theory Random
haftmann
parents: 30500
diff changeset
   112
31268
3ced22320ceb added lemma select_weight_cons_zero
haftmann
parents: 31261
diff changeset
   113
lemma select_weight_cons_zero:
3ced22320ceb added lemma select_weight_cons_zero
haftmann
parents: 31261
diff changeset
   114
  "select_weight ((0, x) # xs) = select_weight xs"
3ced22320ceb added lemma select_weight_cons_zero
haftmann
parents: 31261
diff changeset
   115
  by (simp add: select_weight_def)
3ced22320ceb added lemma select_weight_cons_zero
haftmann
parents: 31261
diff changeset
   116
46311
56fae81902ce random instance for sets
bulwahn
parents: 44921
diff changeset
   117
lemma select_weight_drop_zero:
31261
900ebbc35e30 dropped superfluos prefixes
haftmann
parents: 31205
diff changeset
   118
  "select_weight (filter (\<lambda>(k, _). k > 0) xs) = select_weight xs"
31203
5c8fb4fd67e0 moved Code_Index, Random and Quickcheck before Main
haftmann
parents: 31196
diff changeset
   119
proof -
5c8fb4fd67e0 moved Code_Index, Random and Quickcheck before Main
haftmann
parents: 31196
diff changeset
   120
  have "listsum (map fst [(k, _)\<leftarrow>xs . 0 < k]) = listsum (map fst xs)"
5c8fb4fd67e0 moved Code_Index, Random and Quickcheck before Main
haftmann
parents: 31196
diff changeset
   121
    by (induct xs) auto
5c8fb4fd67e0 moved Code_Index, Random and Quickcheck before Main
haftmann
parents: 31196
diff changeset
   122
  then show ?thesis by (simp only: select_weight_def pick_drop_zero)
5c8fb4fd67e0 moved Code_Index, Random and Quickcheck before Main
haftmann
parents: 31196
diff changeset
   123
qed
5c8fb4fd67e0 moved Code_Index, Random and Quickcheck before Main
haftmann
parents: 31196
diff changeset
   124
46311
56fae81902ce random instance for sets
bulwahn
parents: 44921
diff changeset
   125
lemma select_weight_select:
31203
5c8fb4fd67e0 moved Code_Index, Random and Quickcheck before Main
haftmann
parents: 31196
diff changeset
   126
  assumes "xs \<noteq> []"
31261
900ebbc35e30 dropped superfluos prefixes
haftmann
parents: 31205
diff changeset
   127
  shows "select_weight (map (Pair 1) xs) = select xs"
31203
5c8fb4fd67e0 moved Code_Index, Random and Quickcheck before Main
haftmann
parents: 31196
diff changeset
   128
proof -
31261
900ebbc35e30 dropped superfluos prefixes
haftmann
parents: 31205
diff changeset
   129
  have less: "\<And>s. fst (range (Code_Numeral.of_nat (length xs)) s) < Code_Numeral.of_nat (length xs)"
31203
5c8fb4fd67e0 moved Code_Index, Random and Quickcheck before Main
haftmann
parents: 31196
diff changeset
   130
    using assms by (intro range) simp
31205
98370b26c2ce String.literal replaces message_string, code_numeral replaces (code_)index
haftmann
parents: 31203
diff changeset
   131
  moreover have "listsum (map fst (map (Pair 1) xs)) = Code_Numeral.of_nat (length xs)"
31203
5c8fb4fd67e0 moved Code_Index, Random and Quickcheck before Main
haftmann
parents: 31196
diff changeset
   132
    by (induct xs) simp_all
5c8fb4fd67e0 moved Code_Index, Random and Quickcheck before Main
haftmann
parents: 31196
diff changeset
   133
  ultimately show ?thesis
5c8fb4fd67e0 moved Code_Index, Random and Quickcheck before Main
haftmann
parents: 31196
diff changeset
   134
    by (auto simp add: select_weight_def select_def scomp_def split_def
39302
d7728f65b353 renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents: 39198
diff changeset
   135
      fun_eq_iff pick_same [symmetric])
31203
5c8fb4fd67e0 moved Code_Index, Random and Quickcheck before Main
haftmann
parents: 31196
diff changeset
   136
qed
5c8fb4fd67e0 moved Code_Index, Random and Quickcheck before Main
haftmann
parents: 31196
diff changeset
   137
26265
4b63b9e9b10d separated Random.thy from Quickcheck.thy
haftmann
parents: 26261
diff changeset
   138
4b63b9e9b10d separated Random.thy from Quickcheck.thy
haftmann
parents: 26261
diff changeset
   139
subsection {* @{text ML} interface *}
22528
8501c4a62a3c cleaned up HOL/ex/Code*.thy
haftmann
parents:
diff changeset
   140
36538
4fe16d49283b make random engine persistent using code_reflect
haftmann
parents: 36176
diff changeset
   141
code_reflect Random_Engine
4fe16d49283b make random engine persistent using code_reflect
haftmann
parents: 36176
diff changeset
   142
  functions range select select_weight
4fe16d49283b make random engine persistent using code_reflect
haftmann
parents: 36176
diff changeset
   143
22528
8501c4a62a3c cleaned up HOL/ex/Code*.thy
haftmann
parents:
diff changeset
   144
ML {*
26265
4b63b9e9b10d separated Random.thy from Quickcheck.thy
haftmann
parents: 26261
diff changeset
   145
structure Random_Engine =
22528
8501c4a62a3c cleaned up HOL/ex/Code*.thy
haftmann
parents:
diff changeset
   146
struct
8501c4a62a3c cleaned up HOL/ex/Code*.thy
haftmann
parents:
diff changeset
   147
36538
4fe16d49283b make random engine persistent using code_reflect
haftmann
parents: 36176
diff changeset
   148
open Random_Engine;
4fe16d49283b make random engine persistent using code_reflect
haftmann
parents: 36176
diff changeset
   149
26038
55a02586776d towards quickcheck
haftmann
parents: 24994
diff changeset
   150
type seed = int * int;
22528
8501c4a62a3c cleaned up HOL/ex/Code*.thy
haftmann
parents:
diff changeset
   151
8501c4a62a3c cleaned up HOL/ex/Code*.thy
haftmann
parents:
diff changeset
   152
local
26038
55a02586776d towards quickcheck
haftmann
parents: 24994
diff changeset
   153
32740
9dd0a2f83429 explicit indication of Unsynchronized.ref;
wenzelm
parents: 31636
diff changeset
   154
val seed = Unsynchronized.ref 
26265
4b63b9e9b10d separated Random.thy from Quickcheck.thy
haftmann
parents: 26261
diff changeset
   155
  (let
4b63b9e9b10d separated Random.thy from Quickcheck.thy
haftmann
parents: 26261
diff changeset
   156
    val now = Time.toMilliseconds (Time.now ());
26038
55a02586776d towards quickcheck
haftmann
parents: 24994
diff changeset
   157
    val (q, s1) = IntInf.divMod (now, 2147483562);
55a02586776d towards quickcheck
haftmann
parents: 24994
diff changeset
   158
    val s2 = q mod 2147483398;
26265
4b63b9e9b10d separated Random.thy from Quickcheck.thy
haftmann
parents: 26261
diff changeset
   159
  in (s1 + 1, s2 + 1) end);
4b63b9e9b10d separated Random.thy from Quickcheck.thy
haftmann
parents: 26261
diff changeset
   160
22528
8501c4a62a3c cleaned up HOL/ex/Code*.thy
haftmann
parents:
diff changeset
   161
in
26038
55a02586776d towards quickcheck
haftmann
parents: 24994
diff changeset
   162
36020
3ee4c29ead7f adding values command for new monad; added new random monad compilation to predicate_compile_quickcheck
bulwahn
parents: 35266
diff changeset
   163
fun next_seed () =
3ee4c29ead7f adding values command for new monad; added new random monad compilation to predicate_compile_quickcheck
bulwahn
parents: 35266
diff changeset
   164
  let
3ee4c29ead7f adding values command for new monad; added new random monad compilation to predicate_compile_quickcheck
bulwahn
parents: 35266
diff changeset
   165
    val (seed1, seed') = @{code split_seed} (! seed)
3ee4c29ead7f adding values command for new monad; added new random monad compilation to predicate_compile_quickcheck
bulwahn
parents: 35266
diff changeset
   166
    val _ = seed := seed'
3ee4c29ead7f adding values command for new monad; added new random monad compilation to predicate_compile_quickcheck
bulwahn
parents: 35266
diff changeset
   167
  in
3ee4c29ead7f adding values command for new monad; added new random monad compilation to predicate_compile_quickcheck
bulwahn
parents: 35266
diff changeset
   168
    seed1
3ee4c29ead7f adding values command for new monad; added new random monad compilation to predicate_compile_quickcheck
bulwahn
parents: 35266
diff changeset
   169
  end
3ee4c29ead7f adding values command for new monad; added new random monad compilation to predicate_compile_quickcheck
bulwahn
parents: 35266
diff changeset
   170
26038
55a02586776d towards quickcheck
haftmann
parents: 24994
diff changeset
   171
fun run f =
55a02586776d towards quickcheck
haftmann
parents: 24994
diff changeset
   172
  let
26265
4b63b9e9b10d separated Random.thy from Quickcheck.thy
haftmann
parents: 26261
diff changeset
   173
    val (x, seed') = f (! seed);
26038
55a02586776d towards quickcheck
haftmann
parents: 24994
diff changeset
   174
    val _ = seed := seed'
55a02586776d towards quickcheck
haftmann
parents: 24994
diff changeset
   175
  in x end;
55a02586776d towards quickcheck
haftmann
parents: 24994
diff changeset
   176
22528
8501c4a62a3c cleaned up HOL/ex/Code*.thy
haftmann
parents:
diff changeset
   177
end;
8501c4a62a3c cleaned up HOL/ex/Code*.thy
haftmann
parents:
diff changeset
   178
8501c4a62a3c cleaned up HOL/ex/Code*.thy
haftmann
parents:
diff changeset
   179
end;
8501c4a62a3c cleaned up HOL/ex/Code*.thy
haftmann
parents:
diff changeset
   180
*}
8501c4a62a3c cleaned up HOL/ex/Code*.thy
haftmann
parents:
diff changeset
   181
36176
3fe7e97ccca8 replaced generic 'hide' command by more conventional 'hide_class', 'hide_type', 'hide_const', 'hide_fact' -- frees some popular keywords;
wenzelm
parents: 36020
diff changeset
   182
hide_type (open) seed
3fe7e97ccca8 replaced generic 'hide' command by more conventional 'hide_class', 'hide_type', 'hide_const', 'hide_fact' -- frees some popular keywords;
wenzelm
parents: 36020
diff changeset
   183
hide_const (open) inc_shift minus_shift log "next" split_seed
31636
138625ae4067 where there is nothing, nothing can be hidden
haftmann
parents: 31633
diff changeset
   184
  iterate range select pick select_weight
36176
3fe7e97ccca8 replaced generic 'hide' command by more conventional 'hide_class', 'hide_type', 'hide_const', 'hide_fact' -- frees some popular keywords;
wenzelm
parents: 36020
diff changeset
   185
hide_fact (open) range_def
31180
dae7be64d614 hide names in theory Random
haftmann
parents: 30500
diff changeset
   186
37751
89e16802b6cc nicer xsymbol syntax for fcomp and scomp
haftmann
parents: 36538
diff changeset
   187
no_notation fcomp (infixl "\<circ>>" 60)
89e16802b6cc nicer xsymbol syntax for fcomp and scomp
haftmann
parents: 36538
diff changeset
   188
no_notation scomp (infixl "\<circ>\<rightarrow>" 60)
29823
0ab754d13ccd session Reflecion renamed to Decision_Procs, moved Dense_Linear_Order there
haftmann
parents: 29815
diff changeset
   189
26038
55a02586776d towards quickcheck
haftmann
parents: 24994
diff changeset
   190
end