System description: Teyjus—a compiler and abstract machine based implementation of λprolog

Gopalan Nadathur, Dustin J. Mitchell

Research output: Chapter in Book/Report/Conference proceedingConference contribution

55 Scopus citations

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 ex­ploitation of features in the richer logic endows λProlog with capabili­ties 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 imple­mentation 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.

Original languageEnglish (US)
Title of host publicationAutomated Deduction — CADE-16 - 16th International Conference on Automated Deduction, Proceedings
EditorsHarald Ganzinger
PublisherSpringer Verlag
Pages287-291
Number of pages5
ISBN (Print)3540662227, 9783540662228
DOIs
StatePublished - 1999
Event16th International Conference on Automated Deduction, CADE 1999 - Trento, Italy
Duration: Jul 7 1999Jul 10 1999

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1632
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other16th International Conference on Automated Deduction, CADE 1999
Country/TerritoryItaly
CityTrento
Period7/7/997/10/99

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1999.

Fingerprint

Dive into the research topics of 'System description: Teyjus—a compiler and abstract machine based implementation of λprolog'. Together they form a unique fingerprint.

Cite this