haftmann [Mon, 18 May 2009 09:47:34 +0200] rev 31189
merged
haftmann [Sat, 16 May 2009 20:18:29 +0200] rev 31188
merged
haftmann [Sat, 16 May 2009 20:18:05 +0200] rev 31187
merged
haftmann [Sat, 16 May 2009 20:16:49 +0200] rev 31186
experimental move of Quickcheck and related theories to HOL image
haftmann [Fri, 15 May 2009 16:52:28 +0200] rev 31185
experimental addition of quickcheck
haftmann [Fri, 15 May 2009 16:39:19 +0200] rev 31184
adjusted to changes in theory Quickcheck
haftmann [Fri, 15 May 2009 16:39:18 +0200] rev 31183
combinators for single-threaded operations
haftmann [Fri, 15 May 2009 16:39:18 +0200] rev 31182
tuned code postprocessor
haftmann [Fri, 15 May 2009 16:39:17 +0200] rev 31181
dropped theory Term_Of_Syntax
haftmann [Fri, 15 May 2009 16:39:16 +0200] rev 31180
hide names in theory Random
haftmann [Fri, 15 May 2009 16:39:16 +0200] rev 31179
experimental addition of quickcheck
haftmann [Fri, 15 May 2009 16:39:15 +0200] rev 31178
syntax support for term expressions
haftmann [Mon, 18 May 2009 09:48:06 +0200] rev 31177
introduced Thm.generatedK
haftmann [Sun, 17 May 2009 07:17:39 +0200] rev 31176
is a definition
bulwahn [Sat, 16 May 2009 20:18:26 +0200] rev 31175
merged
bulwahn [Sat, 16 May 2009 20:17:59 +0200] rev 31174
added new kind generated_theorem for theorems which are generated by packages to distinguish between theorems from users and packages
bulwahn [Sat, 16 May 2009 15:24:35 +0200] rev 31173
merged
bulwahn [Sat, 16 May 2009 15:23:52 +0200] rev 31172
added collection of simplification rules of recursive functions for quickcheck
bulwahn [Sat, 16 May 2009 10:19:01 +0200] rev 31171
merged
bulwahn [Fri, 15 May 2009 15:56:28 +0200] rev 31170
added predicate transformation function for code generation
bulwahn [Fri, 15 May 2009 15:29:34 +0200] rev 31169
added predicate transformation function for code generation
nipkow [Sat, 16 May 2009 17:44:11 +0200] rev 31168
proof tuned
nipkow [Sat, 16 May 2009 11:28:23 +0200] rev 31167
merged
nipkow [Sat, 16 May 2009 11:28:02 +0200] rev 31166
"{x. P x & x=t & Q x}" is now rewritten to "if P t & Q t then {t} else {}"
by the new simproc defColl_regroup. More precisely, the simproc pulls an
equation x=t (or t=x) out of a nest of conjunctions to the front where the
simp rule singleton_conj_conv(2) converts to "if".
huffman [Fri, 15 May 2009 15:13:09 -0700] rev 31165
merged
huffman [Fri, 15 May 2009 15:12:23 -0700] rev 31164
continuity proofs for approx function on deflations; lemma cast_below_imp_below
huffman [Tue, 12 May 2009 12:16:33 -0700] rev 31163
allow lazy domain arguments to have class cpo
huffman [Tue, 12 May 2009 12:01:25 -0700] rev 31162
add cpo_type function
huffman [Tue, 12 May 2009 11:37:40 -0700] rev 31161
fix domain package parsing of lhs sort constraints
huffman [Tue, 12 May 2009 10:40:09 -0700] rev 31160
export quiet_mode and trace_domain refs for domain package