Tue, 19 Jun 2012 20:51:15 +0200 discontinued slightly anochronistic examples;
wenzelm [Tue, 19 Jun 2012 20:51:15 +0200] rev 48116
discontinued slightly anochronistic examples;
Tue, 19 Jun 2012 20:43:09 +0200 more on syntax translations;
wenzelm [Tue, 19 Jun 2012 20:43:09 +0200] rev 48115
more on syntax translations;
Mon, 18 Jun 2012 21:17:34 +0200 more on "Abstract syntax trees";
wenzelm [Mon, 18 Jun 2012 21:17:34 +0200] rev 48114
more on "Abstract syntax trees";
Mon, 18 Jun 2012 16:30:20 +0200 more explicit section "Syntax transformations";
wenzelm [Mon, 18 Jun 2012 16:30:20 +0200] rev 48113
more explicit section "Syntax transformations";
Fri, 22 Jun 2012 15:03:41 +0200 avoid duplicate simp rules in norm_arith tactic
huffman [Fri, 22 Jun 2012 15:03:41 +0200] rev 48112
avoid duplicate simp rules in norm_arith tactic
Thu, 21 Jun 2012 13:51:44 +0200 NEWS and CONTRIBUTORS
bulwahn [Thu, 21 Jun 2012 13:51:44 +0200] rev 48111
NEWS and CONTRIBUTORS
Thu, 21 Jun 2012 12:33:27 +0200 merged
bulwahn [Thu, 21 Jun 2012 12:33:27 +0200] rev 48110
merged
Wed, 20 Jun 2012 16:54:08 +0200 Integrated set comprehension pointfree simproc.
Rafal Kolanski <rafal.kolanski@nicta.com.au> [Wed, 20 Jun 2012 16:54:08 +0200] rev 48109
Integrated set comprehension pointfree simproc.
Tue, 19 Jun 2012 11:16:41 +0200 Improved tactic for rewriting set comprehensions into pointfree form.
Rafal Kolanski <rafal.kolanski@nicta.com.au> [Tue, 19 Jun 2012 11:16:41 +0200] rev 48108
Improved tactic for rewriting set comprehensions into pointfree form. Currently the simproc targets a term with an arbitrary number of conjuncts of form "x : S". The tactic should now handle all cases of this form.
Tue, 19 Jun 2012 11:18:09 +0200 Updated comment to reflect current state.
Rafal Kolanski <rafal.kolanski@nicta.com.au> [Tue, 19 Jun 2012 11:18:09 +0200] rev 48107
Updated comment to reflect current state.
(0) -30000 -10000 -3000 -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 tip