| Wed, 10 Oct 2012 12:12:15 +0200 |
hoelzl |
tuned measurable_If; moved countably_additive equalities to Measure_Space; tuned proofs
|
changeset |
files
|
| Wed, 10 Oct 2012 12:12:14 +0200 |
hoelzl |
rename terminal_events to tail_event
|
changeset |
files
|
| Wed, 10 Oct 2012 13:04:15 +0200 |
Andreas Lochbihler |
merged
|
changeset |
files
|
| Wed, 10 Oct 2012 13:03:50 +0200 |
Andreas Lochbihler |
efficient construction of red black trees from sorted associative lists
|
changeset |
files
|
| Wed, 10 Oct 2012 12:52:24 +0200 |
haftmann |
more explicit code equations
|
changeset |
files
|
| Wed, 10 Oct 2012 10:48:55 +0200 |
bulwahn |
adding necessary syntactic functions in set_comprehension_pointfree simproc as a first step to integrate an improved simproc
|
changeset |
files
|
| Wed, 10 Oct 2012 10:48:33 +0200 |
bulwahn |
special code setup for step function in IMP is redundant as definition was tuned (cf. c54d901d2946)
|
changeset |
files
|
| Wed, 10 Oct 2012 10:48:17 +0200 |
bulwahn |
test case for set_comprehension_pointfree simproc succeeds now
|
changeset |
files
|
| Wed, 10 Oct 2012 10:47:52 +0200 |
bulwahn |
unfolding bounded existential quantifiers as first step in the set_comprehension_pointfree simproc
|
changeset |
files
|
| Wed, 10 Oct 2012 10:47:43 +0200 |
bulwahn |
moving simproc from Finite_Set to more appropriate Product_Type theory
|
changeset |
files
|
| 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)
|
changeset |
files
|
| 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
|
changeset |
files
|
| 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
|
changeset |
files
|
| Wed, 10 Oct 2012 08:45:27 +0200 |
haftmann |
more consistent error messages on malformed code equations
|
changeset |
files
|
| Tue, 09 Oct 2012 17:33:46 +0200 |
huffman |
removed support for set constant definitions in HOLCF {cpo,pcpo,domain}def commands;
|
changeset |
files
|
| Tue, 09 Oct 2012 16:58:36 +0200 |
kuncar |
use Set.filter instead of Finite_Set.filter, which is removed then
|
changeset |
files
|
| Tue, 09 Oct 2012 16:57:58 +0200 |
kuncar |
rename Set.project to Set.filter - more appropriate name
|
changeset |
files
|
| Wed, 10 Oct 2012 15:39:01 +0200 |
wenzelm |
added some ad-hoc namespace prefixes to avoid duplicate facts;
|
changeset |
files
|
| Wed, 10 Oct 2012 15:27:10 +0200 |
wenzelm |
avoid duplicate facts;
|
changeset |
files
|
| Wed, 10 Oct 2012 15:21:26 +0200 |
wenzelm |
more explicit namespace prefix for 'statespace' -- duplicate facts;
|
changeset |
files
|
| Wed, 10 Oct 2012 15:17:40 +0200 |
wenzelm |
eliminated spurious fact duplicates;
|
changeset |
files
|
| Wed, 10 Oct 2012 15:01:20 +0200 |
wenzelm |
modernized dynamic "rules" -- avoid rebinding of static facts;
|
changeset |
files
|
| Tue, 09 Oct 2012 22:24:24 +0200 |
wenzelm |
removed redundant lemma, cf. class zero_neq_one in HOL/Rings.thy;
|
changeset |
files
|
| Tue, 09 Oct 2012 21:33:12 +0200 |
wenzelm |
clarified Element.init vs. Element.activate: refrain from hard-wiring Thm.def_binding_optional to avoid duplicate facts;
|
changeset |
files
|
| Tue, 09 Oct 2012 20:23:58 +0200 |
wenzelm |
tuned;
|
changeset |
files
|
| Tue, 09 Oct 2012 20:05:17 +0200 |
wenzelm |
clarified Local_Defs.add_def(s): refrain from hard-wiring Thm.def_binding_optional;
|
changeset |
files
|
| Tue, 09 Oct 2012 19:24:19 +0200 |
wenzelm |
more explicit flags for facts table;
|
changeset |
files
|
| Tue, 09 Oct 2012 15:31:45 +0200 |
wenzelm |
minor tuning;
|
changeset |
files
|
| Tue, 09 Oct 2012 13:57:51 +0200 |
wenzelm |
more conventional Double constants;
|
changeset |
files
|
| Tue, 09 Oct 2012 13:50:24 +0200 |
wenzelm |
tuned source structure;
|
changeset |
files
|