Wed, 10 Oct 2012 10:48:17 +0200 bulwahn test case for set_comprehension_pointfree simproc succeeds now
Wed, 10 Oct 2012 10:47:52 +0200 bulwahn unfolding bounded existential quantifiers as first step in the set_comprehension_pointfree simproc
Wed, 10 Oct 2012 10:47:43 +0200 bulwahn moving simproc from Finite_Set to more appropriate Product_Type theory
Wed, 10 Oct 2012 10:47:21 +0200 bulwahn generalizing set_comprehension_pointfree simproc to work for arbitrary predicates (and not just the finite predicate)
Wed, 10 Oct 2012 10:41:18 +0200 bulwahn adding some example that motivates some of the current changes in the set_comprehension_pointfree simproc
Wed, 10 Oct 2012 10:41:16 +0200 bulwahn set_comprehension_pointfree also handles terms where the equation is not at the first position, which is a necessary generalisation to eventually handle bounded existentials; tuned
Wed, 10 Oct 2012 08:45:27 +0200 haftmann more consistent error messages on malformed code equations
Tue, 09 Oct 2012 17:33:46 +0200 huffman removed support for set constant definitions in HOLCF {cpo,pcpo,domain}def commands;
Tue, 09 Oct 2012 16:58:36 +0200 kuncar use Set.filter instead of Finite_Set.filter, which is removed then
Tue, 09 Oct 2012 16:57:58 +0200 kuncar rename Set.project to Set.filter - more appropriate name
Wed, 10 Oct 2012 15:39:01 +0200 wenzelm added some ad-hoc namespace prefixes to avoid duplicate facts;
Wed, 10 Oct 2012 15:27:10 +0200 wenzelm avoid duplicate facts;
Wed, 10 Oct 2012 15:21:26 +0200 wenzelm more explicit namespace prefix for 'statespace' -- duplicate facts;
Wed, 10 Oct 2012 15:17:40 +0200 wenzelm eliminated spurious fact duplicates;
Wed, 10 Oct 2012 15:01:20 +0200 wenzelm modernized dynamic "rules" -- avoid rebinding of static facts;
Tue, 09 Oct 2012 22:24:24 +0200 wenzelm removed redundant lemma, cf. class zero_neq_one in HOL/Rings.thy;
(0) -30000 -10000 -3000 -1000 -300 -100 -16 +16 +100 +300 +1000 +3000 +10000 +30000 tip