src/HOL/Lambda/Commutation.thy
Thu, 21 Jun 2007 20:07:26 +0200 wenzelm tuned proofs -- avoid implicit prems;
Fri, 09 Mar 2007 08:45:50 +0100 haftmann stepping towards uniform lattice theory development in HOL
Wed, 07 Feb 2007 17:41:11 +0100 berghofe Converted to predicate notation.
Wed, 06 Dec 2006 01:12:36 +0100 wenzelm removed legacy ML bindings;
Fri, 17 Nov 2006 02:20:03 +0100 wenzelm more robust syntax for definition/abbreviation/notation;
Sat, 08 Apr 2006 22:51:06 +0200 wenzelm refined 'abbreviation';
Thu, 16 Feb 2006 21:12:00 +0100 wenzelm new-style definitions/abbreviations;
Fri, 23 Dec 2005 20:02:30 +0100 wenzelm tuned proofs;
Wed, 23 Nov 2005 22:26:13 +0100 wenzelm tuned induction proofs;
Thu, 22 Sep 2005 23:56:15 +0200 nipkow renamed rules to iprover
Fri, 17 Jun 2005 16:12:49 +0200 haftmann migrated theory headers to new format
Fri, 30 Aug 2002 16:42:45 +0200 paulson removal of blast.overloaded
Thu, 11 Jul 2002 16:57:14 +0200 berghofe Added "using" to the beginning of original newman proof again, because
Thu, 11 Jul 2002 09:47:15 +0200 nipkow Added partly automated version of Newman.
Thu, 11 Jul 2002 09:17:01 +0200 nipkow *** empty log message ***
less more (0) -15 tip