Automated Deduction — CADE-16

Volume 1632 of the series Lecture Notes in Computer Science pp 287-291


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

  • Gopalan NadathurAffiliated withDepartment of Computer Science, University of Chicago Ryerson Hall
  • , Dustin J. MitchellAffiliated withDepartment of Computer Science, University of Chicago Ryerson Hall

* Final gross prices may vary according to local VAT.

Get Access


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.