## Abstract

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 n-calculus expressions can be encoded in λProlog.

Original language | English (US) |
---|---|

Publisher | Cambridge University Press |

Number of pages | 306 |

Volume | 9780521879408 |

ISBN (Electronic) | 9781139021326 |

ISBN (Print) | 9780521879408 |

DOIs | |

State | Published - Jan 1 2012 |

### Bibliographical note

Publisher Copyright:© Dale Miller and Gopalan Nadathur 2012.