System Description: Teyjus—A Compiler and Abstract Machine Based Implementation of λProlog

  • Gopalan Nadathur
  • Dustin J. Mitchell
Conference paper

DOI: 10.1007/3-540-48660-7_25

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1632)
Cite this paper as:
Nadathur G., Mitchell D.J. (1999) System Description: Teyjus—A Compiler and Abstract Machine Based Implementation of λProlog. In: Automated Deduction — CADE-16. CADE 1999. Lecture Notes in Computer Science, vol 1632. Springer, Berlin, Heidelberg

Abstract

The logic programming language λProlog is based on the intuitionistic theory of higher-order hereditary Harrop formulas, a logic that significantly extends the theory of Horn clauses. A systematic exploitation of features in the richer logic endows λProlog with capabilities at the programming level that are not present in traditional logic programming languages. Several studies have established the value of λProlog as a language for implementing systems that manipulate formal objects such as formulas, programs, proofs and types. Towards harnessing these benefits, methods have been developed for realizing this language efficiently. This work has culminated in the description of an abstract machine and compiler based implementation scheme. An actual implementation of λProlog based on these ideas has recently been completed. The planned presentation will exhibit this system—called Teyjus—and will also illuminate the metalanguage capabilities of λProlog.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Gopalan Nadathur
    • 1
  • Dustin J. Mitchell
    • 1
  1. 1.Department of Computer ScienceUniversity of Chicago Ryerson HallChicago

Personalised recommendations