src/HOL/MiniML/W.ML
Fri, 14 Feb 1997 16:01:43 +0100 narasche Some lemmas changed to valuesd
Fri, 17 Jan 1997 18:50:04 +0100 nipkow The new version of MiniML including "let".
Fri, 17 Jan 1997 11:09:19 +0100 paulson New miniscoping rules for the bounded quantifiers and UN/INT operators
Thu, 10 Oct 1996 10:47:26 +0200 paulson Tidied some proofs: changed needed for de Morgan laws
Mon, 07 Oct 1996 10:34:58 +0200 paulson Tidied up some proofs
Thu, 26 Sep 1996 12:47:47 +0200 paulson Ran expandshort
Thu, 05 Sep 1996 10:29:20 +0200 paulson Miniscoping rules are deleted, as these brittle proofs
Tue, 20 Aug 1996 12:32:16 +0200 paulson Some tidying. This brittle proof depends upon
Mon, 19 Aug 1996 11:17:20 +0200 paulson Tidied some proofs, maybe using less_SucE
Thu, 20 Jun 1996 10:27:29 +0200 paulson Restored Addsimps [Suc_le_lessD], as it cannot be added
Mon, 22 Apr 1996 15:42:20 +0200 nipkow inserted Suc_less_eq explictly in a few proofs.
Wed, 28 Feb 1996 16:57:14 +0100 nipkow modified priorities in syntax
Fri, 09 Feb 1996 13:41:59 +0100 nipkow Introduced qed_spec_mp.
Tue, 30 Jan 1996 15:24:36 +0100 clasohm expanded tabs
Fri, 08 Dec 1995 19:48:15 +0100 nipkow Introduced Monad syntax Pat := Val; Cont
Wed, 25 Oct 1995 09:46:46 +0100 nipkow New theory: type inference for let-free MiniML
less more (0) tip