The Little Schemer Daniel P. Friedman, Duane Bibby, Gerald J. Sussman, Matthias Felleisen
Publisher: MIT

I have been reading the Little Schemer recently. Friedman, Matthias Felleisen, Duane Bibby, Gerald J. After umpteen attempts with umpteen books, I'm finally slogging through "The Little Schemer." I'm on page 88 and I've just made it through my first look at (what is for me) serious recursion. <> is a amazing book , still not read it completely. That's all the Y-combinator does. A few weeks ago I asked the twittersphere for some advice on how I could get better at writing recursive functions and one of the pieces of advice was to work through The Little Schemer. My derivation is based on the one in "The Little Schemer" book. Sussman Publisher: The M.I.T Press; 4 edition 1996 | 216 Pages | ISBN: 0262560992 | File type: PDF | 3 mb. Admittedly it took some time to get into, but now I can safely say that it is bordering on the magical. Friedman is a quirky little book with a quixotic appeal. Function programming, scheme, programming, lisp. I'll use the Scheme programming language to derive the Y-combinator. The Little Schemer by Daniel P. The little shcemer 这本书通读一遍对 shceme 语法将会有个大致的了解。 本身组织方式也比较有趣，通俗易懂。 强力推荐在SICP 前把它通读一遍，有精力的话做做实验。1. Wednesday, January 25, 2012 11:11:08 AM. Dan Friedman uses the Socratic style of teaching (Q&A style if you're not interested in Greek history), in which you learn by asking questions. And this is coming from someone who didn't understand it. Here's a pretty simple definition for a function that shuffles a list, using almost only the functions and ideas that we've already covered in class and in the first couple of chapters of The Little Schemer. The Little Schemer By Daniel P. Some set function code in << The little schemer >>.