src/HOL/IMP/Machines.thy
Mon, 27 Jul 2009 21:47:41 +0200 krauss "more standard" argument order of relation composition (op O)
Thu, 09 Jul 2009 17:34:59 +0200 krauss move rel_pow_commute: "R O R ^^ n = R ^^ n O R" to Transitive_Closure
Thu, 09 Jul 2009 17:33:22 +0200 krauss drop unused lemmas
Mon, 20 Apr 2009 09:32:07 +0200 haftmann power operation on functions with syntax o^; power operation on relations with syntax ^^
Wed, 11 Jul 2007 11:14:51 +0200 berghofe Adapted to new inductive definition package.
Wed, 07 Feb 2007 17:35:28 +0100 berghofe Adapted to changes in Transitive_Closure theory.
Mon, 11 Sep 2006 21:35:19 +0200 wenzelm induct method: renamed 'fixing' to 'arbitrary';
Wed, 26 Jul 2006 19:23:04 +0200 webertj linear arithmetic splits certain operators (e.g. min, max, abs)
Thu, 08 Dec 2005 20:15:50 +0100 wenzelm tuned proofs;
Fri, 17 Jun 2005 16:12:49 +0200 haftmann migrated theory headers to new format
Wed, 14 Apr 2004 14:13:05 +0200 kleing use more symbols in HTML output
Thu, 24 Oct 2002 07:23:46 +0200 nipkow ASIN -> SET
Mon, 30 Sep 2002 16:48:15 +0200 berghofe Adapted to new simplifier.
Mon, 29 Apr 2002 11:30:15 +0200 nipkow Better compiler proof
Fri, 26 Apr 2002 11:47:01 +0200 nipkow New machine architecture and other direction of compiler proof.
less more (0) tip