src/HOL/Lambda/Commutation.thy
Fri, 03 Sep 2010 22:36:16 +0200 wenzelm configuration options Syntax.ambiguity_enabled (inverse of former Syntax.ambiguity_is_error), Syntax.ambiguity_level (with Isar attribute "syntax_ambiguity_level"), Syntax.ambiguity_limit;
Wed, 12 May 2010 14:17:26 +0200 wenzelm removed obsolete CVS Ids;
Thu, 02 Oct 2008 12:17:20 +0200 berghofe Yet another proof of Newman's lemma, this time using the coherent logic prover.
Fri, 25 Jan 2008 23:05:23 +0100 wenzelm tuned document;
Mon, 16 Jul 2007 19:11:37 +0200 paulson tidied
Wed, 11 Jul 2007 11:23:24 +0200 berghofe - Renamed inductive2 to inductive
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;
less more (0) -14 tip