Mon premier blog

LISP in small pieces Christian Queinnec, Kathleen Callaway
Publisher: Cambridge University Press

23:32; Blogger ern said Awesome. I refer you to the excellent book "Lisp in Small Pieces". I'd have to agree with Jens Axel that “Lisp In Small Pieces”, Christian Queinnec, 1994, first English translation, Cambridge University Press, 1996 is really without peer as far as tesxts go. Lisp in Small Pieces builds entire compilers ;; based upon this idea. The great idea of quotation at least traces back to Lisp, where program is also a kind of data – the execution behavior of a piece of program is completely controllable by the user, just treat it as input data and write a custom evaluator for it. Writing a recursive function to perform that calculation is pretty straight forward, and once we put all of these pieces together in our create-world routine, we have a working proof of concept. The default Lisp evaluator is eval, we can easily write a Remember F# has a rich set of syntax while a domain language takes a small subset of it is usually enough expressive. I remember reading in Lisp In Small Pieces that CDR is statistically more often encountered that CAR So my final answer is "less CARs than CDRs in the source code of PLT". Am cherry-picking my way through Queinnec's Lisp in Small Pieces, and your syntax-case exposition is exactly what I needed to introduce dynamic bindings. Got started on a major preoccupation - a deep study of Lisp In Small Pieces. You might not care about Lisp but this is an excellent example of literate programming. Click here to download: scheme1.ss (5 KB). The following code snipped from the REPL prompt We're glossing over a few details here, but if you have a little experience working with Lisp then you should have a pretty good idea of how to implement the above. September 6, 2007 at 3:23 PM · Robby said. One of the best approach to language implementation I ever came across! Homoiconicity is what makes lisp so appealing to me, ;; far more than most other languages.