src/HOL/UNITY/Union.ML
Mon, 16 Nov 1998 13:58:48 +0100 paulson a faster proof
Mon, 16 Nov 1998 10:39:30 +0100 paulson generalized JN_empty and added reachable_SKIP
Fri, 06 Nov 1998 13:20:29 +0100 paulson Revising the Client proof as suggested by Michel Charpentier. New lemmas
Sat, 31 Oct 1998 12:46:21 +0100 paulson Charpentier laws
Thu, 15 Oct 1998 11:35:07 +0200 paulson specifications as sets of programs
Tue, 13 Oct 1998 10:55:33 +0200 paulson tidied
Wed, 07 Oct 1998 10:32:00 +0200 paulson tidying and renaming
Mon, 05 Oct 1998 10:22:49 +0200 paulson Join now an infix operator
Fri, 02 Oct 1998 14:28:39 +0200 nipkow id <-> Id
Thu, 01 Oct 1998 18:28:18 +0200 paulson abstype of programs
Tue, 29 Sep 1998 15:58:47 +0200 paulson Now id:(Acts prg) is implicit
Thu, 03 Sep 1998 16:40:02 +0200 paulson A new approach, using simp_of_act and simp_of_set to activate definitions when
Thu, 13 Aug 1998 18:06:40 +0200 paulson Constrains, Stable, Invariant...more of the substitution axiom, but Union
Wed, 05 Aug 1998 18:21:37 +0200 paulson Null program and a few new results
Wed, 05 Aug 1998 10:56:58 +0200 paulson Union primitives and examples
less more (0) tip