Programming with Higher-Order Logic
Programming with Higher-Order Logic | 3.26 MB
Title: Programming with Higher-Order Logic
Author: Dale Miller, Gopalan Nadathur
Category: Nonfiction, Computers, Advanced Computing, Computer Science, Programming, Programming Languages, General Computing
Language: English | 322 Pages | ISBN: 052187940X
Description:
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.
DOWNLOAD:
https://rapidgator.net/file/278d583dc8b2e7847612fa9bd29852d7/Programming_with_Higher-Order_Logic.pdf
https://nitroflare.com/view/6496C19E82E5563/Programming_with_Higher-Order_Logic.pdf
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.
DOWNLOAD:
https://rapidgator.net/file/278d583dc8b2e7847612fa9bd29852d7/Programming_with_Higher-Order_Logic.pdf
https://nitroflare.com/view/6496C19E82E5563/Programming_with_Higher-Order_Logic.pdf
Information
Users of Guests are not allowed to comment this publication.
