Newsgroups: comp.lang.apl
Path: watmath!watserv1!torn!utcsri!rpi!zaphod.mps.ohio-state.edu!mips!darwin.sura.net!haven.umd.edu!socrates!socrates!rockwell
From: rockwell@socrates.umd.edu (Raul Deluth Miller-Rockwell)
Subject: Re: SIGNUM of teaching numerical methods
In-Reply-To: andrew@rentec.com's message of 14 Jul 92 03:22:04 GMT
Message-ID: <ROCKWELL.92Jul14234800@socrates.umd.edu>
Sender: rockwell@socrates.umd.edu (Raul Deluth Miller-Rockwell)
Organization: Traveller
References: <13JUL92.15740134.0088@UNBVM1.CSD.UNB.CA> <1060@kepler1.rentec.com>
Date: Wed, 15 Jul 1992 04:48:00 GMT
Lines: 20

Andrew Mullhaupt:
   I would also ask that the APL programmer think about writing
   band-reducing permutation code in APL _exclusively_ before they
   tout APL as numerically viable.)

Is this the same thing you were posting about earlier?  [Where having
the OBLIQUE adverb makes the whole problem trivial?]

If not, could you please describe the problem?  If so, ... this is an
implementation problem [which Iverson and Hui are working on,
incidentally], not a language problem.

Of course, to a large degree, numerical viability is very concerned
with the implementation of a language.  [But talking with one of the
guys at work, who has done a lot of numerical programming, the mixture
of APL with the hand coded FORTRAN libraries is an extremely adequate
approach to numerical programming.]

-- 
Raul Deluth Miller-Rockwell                   <rockwell@socrates.umd.edu>
