Fri, 04 Nov 2011 08:19:24 +0100 ex/Tree23.thy: automate proof of gfull_add
huffman [Fri, 04 Nov 2011 08:19:24 +0100] rev 45336
ex/Tree23.thy: automate proof of gfull_add
Fri, 04 Nov 2011 08:00:48 +0100 ex/Tree23.thy: simplify proof of bal_del0
huffman [Fri, 04 Nov 2011 08:00:48 +0100] rev 45335
ex/Tree23.thy: simplify proof of bal_del0
Fri, 04 Nov 2011 07:37:37 +0100 ex/Tree23.thy: simplify proof of bal_add0
huffman [Fri, 04 Nov 2011 07:37:37 +0100] rev 45334
ex/Tree23.thy: simplify proof of bal_add0
Fri, 04 Nov 2011 07:04:34 +0100 ex/Tree23.thy: simpler definition of ordered-ness predicate
huffman [Fri, 04 Nov 2011 07:04:34 +0100] rev 45333
ex/Tree23.thy: simpler definition of ordered-ness predicate
Thu, 03 Nov 2011 17:40:50 +0100 ex/Tree23.thy: prove that deletion preserves balance
huffman [Thu, 03 Nov 2011 17:40:50 +0100] rev 45332
ex/Tree23.thy: prove that deletion preserves balance
Fri, 04 Nov 2011 00:07:45 +0100 more liberal Parse.fixes, to avoid overlap of mixfix with is-pattern (notably in 'obtain' syntax);
wenzelm [Fri, 04 Nov 2011 00:07:45 +0100] rev 45331
more liberal Parse.fixes, to avoid overlap of mixfix with is-pattern (notably in 'obtain' syntax);
Thu, 03 Nov 2011 23:55:53 +0100 more general Proof_Context.bind_propp, which allows outer parameters;
wenzelm [Thu, 03 Nov 2011 23:55:53 +0100] rev 45330
more general Proof_Context.bind_propp, which allows outer parameters; obtain: some support for term bindings within the proof, depending on parameters;
Thu, 03 Nov 2011 23:32:31 +0100 tuned whitespace;
wenzelm [Thu, 03 Nov 2011 23:32:31 +0100] rev 45329
tuned whitespace;
Thu, 03 Nov 2011 22:51:37 +0100 tuned signature;
wenzelm [Thu, 03 Nov 2011 22:51:37 +0100] rev 45328
tuned signature;
Thu, 03 Nov 2011 22:23:41 +0100 tuned signature -- canonical argument order;
wenzelm [Thu, 03 Nov 2011 22:23:41 +0100] rev 45327
tuned signature -- canonical argument order;
(0) -30000 -10000 -3000 -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 +30000 tip