DeepRead
Cover of Recursive programming techniques

Recursive programming techniques

William H. Burge · 1975

Programming and computer science › Compilers and interpreters

#8,204 most recommended

About the book

Recursive Programming Techniques is a 1975 book on writing programs whose functions and data are defined in terms of themselves. It covers recursive algorithms over lists, trees and other structured data, along with the combinator and lambda-calculus material behind the subject. Its examples are written in a functional style. Its central claim is that recursion is a primary tool for programming rather than a special case, because many problems have a recursive structure that can be stated directly and reasoned about more reliably than loop-based code. It argues that recursive definitions can be systematically transformed into equivalent iterative forms, and that higher-order functions and combinators let such definitions be composed and reused. The book presents these methods as techniques a programmer can apply and verify, not as ad hoc tricks.

Written by Claude from what it knows of this book.

What Hacker News says 75% recommend · 0% critical

024201020122014201620192010 peak · 1
This bookAverage book in Compilers and interpreters

In the commenters’ own words

What Open Library readers say

No Open Library reader has rated it yet.

  • 3 want to read
  • 0 reading
  • 0 have read

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
1975
ISBN
9780201144505
Editions known
2 at Open Library
Open Library
OL7015039W

Combinatory logicRecursive programming

Explore in the mosaic

Read next: its neighbours on the mosaic