Thu, 28 Jan 2010 22:19:27 +0100 make underscores visually appear as such, although TeX-nically they are just rules (e.g. cannot be searched);
wenzelm [Thu, 28 Jan 2010 22:19:27 +0100] rev 34920
make underscores visually appear as such, although TeX-nically they are just rules (e.g. cannot be searched);
Sat, 16 Jan 2010 21:14:15 +0100 Netbeans Library "Scala-compiler";
wenzelm [Sat, 16 Jan 2010 21:14:15 +0100] rev 34919
Netbeans Library "Scala-compiler";
Fri, 15 Jan 2010 19:14:51 +0100 union is an abbreviation for sup.
berghofe [Fri, 15 Jan 2010 19:14:51 +0100] rev 34918
union is an abbreviation for sup.
Fri, 15 Jan 2010 14:43:00 +0100 merged
berghofe [Fri, 15 Jan 2010 14:43:00 +0100] rev 34917
merged
Fri, 15 Jan 2010 13:37:41 +0100 Eliminated is_open option of Rule_Cases.make_nested/make_common;
berghofe [Fri, 15 Jan 2010 13:37:41 +0100] rev 34916
Eliminated is_open option of Rule_Cases.make_nested/make_common; use Rule_Cases.internalize_params to rename parameters instead.
Sun, 10 Jan 2010 18:43:45 +0100 Adapted to changes in induct method.
berghofe [Sun, 10 Jan 2010 18:43:45 +0100] rev 34915
Adapted to changes in induct method.
Sun, 10 Jan 2010 18:41:07 +0100 Adapted to changes in setup of induct method.
berghofe [Sun, 10 Jan 2010 18:41:07 +0100] rev 34914
Adapted to changes in setup of induct method.
Sun, 10 Jan 2010 18:39:50 +0100 Expand proofs of induct_atomize'/rulify'.
berghofe [Sun, 10 Jan 2010 18:39:50 +0100] rev 34913
Expand proofs of induct_atomize'/rulify'.
Sun, 10 Jan 2010 18:37:37 +0100 Changed case names of converse_rtranclp_induct.
berghofe [Sun, 10 Jan 2010 18:37:37 +0100] rev 34912
Changed case names of converse_rtranclp_induct.
Sun, 10 Jan 2010 18:11:00 +0100 Injectivity / distinctness theorems are now used to simplify induction rules.
berghofe [Sun, 10 Jan 2010 18:11:00 +0100] rev 34911
Injectivity / distinctness theorems are now used to simplify induction rules.
(0) -30000 -10000 -3000 -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 +30000 tip