src/HOLCF/Cprod1.ML
Sat, 03 Nov 2001 01:41:26 +0100 wenzelm GPLed;
Thu, 31 May 2001 16:51:26 +0200 oheimb replaced Sel_injective_cprod by new injective_fst_snd
Thu, 01 Feb 2001 20:51:48 +0100 oheimb converted to Isar therory, adding attributes complete_split and split_format
Thu, 12 Oct 2000 18:38:23 +0200 nipkow *** empty log message ***
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
Thu, 30 Sep 1999 16:16:56 +0200 wenzelm depend on Main;
Sun, 25 May 1997 11:07:52 +0200 slotosch eliminated the constant less by the introduction of the axclass sq_ord
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
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