src/HOL/Tools/set_comprehension_pointfree.ML
Thu, 18 Oct 2012 10:06:27 +0200 bulwahn locally inverting previously applied simplifications with ex_simps in set_comprehension_pointfree
Wed, 17 Oct 2012 15:25:52 +0200 bulwahn comprehension conversion reuses suggested names for bound variables instead of invented fresh ones; tuned tactic
Wed, 17 Oct 2012 14:13:57 +0200 bulwahn checking for bound variables in the set expression; handling negation more generally
Wed, 17 Oct 2012 14:13:57 +0200 bulwahn refined conversion to only react on proper set comprehensions; tuned
Wed, 17 Oct 2012 14:13:57 +0200 bulwahn employing a preprocessing conversion that rewrites {(x1, ..., xn). P x1 ... xn} to {(x1, ..., xn) | x1 ... xn. P x1 ... xn} in set_comprehension_pointfree simproc
Tue, 16 Oct 2012 13:18:13 +0200 bulwahn tactic of set_comprehension_pointfree simproc handles f x y : S patterns with Set.vimage
Tue, 16 Oct 2012 13:18:12 +0200 bulwahn term construction of set_comprehension_pointfree simproc handles f x y : S patterns with Set.vimage
Tue, 16 Oct 2012 13:18:10 +0200 bulwahn extending preprocessing of simproc to rewrite subset inequality into membership of powerset
Mon, 15 Oct 2012 16:18:48 +0200 bulwahn setcomprehension_pointfree simproc also works for set comprehension without an equation
Sun, 14 Oct 2012 19:16:35 +0200 bulwahn refined tactic in set_comprehension_pointfree simproc
Sun, 14 Oct 2012 19:16:32 +0200 bulwahn adding postprocessing of computed pointfree expression in set_comprehension_pointfree simproc
Sun, 14 Oct 2012 19:16:32 +0200 bulwahn extending the setcomprehension_pointfree simproc to handle nesting disjunctions, conjunctions and negations (with contributions from Rafal Kolanski, NICTA); tuned
Fri, 12 Oct 2012 12:21:01 +0200 bulwahn increading indexes to avoid clashes in the set_comprehension_pointfree simproc
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
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: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: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
Mon, 25 Jun 2012 18:21:18 +0200 wenzelm merged, resolving conflict with 87c831e30f0a;
Mon, 25 Jun 2012 15:14:07 +0200 wenzelm ignore morphism more explicitly;
Mon, 25 Jun 2012 16:03:14 +0200 bulwahn adding set comprehension simproc to code generation's preprocessing to generate code for some set comprehensions;
Wed, 20 Jun 2012 16:54:08 +0200 Rafal Kolanski Integrated set comprehension pointfree simproc.
less more (0) tip