DeepRead
Cover of The little LISPer

The little LISPer

Daniel P. Friedman · 1974

Programming and computer science › Lisp and Scheme

#999 most recommended

About the book

An introduction to programming in LISP, covering list processing and recursion from first principles. It begins with the basic list operations (car, cdr, cons) and the predicates used to test them, then builds up to writing recursive functions over lists. The scope is the foundations of the language rather than a reference to its full library. Recursion and functional thinking can be learned by working through a sequence of short questions and answers, with the reader expected to reason out each answer rather than memorise syntax. The book's central claim is that a small set of primitives and a repeated pattern (test whether the list is empty, handle the first element, recur on the rest) are enough to express a wide range of list-processing functions. It presents this as a way of thinking about programs that can be followed on paper, without a computer.

Written by Claude from what it knows of this book.

What Hacker News says 65% recommend · 0% critical

02.5520082015202020252016 peak · 5
This bookAverage book in Lisp and Scheme

In the commenters’ own words

What Open Library readers say 4.00 from 1 rating

  1. 50
  2. 41
  3. 30
  4. 20
  5. 10
  • 1 want to read
  • 0 reading
  • 1 have read

Only 1 rating: treat the average as a hint.

Open Library’s page for the book

What critics say, via Wikipedia

No Wikipedia article about this book yet, so no critics to quote.

Reddit communities — coming later

The threads it came up in

Details

First published
1974
ISBN
9780023397639
Editions known
10 at Open Library
Open Library
OL2938932W

Fiction, generalLISPLISP (Computer program language)LISP (langage de programmation)Linguagem De Programacao (Outras)List processing (Electronic computers)OrdinateursProgrammationRecursive programming

Explore in the mosaic

Read next: its neighbours on the mosaic