Realizing dependently typed logic programming.

Loading...

View/Download File

Snow_Zachary_May2010.pdf (557.89 KB)

Persistent link to this item

https://hdl.handle.net/11299/93385

Statistics

View Statistics

Journal Title

Journal ISSN

Volume Title

Title

Realizing dependently typed logic programming.

Authors

Snow, Zachary

Published Date

2010-05

Publisher

Type

Thesis or Dissertation

Abstract

Dependently typed #21;-calculi such as the Edinburgh Logical Framework (LF) can encode relationships between terms in types and can naturally capture correspondences between formulas and their proofs. Such calculi can also be given a logic programming interpretation: the Twelf system is based on such an interpretation of LF. We consider here whether a conventional logic programming language can also provide the benefits of a Twelf-like system for encoding type and term dependencies through dependent typing, and whether it can do so in an efficient manner. In particular, we present a simple mapping from LF specifications to a set of formulas in the higher-order hereditary Harrop (hohh) language, that relates derivations and proof-search between the two frameworks. We then show that this encoding can be improved by exploiting knowledge of the well-formedness of the original LF specifications to elide much redundant type-checking information. The resulting logic program has a structure that closely follows the original specification, thereby allowing LF specifications to be viewed as meta-programs that generate hohh programs. We prove that this mapping is correct, and, using the Teyjus implementation of #21;Prolog, we show that our translation provides an efficient means for executing LF specifications, complementing the ability the Twelf system provides for reasoning about them. In addition, the translation offers new avenues for reasoning about such specifications, via reasoning over the generated hohh programs.

Keywords

Programming language

Higher-order hereditary Harrop (hohh) language.

Logical Framework (LF)

Meta-programs

Computer Science

Description

University of Minnesota M.S. thesis. May 2010. Major: Computer Science. Advisor: Gopalan Nadathur. 1 computer file(PDF); iv, 74 pages.

Related to

Replaces

License

Collections

Master's Theses (Plan A and Professional Engineering Design Projects)

Series/Report Number

Funding information

Isbn identifier

Doi identifier

Previously Published Citation

Suggested citation

Snow, Zachary. (2010). Realizing dependently typed logic programming.. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/93385.

Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.