home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!crdgw1!rpi!zaphod.mps.ohio-state.edu!darwin.sura.net!spool.mu.edu!yale.edu!yale!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
- Message-ID: <1hsiocINN2v6@columbia.cs.ubc.ca>
- Date: 30 Dec 92 16:29:00 GMT
- References: <PK.92Dec28100620@talitiainen.cs.tut.fi> <HULTQUIS.92Dec28102345@wk206.nas.nasa.gov> <MOB.92Dec30090646@strident.think.com>
- Organization: Institute for Pure and Applied Eschatology
- Lines: 20
- NNTP-Posting-Host: columbia.cs.ubc.ca
-
- In article <MOB.92Dec30090646@strident.think.com> mob@strident.think.com
- (Mario O. Bourgoin) writes:
- >I am at a loss for naming an existing programming language that has AND and
- >OR and where they do not have the same behavior as they do in Scheme.
- >Would some programming language cogniscenti be kind enough to name a few?
-
- ISO Pascal, for one. Ada, for another (Ada has both McCarthy and
- `operator' booleans: I think the former is written `and then', and the
- latter just as `and').
-
- The subject of this thread is a clear indication why there's a problem.
- People insist on thinking of `and' as a procedure, no doubt because many
- computers have an AND instruction. `and' is a control operation, just as
- are `if' and `cond'.
-
- --
- \ 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
-