Buy New
$45.00$45.00
FREE delivery Thursday, April 23
Ships from: Amazon.com Sold by: Amazon.com
Used - Like New
$4.15$4.15
$4.73 delivery April 27 - 30
Ships from: KT Goods LLC Sold by: KT Goods LLC
Sorry, there was a problem.
There was an error retrieving your Wish Lists. Please try again.Sorry, there was a problem.
List unavailable.
Download the free Kindle app and start reading Kindle books instantly on your smartphone, tablet, or computer - no Kindle device required.
Read instantly on your browser with Kindle for Web.
Using your mobile phone camera - scan the code below and download the Kindle app.
Follow the authors
OK
The Little Schemer - 4th Edition 4th ed. Edition
Purchase options and add-ons
- ISBN-100262560992
- ISBN-13978-0262560993
- Edition4th ed.
- PublisherThe MIT Press
- Publication dateDecember 21, 1995
- LanguageEnglish
- Dimensions9.04 x 6.94 x 0.51 inches
- Print length216 pages
Frequently bought together

Deals on related products
Customers also bought or read
- Structure and Interpretation of Computer Programs - 2nd Edition (MIT Electrical Engineering and Computer Science)
Paperback$60.22$60.22FREE delivery Thu, Apr 23 - How to Design Programs, second edition: An Introduction to Programming and Computing (Mit Press)
Paperback$60.00$60.00FREE delivery Thu, Apr 23 - The Algorithm Design Manual (Texts in Computer Science)
Hardcover$57.64$57.64FREE delivery Apr 29 - May 3 - Common LISP: A Gentle Introduction to Symbolic Computation (Dover Books on Engineering)
Paperback$31.64$31.64Delivery Apr 30 - May 6 - The Practice of Programming (Addison-Wesley Professional Computing Series)
Paperback$49.99$49.99FREE delivery Apr 27 - 30 - Essentials of Compilation: An Incremental Approach in Racket
Hardcover$28.49$28.49Delivery Thu, Apr 23 - Operating Systems: Three Easy Pieces#1 Best SellerComputer Operating Systems Theory
Paperback$28.27$28.27Delivery Thu, Apr 23 - Code: The Hidden Language of Computer Hardware and Software
Paperback$33.17$33.17Delivery Thu, Apr 23 - Racket Programming the Fun Way: From Strings to Turing Machines
Paperback$33.61$33.61$3.99 delivery Fri, May 8 - Mythical Man-Month, The: Essays on Software Engineering, Anniversary Edition
Paperback$28.26$28.26Delivery Thu, Apr 23 - Introduction to Algorithms, fourth edition#1 Best SellerComputer Algorithms
Hardcover$93.60$93.60FREE delivery Thu, Apr 23 - The Pragmatic Programmer: Your Journey To Mastery, 20th Anniversary Edition (2nd Edition)#1 Best SellerSoftware Testing
Hardcover$41.64$41.64FREE delivery Thu, Apr 23
Editorial Reviews
Amazon.com Review
Review
From the Back Cover
About the Author
Matthias Felleisen is Trustee Professor in the College of Computer Science at Northeastern University.
Product details
- Publisher : The MIT Press
- Publication date : December 21, 1995
- Edition : 4th ed.
- Language : English
- Print length : 216 pages
- ISBN-10 : 0262560992
- ISBN-13 : 978-0262560993
- Item Weight : 11.5 ounces
- Reading age : 18 years and up
- Dimensions : 9.04 x 6.94 x 0.51 inches
- Grade level : 12 and up
- Best Sellers Rank: #104,044 in Books (See Top 100 in Books)
- #1 in Lisp Programming
- #77 in Software Development (Books)
- #190 in Computer Software (Books)
- Customer Reviews:
About the authors

Matthias Felleisen grew up in Germany and came to the United States in 1980 at first and in January 1984 for good.
In 1987, he received his doctorate from Daniel P. Friedman, with whom he had also rewritten The Little Lisper, his first book. At this point, The Little Lisper has been in print for over 40 years, an incredible age in the fast-lived world of programming and programming languages. The book covers the fundamental topic of recursive programming in an entertaining dialog style. While the book summarizes the high level ideas as a collection of ten commandments, the reader must work through the material and formulate lessons on his or her own.
Felleisen spent from 1987 through 2001 at Rice University in Houston, Texas, a bustling, always growing city of friendly people. He conducted research on every kind of topic in programming languages; data structures and algorithms for the translation process; the mathematical theory of behavioral equality; and the design of large systems. Many of his ideas came to him while he swam his daily miles in the pool of West University Place, a small town within Houston.
One particularly important idea is due to Carrie, the baby sitter that he and his wife used to hire. The sitter would often work on her high school math problems while Felleisen and his wife would go to the symphony or the theatre. One evening Felleisen noticed that the baby sitter had not made any progress on her homework while they had been out for three hours. He showed the baby sitter how to solve her problems, using the ideas in The Little Lisper. The success was surprising and wonderful. The baby sitter's grades jumped dramatically, and Felleisen and his research team started work on a curriculum that synthesizes computer science and mathematics for novice programmers. Felleisen and his doctoral students wrote a book on this idea, How to Design Programs, and spent almost two decades educating teachers and faculty colleagues about it. For this work, Felleisen received the Karl Karlstrom Award in 2009, the major recognition by the professional computer science organization (ACM) for individuals who make critical contributions to the field.
In 2001, Felleisen moved to Boston, Massachusetts where he teaches at Northeastern University. He continues to conduct research in programming languages and train PhD students in this central field of computer science.

Gerald Jay Sussman (February 8, 1947) is the Panasonic Professor of Electrical Engineering at the Massachusetts Institute of Technology (MIT). He received his S.B. and Ph.D. degrees in mathematics from MIT in 1968 and 1973 respectively. He has been involved in artificial intelligence research at MIT since 1964. His research has centered on understanding the problem-solving strategies used by scientists and engineers, with the goals of automating parts of the process and formalizing it to provide more effective methods of science and engineering education. Sussman has also worked in computer languages, in computer architecture and in VLSI design.
Bio from Wikipedia, the free encyclopedia. Photo by Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science [CC BY-SA 1.0 (http://creativecommons.org/licenses/by-sa/1.0)], via Wikimedia Commons.

Discover more of the author’s books, see similar authors, read book recommendations and more.

Daniel P. Friedman has been a Professor of Computer Science in the School of Informatics, Computing, and Engineering at Indiana University for nearly half a century and is the author of many books published by the MIT Press, including The Little Schemer and The Seasoned Schemer (with Matthias Felleisen); The Little Prover (with Carl Eastlund); The Reasoned Schemer (with William E. Byrd, Oleg Kiselyov, and Jason Hemann); and The Little Typer (with David Christiansen).
Related products with free delivery on eligible orders
Customer reviews
Customer Reviews, including Product Star Ratings help customers to learn more about the product and decide whether it is the right product for them.
To calculate the overall star rating and percentage breakdown by star, we don’t use a simple average. Instead, our system considers things like how recent a review is and if the reviewer bought the item on Amazon. It also analyzed reviews to verify trustworthiness.
Learn more how customers reviews work on AmazonTop reviews from the United States
There was a problem filtering reviews. Please reload the page.
- Reviewed in the United States on February 21, 2001Format: PaperbackVerified PurchaseThis is a wonderful book for people who enjoy having their minds stretched. It starts from the most elementary concepts (this is a number, this is a symbol) and then proceeds to teach you how to program in scheme (a lisp dialect) using a question-and-answer approach, with the questions on the left hand side of the page and the answers on the right. Most of the teaching is by example; the authors show you something several times in several different guises in order to get you to understand the pattern underlying the programming examples. This form of teaching-by-pattern-recognition is especially useful for scheme, because lisp-based languages represent such a different paradigm from more conventional computer languages that it really helps to have the pattern in mind when you want to write a new function. The authors show how the basic elements of lisp (atoms, numbers and lists) can be used to solve an amazing variety of problems, many of which would be much harder (or impossible) in more conventional computer languages. Most of the book is so easy that a complete novice who had never programmed before could understand it, but the authors sneakily keep increasing the complexity until in the last three chapters they cover continuation-passing style, the applicative-order Y combinator (!) and writing a scheme interpreter in scheme (!!). Some of these topics would go over the head of most computer science Ph.D.'s (go ahead, ask one what the Y combinator is -- I dare you!). This is not the book to read if you're looking for a "teach yourself visual basic in 20 minutes" kind of book, but if you like programming and you enjoy having your mind stretched, you could not do better than this book (or its companion book, the Seasoned Schemer).
- Reviewed in the United States on June 8, 2011Format: PaperbackVerified PurchaseLittle Schemer is without a doubt one of the best books I have ever read on the subject of recursion, and what is interesting because they never really go into a formal definition of what recursion is, as most texts on computer science try to. Instead they show the reader time and time again what recursion is, while providing a great series of rules (commandments) on how to get the most out of recursion, particually in a tail-recursive language like Scheme.
The book is structured as a series of questions and answers. Each page has several questions on the left hand side, with answers on the right hand side. The overall interpretation of the book is that you can read this without a computer, using pencil and paper to work through the many questions in the book.
As the reader progresses they will continue to develop and reimplement many useful tools in Scheme that become more and more practical as the text goes on. What is great about this method is the pacing and the steady revealing of topics and good practices presented by the author. Because they gradually accustom the reader to topics like recursion, list operations, and lambda, by the time they show how define is unneccessary in Scheme due to the Y Combinator this rather challenging concept seems somewhat intuitive.
Overall I think this is one of the greatest computer science books I have ever read. Sure it may not formally define things or be the absolute easiest text to read on the Scheme language itself, but this book should not be used as a reference product - it should be used as a tool bye which the reader strengthens their fundamentals in computer science and programmer, whether or not they ever touch Scheme again.
- Reviewed in the United States on November 5, 2013Format: PaperbackVerified PurchaseThis is a wonderful and thought-provoking book -- almost a gateway drug to higher math and computer science concepts that does not in itself require anything more than basic high-school math.
It is also an excellent and non-trivial introduction to Scheme/Lisp, and more importantly, to thinking about recursive programming. The progression ramps up quickly, so be sure to read very carefully. If you skim this book you will quickly be lost within a couple of pages, so be very sure to read and re-read anything that you don't completely understand. It's also very important to go through each mini-program carefully to make sure that you understand its syntax and effects. By the time you get to the chapter on the applicative-order Y-combinator the slightest misinterpretation of a function will have your brain spinning in circles.
The format of the book is wonderful. I wish more books were written using the socratic method.
- Reviewed in the United States on November 8, 2019Format: PaperbackVerified PurchaseThis will remain on my shelf of favorites for a long time to come.
As a reader you will quickly grasp the unique format of this book. It is light-hearted enough to remain unintimidating, but moves quickly enough to get across an impressive array of knowledge.
As others have mentioned, recursive thinking is more demonstrated than directly taught, which I found very effective.
The final chapters are mind bending and wonderful. It addresses monumental historical theories from Gödel, Turing, and Church while keeping its consistent, simple tone. Only after you've understood an idea fully is its historical significance revealed, and only tangentially to the subject matter at that!
I commend the authors for their innovative teaching strategies. I was lucky to attend a Racket course overseen by Felleisen after reading this which was a wonderful experience.
- Reviewed in the United States on May 5, 2013Format: PaperbackVerified PurchaseThis book teaches programming in a very different way. It is mostly made up of examples with a very short description (the size of a tweet most of the time). It's up to the reader to follow along and understand the snippet completely, so that the next example will make sense.
The book is challenging and fun to read. After reading this book, my recursion skills went from a level 3 to a level 8.
Top reviews from other countries
Antonio BiancoReviewed in Germany on January 30, 20205.0 out of 5 stars great book
Format: PaperbackVerified PurchaseThis is one of the great books you want to read if you are interested in the LISP language family.
It approaches it using Scheme (which is somewhat one of the clearest programming language syntax out there)
AlfieReviewed in Australia on August 26, 20195.0 out of 5 stars I finally understand functional programming (and how to think about recursion properly)
Format: PaperbackVerified PurchaseI've tried to read several introductions to functional programming books over the years, across several languages (Prolog, Haskell, Lisp), and with each book only after the first few chapters, I've found myself flipping tables and moving on because it just didn't make any sense. However, after picking up this book up, for the first time, everything just fell into place! But not only did it click, it was slap-in-the-face obvious and left me feeling silly that I failed all those times before.
Word of warning though... this was the first book that I've ever seen in the Q&A style. At first it was quite annoying and made me think why did they write it this way, this is childish. But now I think WOW every hard topic book should be written like this. It's mindblowingly good. Don't give up!!
This book is highly entertaining and will get you programming functional in no time. Hats off to the authors!
Amazon CustomerReviewed in Canada on April 5, 20255.0 out of 5 stars This deceptively quirky book is absolutely mind expanding.
Format: PaperbackVerified PurchaseI've been a software developer for decades. I've read a lot of programming books over the years, but never one like this. The early chapters of this book I just zipped through at high speeds. The content becomes progressively more challenging. The chapters near the end gave my brain a very good workout. If you make a good faith effort to take on the concepts in the book on their own terms it will give you a different perspective on programming.
MarcusReviewed in the United Kingdom on May 17, 20115.0 out of 5 stars Avoid if dieting or low attention span. Otherwise a must read
Format: PaperbackVerified PurchaseWhat is the style of the book?
Short questions followed by answers.
Do you have to try to answer the questions before you read the answers?
Not necessarily all the time, but it is important you understand each question and answer before proceeding, Some of the time I used a piece of paper to hide the answers. The book starts off slow, but gets very hard towards the end. If you lose the thread of the argument, you must backtrack and pick it up again.
Is the book patronising?
I can see that some people might find the question-answer style and the drawings of elephants irritating, but I find them charming.
I want a manual on scheme. Is this the book for me?
This is the right book for you to read, but it is not a manual on scheme.
Who else ought to read the book?
Anyone interested in programming, in any language. Anyone who likes to think hard.
Who ought not to read the book?
Anyone on a diet. (The authors are obsessed with food.) Anyone who does not relish a challenge.
Is it the best book available on functional programming?
I have not read all of them, so cannot say, but it is the best textbook I have read on any subject.
-
river125Reviewed in Japan on July 29, 20135.0 out of 5 stars お腹いっぱい
Format: PaperbackVerified PurchaseScheme/LISPによる再帰と無名関数の入門書。後半のmultirember&coからが難所で、じっくり取り組まないと理解できない。続く第9章ではYコンビネータを導出し、最後の第10章ではSchemeインタープリタを実装する。
いくつか疑問が残るものの、何とか最後まで食らいついた。お腹いっぱい。続編(The Seasoned Schemer)に進むのは当分先で。
英語の難易度は高くない。唐突に話題が変わって戸惑うことは多かった。対話形式は嫌いだが、先生と生徒の会話に仕立てようとはしてないので、まぁ許せる。





















