summary |
shortlog |
changelog |
graph |
tags |
bookmarks |
branches |
files | gz |
help

(0) -30000 -10000 -3000 -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 tip

(0) -30000 -10000 -3000 -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 tip

unfolding bounded existential quantifiers as first step in the set_comprehension_pointfree simproc

moving simproc from Finite_Set to more appropriate Product_Type theory

generalizing set_comprehension_pointfree simproc to work for arbitrary predicates (and not just the finite predicate)

adding some example that motivates some of the current changes in the set_comprehension_pointfree simproc

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

more consistent error messages on malformed code equations

removed support for set constant definitions in HOLCF {cpo,pcpo,domain}def commands;
removed '(open)', '(set_name)' and '(open set_name)' options

use Set.filter instead of Finite_Set.filter, which is removed then

rename Set.project to Set.filter - more appropriate name

added some ad-hoc namespace prefixes to avoid duplicate facts;