src/HOLCF/Cprod2.ML
Wed, 05 Jul 2000 16:37:52 +0200 paulson massive tidy-up: goal -> Goal, remove use of prems, etc.
Tue, 04 Jul 2000 15:58:11 +0200 paulson removed most batch-style proofs
Tue, 10 Mar 1998 18:33:13 +0100 oheimb renamed is_chain to chain, is_tord to tord, replaced chain_finite by chfin
Mon, 03 Nov 1997 14:06:27 +0100 wenzelm isatool fixclasimp;
Fri, 10 Oct 1997 19:02:28 +0200 wenzelm fixed dots;
Sun, 25 May 1997 11:07:52 +0200 slotosch eliminated the constant less by the introduction of the axclass sq_ord
Wed, 26 Mar 1997 13:44:05 +0100 slotosch generalized theorems and class instances for Cprod.
Mon, 17 Feb 1997 10:57:11 +0100 slotosch Changes of HOLCF from Oscar Slotosch:
Thu, 26 Sep 1996 15:14:23 +0200 paulson Ran expandshort; used stac instead of ssubst
Fri, 31 May 1996 19:55:19 +0200 oheimb introduced forgotten bind_thm calls
Tue, 30 Jan 1996 13:42:57 +0100 clasohm expanded tabs
Wed, 04 Oct 1995 14:01:44 +0100 clasohm added local simpsets
Thu, 29 Jun 1995 16:28:40 +0200 regensbu The curried version of HOLCF is now just called HOLCF. The old
Wed, 15 Feb 1995 20:02:47 +0100 regensbu replaced pair_ss by prod_ss
Tue, 07 Feb 1995 11:59:32 +0100 clasohm added qed, qed_goal[w]
Wed, 19 Jan 1994 17:35:01 +0100 nipkow Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
less more (0) tip