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;
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
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
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
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