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