@inproceedings{e5fc57f9665f480fa955409dedb7335c,
title = "The metalanguage λprolog and its implementation",
abstract = "Stimulated by concerns of software certification especially as it relates to mobile code, formal structures such as specifications and proofs are beginning to play an explicit role in computing. In representing and manipulating such structures, an approach is needed that pays attention to the binding operation that is present in them. The language λProlog provides programming support for a higher-order treatment of abstract syntax that is especially suited to this task. This support is realized by enhancing the traditional strength of logic programming in the metalanguage realm with an ability for dealing directly with binding structure. This paper identifies the features of λProlog that endow it with such a capability, illustrates their use and and describes methods for their implementation. Also discussed is a new realization of λProlog called Teyjus that incorporates the implementation ideas presented.",
author = "Gopalan Nadathur",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2001. Copyright: Copyright 2016 Elsevier B.V., All rights reserved.; 5th International Symposium on Functional and Logic Programming, FLOPS 2001 ; Conference date: 07-03-2001 Through 09-03-2001",
year = "2001",
doi = "10.1007/3-540-44716-4_1",
language = "English (US)",
isbn = "3540417397",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "1--20",
editor = "Herbert Kuchen and Kazunori Ueda",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
}