A notation for lambda terms. A generalization of environment
Theoretical Computer Science
Implementation Considerations for Higher-Order Features in Logic Programming
Implementation Considerations for Higher-Order Features in Logic Programming
Realizing Modularity in lambdaProlog
Realizing Modularity in lambdaProlog
An Explicit Substitution Notation in a lambda Prolog Implementation
An Explicit Substitution Notation in a lambda Prolog Implementation
Compiler Construction in Higher Order Logic Programming
PADL '02 Proceedings of the 4th International Symposium on Practical Aspects of Declarative Languages
Higher-Order Quantification and Proof Search
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
Higher Order Unification 30 Years Later
TPHOLs '02 Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Tradeoffs in the Intensional Representation of Lambda Terms
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
The Abella Interactive Theorem Prover (System Description)
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Reasoning about computations using two-levels of logic
APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
Practical higher-order pattern unification with on-the-fly raising
ICLP'05 Proceedings of the 21st international conference on Logic Programming
ICLP'05 Proceedings of the 21st international conference on Logic Programming
Optimizing the runtime processing of types in polymorphic logic programming languages
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Overcoming performance barriers: efficient verification techniques for logical frameworks
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
Representing and reasoning with operational semantics
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
A tutorial example of the semantic approach to foundational proof-carrying code
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Aspect-Oriented programming in higher-order and linear logic
PADL'07 Proceedings of the 9th international conference on Practical Aspects of Declarative Languages
Curry-Style explicit substitutions for the linear and affine lambda calculus
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
A proposal for broad spectrum proof certificates
CPP'11 Proceedings of the First international conference on Certified Programs and Proofs
A Two-Level Logic Approach to Reasoning About Computations
Journal of Automated Reasoning
Tutorial Examples of the Semantic Approach to Foundational Proof-Carrying Code
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2005, Selected Papers
An improved proof-theoretic compilation of logic programs
Theory and Practice of Logic Programming
| Hi-index | 0.00 |
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.