Tue, 19 Apr 2011 12:22:59 +0200 optimize trivial equalities early in Nitpick -- it shouldn't be the job of the peephole optimizer
blanchet [Tue, 19 Apr 2011 12:22:59 +0200] rev 42414
optimize trivial equalities early in Nitpick -- it shouldn't be the job of the peephole optimizer
Tue, 19 Apr 2011 12:21:57 +0200 remove a few Nitpick calls in examples -- another step toward making them run faster
blanchet [Tue, 19 Apr 2011 12:21:57 +0200] rev 42413
remove a few Nitpick calls in examples -- another step toward making them run faster
Tue, 19 Apr 2011 11:56:11 +0200 check arity of bound variables to avoid generating too large Kodkod problems -- an issue that arose in the context of TPTP/CASC
blanchet [Tue, 19 Apr 2011 11:56:11 +0200] rev 42412
check arity of bound variables to avoid generating too large Kodkod problems -- an issue that arose in the context of TPTP/CASC
Tue, 19 Apr 2011 23:57:28 +0200 eliminated Codegen.mode in favour of explicit argument;
wenzelm [Tue, 19 Apr 2011 23:57:28 +0200] rev 42411
eliminated Codegen.mode in favour of explicit argument;
Tue, 19 Apr 2011 22:32:49 +0200 less bulky "_position", for improved readability of parse trees;
wenzelm [Tue, 19 Apr 2011 22:32:49 +0200] rev 42410
less bulky "_position", for improved readability of parse trees;
Tue, 19 Apr 2011 22:08:42 +0200 added more elementary Skip_Proof.make_thm_cterm;
wenzelm [Tue, 19 Apr 2011 22:08:42 +0200] rev 42409
added more elementary Skip_Proof.make_thm_cterm;
(0) -30000 -10000 -3000 -1000 -300 -100 -30 -10 -6 +6 +10 +30 +100 +300 +1000 +3000 +10000 +30000 tip