It should be ftp://st.cs.uiuc.edu, not http://st.cs.uiuc.edu.
John Brant ----------------------------------- At 09:52 PM 1/29/98 -0600, James Rupert wrote:
Ralph,
I tried to access the paper mentioned below, but the site is inaccessible. Is this the right location? Is this server site down? Any ideas?
Regards, James -----Original Message----- From: Ralph E. Johnson johnson@cs.uiuc.edu To: squeak@cs.uiuc.edu squeak@cs.uiuc.edu Date: Friday, January 30, 1998 8:37 AM Subject: Re: Transcendental Numbers
Double-dispatching was faster in VisualWorks than coercion was. It seems a lot more elegant to me, as well. Further, it works better for matrices. Kurt Hebel made an implementation for ParcPlace Smalltalk before ParcPlace switched over, and we wrote a paper about it that you can find at http://st.cs.uiuc.edu/pub/papers/patterns/double-dispatch.ps The code is at http://st.cs.uiuc.edu/pub/Smalltalk/st80_r4/arithmetic.st It includes all sorts of wierd arithmetic objects, such as matrices, infininities and infinitessimals, polynomials and functions. It shouldn't be that hard to port to Squeak.
-Ralph
squeak-dev@lists.squeakfoundation.org