Logic programming in a fragment of intuitionistic linear logic
Papers presented at the IEEE symposium on Logic in computer science
Logic programming in intuitionistic linear logic: theory, design, and implementation
Logic programming in intuitionistic linear logic: theory, design, and implementation
Efficient implementation of a linear logic programming language
JICSLP'98 Proceedings of the 1998 joint international conference and symposium on Logic programming
Efficient resource management for linear logic proof search
Theoretical Computer Science - Special issue on proof-search in type-theoretic languages
Resource Management in Linear Logic Search Revisited
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
Programming in Lygon: An Overview
AMAST '96 Proceedings of the 5th International Conference on Algebraic Methodology and Software Technology
Efficient Resource Management for Linear Logic Proof Search
ELP '96 Proceedings of the 5th International Workshop on Extensions of Logic Programming
Resource-Distribution via Boolean Constraint (Extended Abstract)
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Component adaptation through flexible subservicing
Science of Computer Programming - Special issue on security issues in coordination models, languages, and systems
A redundancy analysis of sequent proofs
TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
| Hi-index | 0.00 |
In programming languages based on linear logic, the program can grow and shrink in a nearly arbitrary manner over the course of execution. Since the introduction of the I/O model of proof search [11, 12], a number of refinements have been proposed with the intention of reducing its degree of non-determinism [3, 4, 12, 13, 14]. Unfortunately each of these systems has had some limitations. In particular, while the resource management systems of Cervesato et al. [3, 4] and the frame system of L贸pez and Pimentel [14] obtained the greatest degree of determinism, they required global operations on the set of clauses which were suitable only for interpreter-based implementations. In contrast the level-tags system of Hodas, et al. relied only on relabeling tags attached to individual formulas, and was hence appropriate as the specification of an abstract machine. However it retained more non-determinism than the resource management systems. This led to a divergence in the operational semantics of the interpreted and compiled versions of the language Lolli. In this paper we propose a tag-frame system which recaptures the behavior of the resource management systems, while being appropriate as a foundation of a compiled implementation.