← Back to discovery

The Reasoned Schemer

Daniel P. Friedman

2005184 pagesabout 3–4 hours
2005
first published
  • 2005MIT Press · 184 pages · ENGISBN 9780262294287
  • 2005The MIT Press · 184 pages · ENGISBN 9780262332491
  • 2018The MIT Press · 189 pages · ENGISBN 9780262535519
  • 2018MIT Press · 208 pages · ENGISBN 9780262348775
  • 2019MIT Press · 184 pages · ENGISBN 9780262256179

The goal of this book is to show the beauty and elegance of relational programming, which captures the essence of logic programming. The book shows how to implement a relational programming language in Scheme, or in any other functional language, and demonstrates the remarkable flexibility of the resulting relational programs. As in the first edition, the pedagogical method is a series of questions and answers, which proceed with the characteristic humor that marked *The Little Schemer* and *The Seasoned Schemer*. Familiarity with a functional language or with the first five chapters of *The Little Schemer* is assumed. For this second edition, the authors have greatly simplified the programming language used in the book, as well as the implementation of the language. In addition to revising the text extensively, and simplifying and revising the "Laws" and "Commandments," they have added explicit "Translation" rules to ease translation of Scheme functions into relations.

Content notesnot yet assessed

Quotesnone available

How do you feel?