Thu, 29 Jun 1995 16:39:24 +0200 Proof of n_leaves_reflect uses permutative rewriting.
lcp [Thu, 29 Jun 1995 16:39:24 +0200] rev 1170
Proof of n_leaves_reflect uses permutative rewriting.
Thu, 29 Jun 1995 16:33:17 +0200 Added function rev and its properties length_rev, etc.
lcp [Thu, 29 Jun 1995 16:33:17 +0200] rev 1169
Added function rev and its properties length_rev, etc.
Thu, 29 Jun 1995 16:28:40 +0200 The curried version of HOLCF is now just called HOLCF. The old
regensbu [Thu, 29 Jun 1995 16:28:40 +0200] rev 1168
The curried version of HOLCF is now just called HOLCF. The old uncurried version is no longer supported
Thu, 29 Jun 1995 16:16:24 +0200 New theory and proofs including preorder, inorder, ..., initially
lcp [Thu, 29 Jun 1995 16:16:24 +0200] rev 1167
New theory and proofs including preorder, inorder, ..., initially from ZF/ex/BT. Demonstrates datatypes and primrec.
Thu, 29 Jun 1995 13:34:35 +0200 renamed CHOL to HOL
clasohm [Thu, 29 Jun 1995 13:34:35 +0200] rev 1166
renamed CHOL to HOL
Thu, 29 Jun 1995 12:48:48 +0200 renamed CHOL to HOL
clasohm [Thu, 29 Jun 1995 12:48:48 +0200] rev 1165
renamed CHOL to HOL
Thu, 29 Jun 1995 12:34:16 +0200 renamed CHOL to HOL
clasohm [Thu, 29 Jun 1995 12:34:16 +0200] rev 1164
renamed CHOL to HOL
Thu, 29 Jun 1995 12:28:27 +0200 changed 'chol' labels to 'hol'; added a few parentheses
clasohm [Thu, 29 Jun 1995 12:28:27 +0200] rev 1163
changed 'chol' labels to 'hol'; added a few parentheses
Thu, 29 Jun 1995 12:08:44 +0200 changes made by Lawrence Paulson
clasohm [Thu, 29 Jun 1995 12:08:44 +0200] rev 1162
changes made by Lawrence Paulson
Thu, 29 Jun 1995 10:43:07 +0200 Minimal proof tuning.
nipkow [Thu, 29 Jun 1995 10:43:07 +0200] rev 1161
Minimal proof tuning.
(0) -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 +30000 tip