Cambridge University Press Proof Theory and Logic Programming: Computation as Proof Search

Proof Theory and Logic Programming: Computation as Proof Search by Dale Miller is a refreshing look at the role that logic, specifically proof theory, plays in the foundation of computation. The book takes the perspective of a less-travelled route of applications of proof theory to computation - through the lens of proof search, a systematic and disciplined approach for searching for proofs of logical propositions. The book assumes minimal prerequisites, which makes it accessible to novices and experts alike. Its comprehensive coverage of decades of work in the field should make this an excellent reference textbook. This book is a clear and elegant journey through the connections between proof theory and programming. With a rigorous treatment of logic programming via sequent calculus and focused proof systems, Miller shows how logic can shape the way we think about computation without losing sight of practical relevance. Proof Theory and Logic Programming is a great resource for students, researchers, and anyone interested in exploring the theoretical foundations of logic-based programming languages. This book takes the reader on a rigorous, yet accessible journey starting from fundamental proof theoretic principles to understanding proof search as the computational foundation of logic programming. It is a joy to read and a valuable resource for anyone interested in the intersection of logic, computation, and language design.