Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!ames!ncar!boulder!unicads!les
From: les@unicads.UUCP (Les Milash)
Newsgroups: comp.lang.scheme
Subject: Re: top level definitions
Message-ID: <417@unicads.UUCP>
Date: 3 May 89 21:21:55 GMT
References: <8905030850.AA21221@chamartin.AI.MIT.EDU> <8912@polya.Stanford.EDU>
Reply-To: les@unicads.UUCP (Les Milash)
Organization: Unicad  Boulder, CO
Lines: 26

In article <8912@polya.Stanford.EDU> mxh@sumex-aim.Stanford.EDU (Max Hailperin) writes:
>[Abelson and Sussman, p. 8], which would be legal under R3RS's set!-like
  ^^^^^^^^^^^^^^^^^^^ sorry to be so ignorant, but what is this?
I've seen R*S's but never a book on Scheme.


(After reading about Screme on the 88K in ASPLOS III I'm getting tempted to
write one for INMOS Transputers.  Any huge interest in this out there?
Imagine the potential: "the embedded symbolic computer".  For a microwave
that can tell you WHY weenies take 2 minutes, or a dashboard that can
debate the wisdom of using seatbelts AND WIN.

Can anybody point me at thoughts about Schemes on multiprocessors (i suspect
Scheme is a great language for multiprocessors but I don't really know the
details) or just an overview of Scheme (i suspect that it's "Lisp without
X or Y or Z" which gives you "Lisp with some additional magic powers").
My goal is to have a nice language for programming a single
processor, and running bunches of those, but perhaps there are some slick
things permitting parallel evaluation of subexpressions  by multple 
processors etc.)

any other tips for a rank beginner?  

(be nice, i'm just a fresh convert from the C world, i just got
sick of having to do in my programs what Scheme does for me in
the language.)