Contrary to popular belief, logic programming doesn't always mean programming in Prolog. In this groundbreaking book, Friedman and Kiselyov extend Scheme to form a completely new kind of logic programming system, one which is in many ways even more elegant than Prolog. Written in the same classic question-and-answer format as the authors' previous book The Little Schemer, The Reasoned Schemer covers goals, first-class relations, interleaved and non-interleaved backtracking, the relationship between relational and functional programming, and much more. Reading this book will not only cause your geek rating to skyrocket and impress all the Cool Kids, it will also open your eyes to a paradigm of programming which most programmers are completely unaware of, but which will undoubtedly play a significant role in the programming systems of the future. More importantly, though, this book is great fun to read and will make you a better programmer.
(Michael Vanier, Caltech)
About the Author
Daniel P. Friedman is Professor of Computer Science at Indiana University and is the author of many books published by the MIT Press, including The Little Schemer
(fourth edition, 1995), The Seasoned Schemer
(1995), A Little Java, A Few Patterns
(1997), each of these coauthored with Matthias Felleisen, and The Reasoned Schemer
(2005), coauthored with William E. Byrd and Oleg Kiselyov.
William E. Byrd is a PhD candidate in Computer Science at Indiana University.
Oleg Kiselyov is a computer scientist from Monterey, California.