| Wed, 05 Jul 2000 16:37:52 +0200 |
paulson |
massive tidy-up: goal -> Goal, remove use of prems, etc.
|
file |
diff |
annotate
|
| Tue, 04 Jul 2000 15:58:11 +0200 |
paulson |
removed most batch-style proofs
|
file |
diff |
annotate
|
| Sun, 25 May 1997 11:07:52 +0200 |
slotosch |
eliminated the constant less by the introduction of the axclass sq_ord
|
file |
diff |
annotate
|
| Mon, 17 Feb 1997 10:57:11 +0100 |
slotosch |
Changes of HOLCF from Oscar Slotosch:
|
file |
diff |
annotate
|
| Thu, 26 Sep 1996 15:14:23 +0200 |
paulson |
Ran expandshort; used stac instead of ssubst
|
file |
diff |
annotate
|
| Tue, 30 Jan 1996 13:42:57 +0100 |
clasohm |
expanded tabs
|
file |
diff |
annotate
|
| Tue, 10 Oct 1995 11:55:45 +0100 |
regensbu |
corrected some errors that occurred after introduction of local simpsets
|
file |
diff |
annotate
|
| Wed, 04 Oct 1995 14:01:44 +0100 |
clasohm |
added local simpsets
|
file |
diff |
annotate
|
| Thu, 29 Jun 1995 16:28:40 +0200 |
regensbu |
The curried version of HOLCF is now just called HOLCF. The old
|
file |
diff |
annotate
|
| Fri, 17 Mar 1995 15:35:09 +0100 |
regensbu |
Removed bugs which occurred due to new generation mechanism for type variables
|
file |
diff |
annotate
|
| Tue, 07 Feb 1995 11:59:32 +0100 |
clasohm |
added qed, qed_goal[w]
|
file |
diff |
annotate
|
| Wed, 19 Jan 1994 17:35:01 +0100 |
nipkow |
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
|
file |
diff |
annotate
|