Wed, 08 Dec 2010 22:17:52 +0100 split "Sledgehammer" module into two parts, to resolve forthcoming dependency problems
blanchet [Wed, 08 Dec 2010 22:17:52 +0100] rev 41087
split "Sledgehammer" module into two parts, to resolve forthcoming dependency problems
Wed, 08 Dec 2010 18:07:04 +0100 if only finite types and no real datatypes occur in the quantifiers only enumerate cardinality not size in quickcheck
bulwahn [Wed, 08 Dec 2010 18:07:04 +0100] rev 41086
if only finite types and no real datatypes occur in the quantifiers only enumerate cardinality not size in quickcheck
Wed, 08 Dec 2010 18:07:03 +0100 adding a smarter enumeration scheme for finite functions
bulwahn [Wed, 08 Dec 2010 18:07:03 +0100] rev 41085
adding a smarter enumeration scheme for finite functions
Wed, 08 Dec 2010 16:47:57 +0100 merged
haftmann [Wed, 08 Dec 2010 16:47:57 +0100] rev 41084
merged
Wed, 08 Dec 2010 16:47:45 +0100 work around problems with eta-expansion of equations
haftmann [Wed, 08 Dec 2010 16:47:45 +0100] rev 41083
work around problems with eta-expansion of equations
Wed, 08 Dec 2010 15:05:46 +0100 bot comes before top, inf before sup etc.
haftmann [Wed, 08 Dec 2010 15:05:46 +0100] rev 41082
bot comes before top, inf before sup etc.
Wed, 08 Dec 2010 14:52:23 +0100 tuned
haftmann [Wed, 08 Dec 2010 14:52:23 +0100] rev 41081
tuned
Wed, 08 Dec 2010 14:52:23 +0100 nice syntax for lattice INFI, SUPR;
haftmann [Wed, 08 Dec 2010 14:52:23 +0100] rev 41080
nice syntax for lattice INFI, SUPR; various *_apply rules for lattice operations on fun; more default simplification rules
Wed, 08 Dec 2010 14:52:23 +0100 NEWS
haftmann [Wed, 08 Dec 2010 14:52:23 +0100] rev 41079
NEWS
Wed, 08 Dec 2010 14:25:08 +0100 adding more efficient implementations for quantifiers in Enum
bulwahn [Wed, 08 Dec 2010 14:25:08 +0100] rev 41078
adding more efficient implementations for quantifiers in Enum
Wed, 08 Dec 2010 14:25:07 +0100 improving the mutabelle script
bulwahn [Wed, 08 Dec 2010 14:25:07 +0100] rev 41077
improving the mutabelle script
Wed, 08 Dec 2010 13:34:51 +0100 primitive definitions of bot/top/inf/sup for bool and fun are named with canonical suffix `_def` rather than `_eq`;
haftmann [Wed, 08 Dec 2010 13:34:51 +0100] rev 41076
primitive definitions of bot/top/inf/sup for bool and fun are named with canonical suffix `_def` rather than `_eq`; tuned
Wed, 08 Dec 2010 13:34:50 +0100 primitive definitions of bot/top/inf/sup for bool and fun are named with canonical suffix `_def` rather than `_eq`
haftmann [Wed, 08 Dec 2010 13:34:50 +0100] rev 41075
primitive definitions of bot/top/inf/sup for bool and fun are named with canonical suffix `_def` rather than `_eq`
Wed, 08 Dec 2010 13:34:50 +0100 hide popular names R and B
haftmann [Wed, 08 Dec 2010 13:34:50 +0100] rev 41074
hide popular names R and B
Wed, 08 Dec 2010 08:33:04 +0100 built-in numbers are also built-in terms
boehmes [Wed, 08 Dec 2010 08:33:04 +0100] rev 41073
built-in numbers are also built-in terms
Wed, 08 Dec 2010 08:33:02 +0100 be more flexible: store SMT built-in symbols in generic contexts (not in theory contexts)
boehmes [Wed, 08 Dec 2010 08:33:02 +0100] rev 41072
be more flexible: store SMT built-in symbols in generic contexts (not in theory contexts)
Tue, 07 Dec 2010 21:58:36 +0100 merged
haftmann [Tue, 07 Dec 2010 21:58:36 +0100] rev 41071
merged
Tue, 07 Dec 2010 16:33:54 +0100 more concise case names; proved extensionality
haftmann [Tue, 07 Dec 2010 16:33:54 +0100] rev 41070
more concise case names; proved extensionality
Tue, 07 Dec 2010 16:33:54 +0100 name filter operation just filter (c.f. List.filter and list comprehension syntax)
haftmann [Tue, 07 Dec 2010 16:33:54 +0100] rev 41069
name filter operation just filter (c.f. List.filter and list comprehension syntax)
Tue, 07 Dec 2010 21:32:47 +0100 tuned whitespace
haftmann [Tue, 07 Dec 2010 21:32:47 +0100] rev 41068
tuned whitespace
Tue, 07 Dec 2010 17:23:14 +0100 eliminated some hard tabulators (deprecated);
wenzelm [Tue, 07 Dec 2010 17:23:14 +0100] rev 41067
eliminated some hard tabulators (deprecated);
Tue, 07 Dec 2010 16:27:07 +0100 pass constant arguments to the built-in check function, cf. d2b1fc1b8e19
blanchet [Tue, 07 Dec 2010 16:27:07 +0100] rev 41066
pass constant arguments to the built-in check function, cf. d2b1fc1b8e19
Tue, 07 Dec 2010 15:55:35 +0100 merged
boehmes [Tue, 07 Dec 2010 15:55:35 +0100] rev 41065
merged
Tue, 07 Dec 2010 15:44:38 +0100 updated SMT certificates
boehmes [Tue, 07 Dec 2010 15:44:38 +0100] rev 41064
updated SMT certificates
Tue, 07 Dec 2010 15:01:42 +0100 reduced unnecessary complexity; improved documentation; tuned
boehmes [Tue, 07 Dec 2010 15:01:42 +0100] rev 41063
reduced unnecessary complexity; improved documentation; tuned
Tue, 07 Dec 2010 15:01:37 +0100 tuned
boehmes [Tue, 07 Dec 2010 15:01:37 +0100] rev 41062
tuned
Tue, 07 Dec 2010 14:54:31 +0100 centralized handling of built-in types and constants for bitvectors
boehmes [Tue, 07 Dec 2010 14:54:31 +0100] rev 41061
centralized handling of built-in types and constants for bitvectors
Tue, 07 Dec 2010 14:53:44 +0100 moved smt_word.ML into the directory of the Word library
boehmes [Tue, 07 Dec 2010 14:53:44 +0100] rev 41060
moved smt_word.ML into the directory of the Word library
Tue, 07 Dec 2010 14:53:12 +0100 centralized handling of built-in types and constants;
boehmes [Tue, 07 Dec 2010 14:53:12 +0100] rev 41059
centralized handling of built-in types and constants; also store types and constants which are rewritten during preprocessing; interfaces are identified by classes (supporting inheritance, at least on the level of built-in symbols); removed term_eq in favor of type replacements: term-level occurrences of type bool are replaced by type term_bool (only for the translation)
Mon, 06 Dec 2010 16:54:22 +0100 more aggressive unfolding of unknowns in Z3 models
boehmes [Mon, 06 Dec 2010 16:54:22 +0100] rev 41058
more aggressive unfolding of unknowns in Z3 models
Mon, 06 Dec 2010 15:38:02 +0100 tuned
boehmes [Mon, 06 Dec 2010 15:38:02 +0100] rev 41057
tuned
Tue, 07 Dec 2010 13:33:28 +0100 adding a definition for refl_on which is friendly for quickcheck and nitpick
bulwahn [Tue, 07 Dec 2010 13:33:28 +0100] rev 41056
adding a definition for refl_on which is friendly for quickcheck and nitpick
Tue, 07 Dec 2010 12:10:13 +0100 merged
blanchet [Tue, 07 Dec 2010 12:10:13 +0100] rev 41055
merged
Tue, 07 Dec 2010 11:56:56 +0100 simplify monotonicity code after killing "fin_fun" optimization
blanchet [Tue, 07 Dec 2010 11:56:56 +0100] rev 41054
simplify monotonicity code after killing "fin_fun" optimization
Tue, 07 Dec 2010 11:56:56 +0100 updated Nitpick's documentation w.r.t. finitization
blanchet [Tue, 07 Dec 2010 11:56:56 +0100] rev 41053
updated Nitpick's documentation w.r.t. finitization
Tue, 07 Dec 2010 11:56:53 +0100 remove the "fin_fun" optimization in Nitpick -- it was always a hack and didn't help much
blanchet [Tue, 07 Dec 2010 11:56:53 +0100] rev 41052
remove the "fin_fun" optimization in Nitpick -- it was always a hack and didn't help much
Tue, 07 Dec 2010 11:56:01 +0100 give the inner timeout mechanism a chance, since it gives more precise information to the user
blanchet [Tue, 07 Dec 2010 11:56:01 +0100] rev 41051
give the inner timeout mechanism a chance, since it gives more precise information to the user
Tue, 07 Dec 2010 11:56:01 +0100 updated monotonicity calculus w.r.t. set products
blanchet [Tue, 07 Dec 2010 11:56:01 +0100] rev 41050
updated monotonicity calculus w.r.t. set products
Tue, 07 Dec 2010 11:56:01 +0100 removed needless optimization for image -- there might be cases that benefit from it but there are others where it is clearly evil
blanchet [Tue, 07 Dec 2010 11:56:01 +0100] rev 41049
removed needless optimization for image -- there might be cases that benefit from it but there are others where it is clearly evil
Tue, 07 Dec 2010 11:56:01 +0100 added a hint when the user obviously just forgot a colon after the lemma's name
blanchet [Tue, 07 Dec 2010 11:56:01 +0100] rev 41048
added a hint when the user obviously just forgot a colon after the lemma's name
Tue, 07 Dec 2010 11:56:01 +0100 simplified special handling of set products
blanchet [Tue, 07 Dec 2010 11:56:01 +0100] rev 41047
simplified special handling of set products
Tue, 07 Dec 2010 11:56:01 +0100 fix special handling of set products
blanchet [Tue, 07 Dec 2010 11:56:01 +0100] rev 41046
fix special handling of set products
Tue, 07 Dec 2010 11:56:01 +0100 use heuristic to determine whether to keep or drop an existing "let" -- and drop all higher-order lets
blanchet [Tue, 07 Dec 2010 11:56:01 +0100] rev 41045
use heuristic to determine whether to keep or drop an existing "let" -- and drop all higher-order lets
Tue, 07 Dec 2010 11:50:16 +0100 merged
bulwahn [Tue, 07 Dec 2010 11:50:16 +0100] rev 41044
merged
Tue, 07 Dec 2010 10:03:43 +0100 testing smartly in two dimensions (cardinality and size) in quickcheck
bulwahn [Tue, 07 Dec 2010 10:03:43 +0100] rev 41043
testing smartly in two dimensions (cardinality and size) in quickcheck
Tue, 07 Dec 2010 09:58:56 +0100 load "try" after "Metis" and move "Async_Manager" back to Sledgehammer
blanchet [Tue, 07 Dec 2010 09:58:56 +0100] rev 41042
load "try" after "Metis" and move "Async_Manager" back to Sledgehammer
Tue, 07 Dec 2010 09:58:52 +0100 make SML/NJ happy
blanchet [Tue, 07 Dec 2010 09:58:52 +0100] rev 41041
make SML/NJ happy
Tue, 07 Dec 2010 09:52:07 +0100 merge
blanchet [Tue, 07 Dec 2010 09:52:07 +0100] rev 41040
merge
Mon, 06 Dec 2010 14:47:58 +0100 show strings as "s_1" etc. rather than "l_1" etc.
blanchet [Mon, 06 Dec 2010 14:47:58 +0100] rev 41039
show strings as "s_1" etc. rather than "l_1" etc.
Mon, 06 Dec 2010 14:47:58 +0100 quiet Metis in "try"
blanchet [Mon, 06 Dec 2010 14:47:58 +0100] rev 41038
quiet Metis in "try"
Tue, 07 Dec 2010 09:36:12 +0100 removed experimental equality checking of closures; acknowledge underapproximation of equality in function name
haftmann [Tue, 07 Dec 2010 09:36:12 +0100] rev 41037
removed experimental equality checking of closures; acknowledge underapproximation of equality in function name
Mon, 06 Dec 2010 14:17:35 -0800 add set-union-like syntax for powerdomain bind operators
huffman [Mon, 06 Dec 2010 14:17:35 -0800] rev 41036
add set-union-like syntax for powerdomain bind operators
Mon, 06 Dec 2010 13:43:05 -0800 merged
huffman [Mon, 06 Dec 2010 13:43:05 -0800] rev 41035
merged
Mon, 06 Dec 2010 13:34:05 -0800 instance unit :: domain
huffman [Mon, 06 Dec 2010 13:34:05 -0800] rev 41034
instance unit :: domain
Mon, 06 Dec 2010 12:53:06 -0800 simplify ideal completion proofs
huffman [Mon, 06 Dec 2010 12:53:06 -0800] rev 41033
simplify ideal completion proofs
Mon, 06 Dec 2010 11:44:30 -0800 remove unused lemmas
huffman [Mon, 06 Dec 2010 11:44:30 -0800] rev 41032
remove unused lemmas
Mon, 06 Dec 2010 11:22:42 -0800 remove lemma cont_cfun;
huffman [Mon, 06 Dec 2010 11:22:42 -0800] rev 41031
remove lemma cont_cfun; rename thelub_cfun to lub_cfun
Mon, 06 Dec 2010 10:08:33 -0800 rename lub_fun -> is_lub_fun, thelub_fun -> lub_fun
huffman [Mon, 06 Dec 2010 10:08:33 -0800] rev 41030
rename lub_fun -> is_lub_fun, thelub_fun -> lub_fun
Mon, 06 Dec 2010 08:59:58 -0800 pcpodef no longer generates _defined lemmas, use _bottom_iff lemmas instead
huffman [Mon, 06 Dec 2010 08:59:58 -0800] rev 41029
pcpodef no longer generates _defined lemmas, use _bottom_iff lemmas instead
Mon, 06 Dec 2010 08:43:52 -0800 cpodef no longer generates lemma is_lub_foo, since it is redundant with lub_foo
huffman [Mon, 06 Dec 2010 08:43:52 -0800] rev 41028
cpodef no longer generates lemma is_lub_foo, since it is redundant with lub_foo
(0) -30000 -10000 -3000 -1000 -300 -100 -60 +60 +100 +300 +1000 +3000 +10000 +30000 tip