Mon, 03 Jul 1995 13:08:49 +0200 remove Old_HOL
clasohm [Mon, 03 Jul 1995 13:08:49 +0200] rev 1176
remove Old_HOL
Mon, 03 Jul 1995 13:06:36 +0200 added comments; fixed a bug; reduced memory usage slightly
clasohm [Mon, 03 Jul 1995 13:06:36 +0200] rev 1175
added comments; fixed a bug; reduced memory usage slightly
Fri, 30 Jun 1995 11:39:20 +0200 added mention of new theories BT and Perm
lcp [Fri, 30 Jun 1995 11:39:20 +0200] rev 1174
added mention of new theories BT and Perm
Fri, 30 Jun 1995 11:34:14 +0200 new inductive definition: permutations
lcp [Fri, 30 Jun 1995 11:34:14 +0200] rev 1173
new inductive definition: permutations
Thu, 29 Jun 1995 16:53:01 +0200 Renamed some vars.
nipkow [Thu, 29 Jun 1995 16:53:01 +0200] rev 1172
Renamed some vars.
Thu, 29 Jun 1995 16:50:14 +0200 fixed comment
lcp [Thu, 29 Jun 1995 16:50:14 +0200] rev 1171
fixed comment
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.
(0) -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 +30000 tip