0.pre8.114:

[sbcl.git] / CREDITS

diff --git a/CREDITS b/CREDITS
index d0de362..38e36ba 100644 (file)
--- a/CREDITS
+++ b/CREDITS
@@ -516,6 +516,11 @@ Daniel Barlow:
   for SBCL (as well as for free Common Lisp in general) through
   his CLiki website.
 
+Robert E. Brown:
+  He has reported various bugs and submitted several patches, 
+  especially improving removing gratuitous efficiencies in the
+  standard library.
+
 Cadabra, Inc. (later merged into GoTo.com):
   They hired Bill Newman to do some consulting for them,
   including the implementation of EQUALP hash tables for CMU CL;
@@ -551,6 +556,9 @@ Matthias Hoelzl:
 Espen S Johnsen:
   He provided an ANSI-compliant version of CHANGE-CLASS for PCL.
 
+Frederik Kuivinen:
+  He showed how to implement the DEBUG-RETURN functionality.
+
 Arthur Lemmens:
   He found and fixed a number of SBCL bugs while partially porting
   SBCL to bootstrap under Lispworks for Windows
@@ -579,7 +587,10 @@ Dave McDonald:
 
 Gerd Moellman:
   He has made many cleanups and improvements, small and large, in
-  CMU CL (mostly in PCL), which we have gratefully ported to SBCL.
+  CMU CL (mostly in PCL), which we have gratefully ported to SBCL.  Of
+  particular note is his ctor MAKE-INSTANCE optimization, which is both
+  faster in the typical case than the old optimizations in PCL and
+  less buggy.
 
 William ("Bill") Newman:
   He continued to maintain SBCL after the fork, increasing ANSI
@@ -589,6 +600,9 @@ William ("Bill") Newman:
   updating documentation, and even, for better or worse, getting
   rid of various functionality (e.g. the byte interpreter).
 
+Kevin M. Rosenberg:
+  He provided the ACL-style toplevel.
+
 Christophe Rhodes:
   He ported SBCL to SPARC, made various port-related and SPARC-related
   changes (like *BACKEND-SUBFEATURES*), made many fixes and
@@ -616,7 +630,8 @@ Peter Van Eynde:
   reports as well.
 
 Valtteri Vuorikoski:
-  He ported SBCL to NetBSD.
+  He ported SBCL to NetBSD, and also fixed a long-standing bug in
+  DEFSTRUCT with respect to colliding accessor names.
 
 Colin Walters:
   His O(N) implementation of the general case of MAP, posted on the