Dale Miller

Gopalan Nadathur

A programming language based on a higher-order logic provides a declarative approach to capturing computations involving types, proofs and other syntactic structures.

Programming with Higher-Order Logic

This book constitutes the refereed proceedings of the International Conference on Principles and Practice of Declarative Programming, PPDP'99, held in Paris, France, in September/October 1999. The 22 revised full papers presented together with three invited contributions were carefully reviewed and selected from a total of 52 full-length papers submitted. Among the topics covered are type theory; logics and logical methods in understanding, defining, integrating, and extending programming paradigms such as functional, logic, object-oriented, constraint, and concurrent programming; support for modularity; the use of logics in the design of program development tools; and development and implementation methods.

International Conference, PPDP'99, Paris, France, September, 29 - October 1, 1999, Proceedings

Principles and Practice of Declarative Programming

Formal systems that describe computations over syntactic structures occur frequently in computer science. Logic programming provides a natural framework for encoding and animating such systems. However, these systems often embody variable binding, a notion that must be treated carefully at a computational level. This book aims to show that a programming language based on a simply typed version of higher-order logic provides an elegant, declarative means for providing such a treatment. Three broad topics are covered in pursuit of this goal. First, a proof-theoretic framework that supports a general view of logic programming is identified. Second, an actual language called λProlog is developed by applying this view to higher-order logic. Finally, a methodology for programming with specifications is exposed by showing how several computations over formal objects such as logical formulas, functional programs, and λ-terms and π-calculus expressions can be encoded in λProlog.

Gopalan Nadathur

Books

Your next favorite book is out there