Wed, 12 Feb 2014 08:35:56 +0100 tuned code
blanchet [Wed, 12 Feb 2014 08:35:56 +0100] rev 55402
tuned code
Wed, 12 Feb 2014 08:35:56 +0100 more 'ctr_sugar' modernization
blanchet [Wed, 12 Feb 2014 08:35:56 +0100] rev 55401
more 'ctr_sugar' modernization
Wed, 12 Feb 2014 08:35:56 +0100 tuning
blanchet [Wed, 12 Feb 2014 08:35:56 +0100] rev 55400
tuning
Wed, 12 Feb 2014 08:35:56 +0100 ported predicate compiler to 'ctr_sugar'
blanchet [Wed, 12 Feb 2014 08:35:56 +0100] rev 55399
ported predicate compiler to 'ctr_sugar' * * * ported predicate compiler to 'ctr_sugar', part 2
Wed, 12 Feb 2014 08:35:56 +0100 updated docs
blanchet [Wed, 12 Feb 2014 08:35:56 +0100] rev 55398
updated docs
Wed, 12 Feb 2014 08:35:56 +0100 generate 'fundec_cong' attribute for new-style (co)datatypes
blanchet [Wed, 12 Feb 2014 08:35:56 +0100] rev 55397
generate 'fundec_cong' attribute for new-style (co)datatypes * * * compile
Wed, 12 Feb 2014 08:35:56 +0100 got rid of dynamic scoping the easy way
blanchet [Wed, 12 Feb 2014 08:35:56 +0100] rev 55396
got rid of dynamic scoping the easy way
Wed, 12 Feb 2014 08:35:56 +0100 removed trivial 'rec' examples for nonrecursive types (I could also have added the 'old.' prefix in front of the constant names)
blanchet [Wed, 12 Feb 2014 08:35:56 +0100] rev 55395
removed trivial 'rec' examples for nonrecursive types (I could also have added the 'old.' prefix in front of the constant names)
Wed, 12 Feb 2014 08:35:56 +0100 more liberal merging of BNFs and constructor sugar
blanchet [Wed, 12 Feb 2014 08:35:56 +0100] rev 55394
more liberal merging of BNFs and constructor sugar * * * make sure that the cache doesn't produce 'DUP's
Wed, 12 Feb 2014 08:35:56 +0100 se 'wrap_free_constructors' to register 'sum' , 'prod', 'unit', 'bool' with their discriminators/selectors
blanchet [Wed, 12 Feb 2014 08:35:56 +0100] rev 55393
se 'wrap_free_constructors' to register 'sum' , 'prod', 'unit', 'bool' with their discriminators/selectors * * * cleaner simp/iff sets
Wed, 12 Feb 2014 08:35:56 +0100 have the same no-update semantics for 'case' as for 'Ctr_Sugar' and BNF data (this might not be the final word on the matter, but using a consistent policy seems like a good idea)
blanchet [Wed, 12 Feb 2014 08:35:56 +0100] rev 55392
have the same no-update semantics for 'case' as for 'Ctr_Sugar' and BNF data (this might not be the final word on the matter, but using a consistent policy seems like a good idea)
Tue, 11 Feb 2014 12:08:44 +0100 Mac OS X Lion (macbroy6) is baseline for portable executables;
wenzelm [Tue, 11 Feb 2014 12:08:44 +0100] rev 55391
Mac OS X Lion (macbroy6) is baseline for portable executables; fringe platforms are unsupported;
Tue, 11 Feb 2014 11:30:33 +0100 "no_memory" option for the simplifier trace to bypass memoization
Lars Hupel <lars.hupel@mytum.de> [Tue, 11 Feb 2014 11:30:33 +0100] rev 55390
"no_memory" option for the simplifier trace to bypass memoization
Tue, 11 Feb 2014 09:29:46 +0100 tuned
nipkow [Tue, 11 Feb 2014 09:29:46 +0100] rev 55389
tuned
Mon, 10 Feb 2014 23:24:44 +0100 merged
wenzelm [Mon, 10 Feb 2014 23:24:44 +0100] rev 55388
merged
Mon, 10 Feb 2014 22:39:04 +0100 seal system channels at end of Pure bootstrap -- Isabelle/Scala provides official interfaces;
wenzelm [Mon, 10 Feb 2014 22:39:04 +0100] rev 55387
seal system channels at end of Pure bootstrap -- Isabelle/Scala provides official interfaces;
Mon, 10 Feb 2014 22:22:06 +0100 make triple-sure that the future scheduler is properly shutdown (see also 702278df3b57);
wenzelm [Mon, 10 Feb 2014 22:22:06 +0100] rev 55386
make triple-sure that the future scheduler is properly shutdown (see also 702278df3b57);
Mon, 10 Feb 2014 22:08:18 +0100 discontinued axiomatic 'classes', 'classrel', 'arities';
wenzelm [Mon, 10 Feb 2014 22:08:18 +0100] rev 55385
discontinued axiomatic 'classes', 'classrel', 'arities';
Mon, 10 Feb 2014 22:07:50 +0100 updated keywords;
wenzelm [Mon, 10 Feb 2014 22:07:50 +0100] rev 55384
updated keywords;
Mon, 10 Feb 2014 21:03:28 +0100 more explicit axiomatization;
wenzelm [Mon, 10 Feb 2014 21:03:28 +0100] rev 55383
more explicit axiomatization;
Mon, 10 Feb 2014 21:00:56 +0100 prefer vacuous definitional type classes over axiomatic ones;
wenzelm [Mon, 10 Feb 2014 21:00:56 +0100] rev 55382
prefer vacuous definitional type classes over axiomatic ones;
Mon, 10 Feb 2014 17:23:13 +0100 more explicit axiomatization;
wenzelm [Mon, 10 Feb 2014 17:23:13 +0100] rev 55381
more explicit axiomatization;
Mon, 10 Feb 2014 17:20:11 +0100 prefer vacuous definitional type classes over axiomatic ones;
wenzelm [Mon, 10 Feb 2014 17:20:11 +0100] rev 55380
prefer vacuous definitional type classes over axiomatic ones;
Mon, 10 Feb 2014 14:33:47 +0100 comments;
wenzelm [Mon, 10 Feb 2014 14:33:47 +0100] rev 55379
comments;
Mon, 10 Feb 2014 13:47:31 +0100 removed rotten code;
wenzelm [Mon, 10 Feb 2014 13:47:31 +0100] rev 55378
removed rotten code;
Mon, 10 Feb 2014 13:04:08 +0100 more elementary put_simpset: exchange the simplifier configuration outright, which is particularly relevant concerning cumulative depth, e.g. for Product_Type.split_beta in the subsequent example:
wenzelm [Mon, 10 Feb 2014 13:04:08 +0100] rev 55377
more elementary put_simpset: exchange the simplifier configuration outright, which is particularly relevant concerning cumulative depth, e.g. for Product_Type.split_beta in the subsequent example: lemma "P (\<lambda>s. (case s of (x, y) \<Rightarrow> c))" using [[simp_depth_limit = 1]] apply simp oops
Mon, 10 Feb 2014 21:51:15 +0100 merged
nipkow [Mon, 10 Feb 2014 21:51:15 +0100] rev 55376
merged
Mon, 10 Feb 2014 21:50:50 +0100 improved lin.arith. for terms involving division
nipkow [Mon, 10 Feb 2014 21:50:50 +0100] rev 55375
improved lin.arith. for terms involving division
Sun, 09 Feb 2014 21:37:27 +0100 restoring ancient string_classes option
haftmann [Sun, 09 Feb 2014 21:37:27 +0100] rev 55374
restoring ancient string_classes option
Sun, 09 Feb 2014 21:37:27 +0100 method names in instance declarations are always unqualified
haftmann [Sun, 09 Feb 2014 21:37:27 +0100] rev 55373
method names in instance declarations are always unqualified
(0) -30000 -10000 -3000 -1000 -300 -100 -50 -30 +30 +50 +100 +300 +1000 +3000 +10000 tip