Book Announcement--Proof Theory and Logic Programming: Computation as Proof Search
15 views
Skip to first unread message
Elaine Pimentel
Jan 6, 2026, 1:29:07 AM (7 days ago) Jan 6
to Lista acadêmica brasileira dos profissionais e estudantes da área de LOGICA
Message from Prof. Dale Miller (Inria Saclay, FR)
****
Dear colleagues,
I am pleased to announce the publication of my new book,
``Proof Theory and Logic Programming: Computation as Proof Search''
(Cambridge University Press, December 2025).
While the proof-as-program paradigm is widely used to explain
functional programming, this book explores the alternative paradigm:
computation as the search for proofs. By shifting the foundation of
logic programming from resolution and Horn clauses to structural proof
theory and the sequent calculus, we can extend the reach of logic
programming into intuitionistic and linear logics, incorporating both
first-order and higher-order quantification.
Key Features of the Book
* Theoretical Foundations: Detailed coverage of the sequent calculus,
focused proofs, and cut-elimination.
* Logic Expressiveness: Exploration of classical, intuitionistic, and
linear logics within a programming context.
* Practical Applications: Case studies in security protocols,
operational semantics, and static analysis.
The book is designed for advanced undergraduate and graduate students,
researchers, and educators. No prior background in the sequent
calculus is assumed, making it accessible to anyone with a general
interest in logic and computer science.
More Information & Resources
- Order from the Publisher: Cambridge University Press:
https://doi.org/10.1017/9781009561280
- Author’s Webpage: View table of contents, endorsements, and preprint
https://www.lix.polytechnique.fr/Labo/Dale.Miller/ptlp/
Best regards,
Dale Miller
I am pleased to announce the publication of my new book,
``Proof Theory and Logic Programming: Computation as Proof Search''
(Cambridge University Press, December 2025).
While the proof-as-program paradigm is widely used to explain
functional programming, this book explores the alternative paradigm:
computation as the search for proofs. By shifting the foundation of
logic programming from resolution and Horn clauses to structural proof
theory and the sequent calculus, we can extend the reach of logic
programming into intuitionistic and linear logics, incorporating both
first-order and higher-order quantification.
Key Features of the Book
* Theoretical Foundations: Detailed coverage of the sequent calculus,
focused proofs, and cut-elimination.
* Logic Expressiveness: Exploration of classical, intuitionistic, and
linear logics within a programming context.
* Practical Applications: Case studies in security protocols,
operational semantics, and static analysis.
The book is designed for advanced undergraduate and graduate students,
researchers, and educators. No prior background in the sequent
calculus is assumed, making it accessible to anyone with a general
interest in logic and computer science.
More Information & Resources
- Order from the Publisher: Cambridge University Press:
https://doi.org/10.1017/9781009561280
- Author’s Webpage: View table of contents, endorsements, and preprint
https://www.lix.polytechnique.fr/Labo/Dale.Miller/ptlp/
Best regards,
Dale Miller
****
-- Elaine.
-----------------------------------
Elaine Pimentel
Schools Outreach Lead
Professor of Logic and Computation
Deputy Director of the Computer Science and Philosophy programme
Programming Principles, Logic, and Verification
Department of Computer Science, Office: Room 3.11, 66-72 Gower Street
University College London
UCL Computer Science is an Athena Swan Gold award winner for gender equality
UCL is ranked among the top ten in the QS World University Rankings 2024 and is winner of The Times and Sunday Times University of the Year 2024
-----------------------------------
Reply all
Reply to author
Forward
0 new messages