LISP in small pieces. Christian Queinnec, Kathleen Callaway

LISP in small pieces


LISP.in.small.pieces.pdf
ISBN: 0521562473,9780521562478 | 526 pages | 14 Mb


Download LISP in small pieces



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




Scheme is probably easier to implement than CL, because it is much, much smaller. So one would expect that the probability of buying the "Blue Book" given a purchase of the "Lisp in Small Pieces" would be much higher than the probability of purchasing Harry Potter. It seems to me that there is a clear connection with reflective towers, e.g. Today I made the first order – “Lisp in Small Pieces” – it's just the kind of book to buy as a special present to myself. I doubt I would agree to shell out the $80 it costs had I not had the RAC money in PayPal already. But I definitely wouldn't say that its standard has been written with optimization in mind. One of my New Year's goals is to re-read Lisp in Small Pieces and implement all 11 interpreters and 2 compilers. 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. As discussed in extraordinary detail in Lisp in Small Pieces, but I don't recall whether the latter (or anything else) examines the connection. 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.