home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!wupost!gumby!destroyer!cs.ubc.ca!columbia.cs.ubc.ca!not-for-mail
- From: manis@cs.ubc.ca (Vincent Manis)
- Newsgroups: comp.lang.scheme
- Subject: Re: applying or
- Date: 30 Dec 1992 22:11:51 -0800
- Organization: Institute for Pure and Applied Eschatology
- Lines: 18
- Message-ID: <1hu2v7INN8ng@columbia.cs.ubc.ca>
- References: <MOB.92Dec30090646@strident.think.com> <1hsiocINN2v6@columbia.cs.ubc.ca> <HULTQUIS.92Dec30161112@wk206.nas.nasa.gov>
- NNTP-Posting-Host: columbia.cs.ubc.ca
-
- In article <HULTQUIS.92Dec30161112@wk206.nas.nasa.gov>
- hultquis@nas.nasa.gov writes:
- >FORTRAN-77:
- > The .AND. and .OR. logical operands do not short-circuit.
- Well, my last experience with Fortran was back when the dialects were
- sequentially numbered (except 3). In Fortran IV, I distinctly remember
- that the compilers I used (IBM 7044, IBM 360 G) did do McCarthy
- evaluation, but the standard left it undefined. (Fortran II had a
- particularly elegant solution to this dilemma, by leaving out boolean
- operators and values completely.)
-
-
-
- --
- \ Vincent Manis <manis@cs.ubc.ca> "There is no law that vulgarity and
- \ Computer Science, Langara College literary excellence cannot coexist."
- /\ 100 W. 49th Ave, Vancouver, BC, Canada (604) 324-5205 -- A. Trevor Hodge
- / \ Co-author of ``The Schematics of Computation'', Prentice-Hall, Jan 1994
-