3 ms·
For a wide swath of programmers, a Lisp is something with lists made of mutable cons cells, terminated by a nil symbol which is both false and the empty list. I
by kazinator 8y ago
For a wide swath of programmers, a Lisp is something with lists made of mutable cons cells, terminated by a nil symbol which is both false and the empty list. I don't think you will encounter too many Common Lisp programmers who don't think that Emacs Lisp is a "Lisp".
Scheme doesn't use "Lisp" in its name. It has its own Usenet newsgroup; Scheme programming is rarely discussed in comp.lang.lisp. Likewise it has its own subreddit; r/lisp isn't used much for discussing Scheme.
"I would rather this were implemented in Scheme rather than Lisp" (or vice versa) is a perfectly understandable statement and sentiment that is not simply about semantic labels.
- mbrock 8y agoAnd now Racket, which used to be a Scheme, doesn't call itself a Scheme anymore. In fact it describes itself on its web site as "The best of Scheme and Lisp."
- kazinator 8y agoThat is correct; you can't be Scheme if you just have the best of it, and not the rest of it. E.g. Racket doesn't have set-car! and set-cdr! so RnRS-conforming Scheme programs which rely on these won't work.
- mbrock 8y agoOn the other hand some weirdos try to claim that Python is “a Lisp”...
- soegaard 8y agoRacket does support mutable pairs. http://docs.racket-lang.org/reference/mpairs.html?q=mcons#%28part._.Mutable_.Pair_.Constructors_and_.Selectors%29 http://docs.racket-lang.org/reference/mpairs.html?q=mcons#%2...
- kazinator 8y agoThat's nice, but in Scheme, all pairs constructed by any code anywhere are mutable, and structure made out of mutable pairs can be passed into any library function. An object notation like (a b c) read from a stream gives you a mutable object. It's a significant language difference that can't be papered over with a data type and handful of functions.
- soegaard 8y agoThat's a different concern. Racket supports both immutable and mutable cons cells. Convenient or not - you decide. Oh, been watching too much YouTube. In both Racket and Scheme it is usually a good idea to program in a functional style - i.e. not to mutate pairs. The compiler and runtime system can in some situations handle immutable pairs more efficiently than mutable pairs. So if mutable pairs are seldomly used, it makes sense to make immutable pairs the default. The rationale why Racket made the shift is described here: http://blog.racket-lang.org/2007/11/getting-rid-of-set-car-and-set-cdr.html http://blog.racket-lang.org/2007/11/getting-rid-of-set-car-a... In short: the Racket community sees the immutable default as a plus.