| Sat, 01 Dec 2001 18:52:32 +0100 |
wenzelm |
renamed class "term" to "type" (actually "HOL.type");
|
file |
diff |
annotate
|
| Sat, 03 Nov 2001 01:41:26 +0100 |
wenzelm |
GPLed;
|
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
|
| Thu, 29 Jun 1995 16:28:40 +0200 |
regensbu |
The curried version of HOLCF is now just called HOLCF. The old
|
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
|