The Reasoned Schemer
Work detail
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.
Overview
Shared work-level identity and catalog context.
Contributors
People credited with this work in the active catalog.
- Open Author
Daniel P. Friedman
- Open Author
Oleg Kiselyov
- Open Author
Duane Bibby
- Open Author
William E. Byrd
- Open Author
William E. Byrd
- Open Author
Jason Hemann
Editions
Publication-specific versions linked to this work only.