News for hackers. Stuff that matters.
Re:The Roots of Lisp by rayiner on Tuesday October 25, 2011 @12:35AM (#3152826)
You can describe the execution semantics of a "C" machine or a "Lisp" machine in a paragraph. Can't really do the same for a Spineless Tagless G-Machine...
Re:The Roots of Lisp by andolanra on Tuesday October 25, 2011 @03:45AM (#3153229)
The semantics for System F could be explained in roughly a paragraph. Lisp is, more or less, simply typed lambda calculus + code-as-nested-lists + compile-time computation mechanisms; Haskell and ML are System F + various type mechanisms (e.g. typeclasses or modules.)

On the other hand, I suspect an abstract machine for executing Lisp—one that accounted for reader macros and the like—would be of roughly the same complexity as the STG machine.

Re:The Roots of Lisp by skew on Tuesday October 25, 2011 @03:51AM (#3153239)
Apples and oranges. Can you explain implicit continuation representation in a paragraph?

The simple description of lazy evaluation is graph reduction. ML doesn't even use lazy evalution.