src/HOL/Bali/AxCompl.thy
Mon, 27 Feb 2012 17:40:59 +0100 wenzelm tuned proofs;
Sun, 20 Nov 2011 21:05:23 +0100 wenzelm eliminated obsolete "standard";
Mon, 12 Sep 2011 07:55:43 +0200 nipkow new fastforce replacing fastsimp - less confusing name
Fri, 13 May 2011 22:55:00 +0200 wenzelm proper Proof.context for classical tactics;
Mon, 06 Sep 2010 19:13:10 +0200 wenzelm more antiquotations;
Mon, 26 Jul 2010 17:41:26 +0200 wenzelm modernized/unified some specifications;
Mon, 01 Mar 2010 13:40:23 +0100 haftmann replaced a couple of constsdefs by definitions (also some old primrecs by modern ones)
Wed, 10 Feb 2010 00:50:36 +0100 wenzelm removed obsolete CVS Ids;
Sat, 17 Oct 2009 14:43:18 +0200 wenzelm eliminated hard tabulators, guessing at each author's individual tab-width;
Mon, 06 Jul 2009 21:24:30 +0200 wenzelm structure Thm: less pervasive names;
Sat, 17 May 2008 21:46:22 +0200 wenzelm avoid undeclared variables within proofs;
Sun, 30 Sep 2007 21:55:15 +0200 wenzelm avoid internal names;
Sat, 28 Jul 2007 20:40:20 +0200 wenzelm removed redundant simproc declarations;
Sat, 21 Jul 2007 23:25:00 +0200 wenzelm tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
Wed, 13 Jun 2007 10:43:38 +0200 wenzelm tuned proofs: avoid implicit prems;
Wed, 06 Dec 2006 01:12:36 +0100 wenzelm removed legacy ML bindings;
Wed, 26 Jul 2006 19:23:04 +0200 webertj linear arithmetic splits certain operators (e.g. min, max, abs)
Tue, 11 Jul 2006 23:49:32 +0200 wenzelm avoid reference to internal skolem;
Thu, 22 Dec 2005 00:28:41 +0100 wenzelm mutual induct with *.inducts;
Fri, 25 Nov 2005 18:58:35 +0100 wenzelm removed obsolete dummy paragraphs;
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
Mon, 21 Jun 2004 10:25:57 +0200 kleing Merged in license change from Isabelle2004
Fri, 01 Nov 2002 13:16:28 +0100 schirmer Inserted some extra paragraphs in large proofs to make tex run...
Thu, 31 Oct 2002 18:27:10 +0100 schirmer "Definite Assignment Analysis" included, with proof of correctness. Large adjustments of type safety proof and soundness proof of the axiomatic semantics were necessary. Completeness proof of the loop rule of the axiomatic semantic was altered. So the additional polymorphic variants of some rules could be removed.
Mon, 30 Sep 2002 16:14:02 +0200 berghofe Adapted to new simplifier.
Tue, 27 Aug 2002 11:03:05 +0200 wenzelm *** empty log message ***
Tue, 16 Jul 2002 20:25:21 +0200 schirmer Added conditional and (&&) and or (||).
Wed, 10 Jul 2002 15:07:02 +0200 schirmer Added unary and binary operations like (+,-,<, ...); Added smallstep semantics (no proofs about it yet).
Fri, 22 Feb 2002 11:26:44 +0100 schirmer Added check for field/method access to operational semantics and proved the acesses valid.
Mon, 28 Jan 2002 23:35:20 +0100 wenzelm tuned;
Mon, 28 Jan 2002 18:50:23 +0100 wenzelm tuned header;
Mon, 28 Jan 2002 17:00:19 +0100 schirmer Isabelle/Bali sources;
less more (0) tip