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

efficient construction of red black trees from sorted associative lists

more explicit code equations

adding necessary syntactic functions in set_comprehension_pointfree simproc as a first step to integrate an improved simproc

special code setup for step function in IMP is redundant as definition was tuned (cf. c54d901d2946)

test case for set_comprehension_pointfree simproc succeeds now

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