PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
An algorithm for optimal lambda calculus reduction
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Logic programming in the LF logical framework
Logical frameworks
Unification under a mixed prefix
Journal of Symbolic Computation
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A notation for lambda terms. A generalization of environment
Theoretical Computer Science
Higher order unification via explicit substitutions
Information and Computation
Lightweight Lemmas in &lgr;Prolog
Proceedings of the 1999 international conference on Logic programming
Let-Polymorphism and Eager Type Schemes
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
A Proposal for Modules in Lambda-Prolog
ELP '93 Proceedings of the 4th International Workshop on Extensions of Logic Programming
Proof Search in the Intuitionistic Sequent Calculus
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Implementation Considerations for Higher-Order Features in Logic Programming
Implementation Considerations for Higher-Order Features in Logic Programming
An Explicit Substitution Notation in a lambda Prolog Implementation
An Explicit Substitution Notation in a lambda Prolog Implementation
Proof-theoretic and higher-order extensions of logic programming
A 25-year perspective on logic programming
| Hi-index | 0.00 |
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.