Subject:
|
Re: Scheme
|
Newsgroups:
|
lugnet.robotics
|
Date:
|
Tue, 11 May 1999 16:12:07 GMT
|
Original-From:
|
Alex Wetmore <alex@phred.STOPSPAMorg>
|
Viewed:
|
822 times
|
| |
|
|
From: Joel Shafer <joel@connect.net>
> Could you give a brief description of scheme? I've heard that it is a
> fairly high level language and I know that a compiler or interpreter • exists
> for it on linux.
http://www.scheme.org/
In my view Scheme is the most useful subset of lisp, designed to make a
small, elegant, functional language. This is compared to Common Lisp, which
is kind of a superset of the various lisp-dialects, meant to contain
everything.
Note: I am not a lisp-expert, I just used Scheme in one of my university
classes, and have played around with Common-lisp a little bit. I would
probably recommend playing around with PbForth on the RCX. Forth is a
lightweight, interpreted, stack-based language. It doesn't have lambda
functions (I don't think it does at least), but has a similar sort of
environment to most scheme systems (you can type directly into the
interpreter).
alex
--
Did you check the web site first?: http://www.crynwr.com/lego-robotics
|
|
Message has 1 Reply:
 | | Re: Scheme
|
| It strikes me that Scheme is largely an academic language. Granted, there are a few Scheme devotees out there who worship the language, but they seem to be all at MIT or Rice. I think they've even written modules for web programming with Scheme, but (...) (25 years ago, 11-May-99, to lugnet.robotics)
|
Message is in Reply To:
| | Re: Scheme
|
| Could you give a brief description of scheme? I've heard that it is a fairly high level language and I know that a compiler or interpreter exists for it on linux. (...) -- Did you check the web site first?: (URL) (25 years ago, 11-May-99, to lugnet.robotics)
|
11 Messages in This Thread:
 
- Entire Thread on One Page:
- Nested:
All | Brief | Compact | Dots
Linear:
All | Brief | Compact
This Message and its Replies on One Page:
- Nested:
All | Brief | Compact | Dots
Linear:
All | Brief | Compact
|
|
|
|
