home *** CD-ROM | disk | FTP | other *** search
- Xref: sparky comp.edu:1542 comp.lang.fortran:3434 comp.lang.misc:2938 comp.arch:9237 sci.math:11014
- Newsgroups: comp.edu,comp.lang.fortran,comp.lang.misc,comp.arch,sci.math
- Path: sparky!uunet!utcsri!geac!jtsv16!itcyyz!yrloc!rbe
- From: rbe@yrloc.ipsa.reuter.COM (Robert Bernecky)
- Subject: Re: Re: Scientists as Programmers (was Re: Small Language Wanted)
- Message-ID: <1992Sep4.144825.25070@yrloc.ipsa.reuter.COM>
- Reply-To: rbe@yrloc.ipsa.reuter.COM (Robert Bernecky)
- Organization: Snake Island Research Inc, Toronto
- References: <1992Aug25.154501.8654@colorado.edu> <1992Aug26.192410.6523@ultb.isc.rit.edu> <1992Aug27.154823.583@alchemy.chem.utoronto.ca> < <KERS.92Sep2081741@cdollin.hpl.hp.com>
- Date: Fri, 4 Sep 92 14:48:25 GMT
- Lines: 39
-
- In article <KERS.92Sep2081741@cdollin.hpl.hp.com> kers@hplb.hpl.hp.com (Chris Dollin) writes:
- >In article ... KGZXK@ASUACAD.BITNET (Zafer KADI) writes:
- >
- > There is no one wrong or right on the issue of :
- >
- > 1. FORTRAN or anyother language.
- > All you Computer Science major that think Fortran is so bad can
- > you tell me anyother language that has all the forms of numbers
- > that the scinetist use such as integers, real numbers and COMPLEX
- > numbers.
- >
- >Just to keep the record straight: Common Lisp and Poplog Pop11 both have
- >integers, floats, and complexes. They also have ratios. Scheme has them all in
- >the standard, but an implementation need only provide a coherent subset.
- >
- >But this doesn't mean that I'm suggesting ``scientists'' (now *there's* an
- >abstract term!) should write in Pop.
-
- APL and J support all of the above, as well as Boolean arrays and
- recursive arrays (Arrays whose elements are other arrays).
- Booleans are extremely useful in array computations. For example,
- blanks can be removed from a list X by the expression:
- (~ X = ' ')/X
-
- Another recent posting noted that " the CDC 6600 had a 'bit count'
- instruction, but NO language supports this". In APL and J,
- the sum of any array is written as +/X. If the array happens to be
- Boolean, then this can be implemented using bit count.
-
- APL and J binaries (and J source) are available for anonymous FTP
- from watserv1.waterloo.edu, in /languages/apl.
-
- Bob
-
- Robert Bernecky rbe@yrloc.ipsa.reuter.com bernecky@itrchq.itrc.on.ca
- Snake Island Research Inc (416) 368-6944 FAX: (416) 360-4694
- 18 Fifth Street, Ward's Island
- Toronto, Ontario M5J 2B9
- Canada
-