Some of the most beautiful discoveries in programming languages are their tight connections to logic and proof theory. These connections take two basic forms. In functional programming, we interpret complete proofs as programs, where computation arises from proof reduction according to a fixed strategy. In logic programming, we interpret logical theories as programs, where computation arises from proof construction according to a fixed strategy. This book is concerned with the second form when the underlying logic is higher-order logic. It covers syntax, semantics, and pragmatics of higher-order logic programming in a systematic and easy-to-read manner that will be of great value as introduction and reference for students and researchers in programming languages.
展开▼
