| 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 |