Theoretical Computer Science
Logic programming in a fragment of intuitionistic linear logic
Papers presented at the IEEE symposium on Logic in computer science
ACL—a concurrent linear logic programming paradigm
ILPS '93 Proceedings of the 1993 international symposium on Logic programming
Logic programming in intuitionistic linear logic: theory, design, and implementation
Logic programming in intuitionistic linear logic: theory, design, and implementation
Forum: a multiple-conclusion specification logic
ALP Proceedings of the fourth international conference on Algebraic and logic programming
Efficient implementation of a linear logic programming language
JICSLP'98 Proceedings of the 1998 joint international conference and symposium on Logic programming
Timed Petri Nets and Temporal Linear Logic
ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
Efficient Resource Management for Linear Logic Proof Search
ELP '96 Proceedings of the 5th International Workshop on Extensions of Logic Programming
Temporal Linear Logic Specifications for Concurrent Processes
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Coordination: Reo, Nets, and Logic
Formal Methods for Components and Objects
| Hi-index | 0.00 |
Recent development of logic programming languages based on linear logic suggests a successful direction to extend logic programming to be more expressive and more efficient. The treatment of formulasas-resources gives us not only powerful expressiveness, but also efficient access to a large set of data. However, in linear logic, whole resources are kept in one context, and there is no straight way to represent complex data structures as resources. For example, in order to represent an ordered list and time-dependent data, we need to put additional indices for each resource formula. This paper describes a logic programming language, called TLLP, based on intuitionistic temporal linear logic. This logic, an extension of linear logic with some features from temporal logics, allows the use of the modal operators '驴'(next-time) and '驴'(always) in addition to the operators used in intuitionistic linear logic. The intuitive meaning of modal operators is as follows: 驴 B means that B can be used exactly once at the next moment in time; 驴 B means that B can be used exactly once any time; !B means that B can be used arbitrarily many times (including 0 times) at any time. We first give a proof theoretic formulation of the logic of the TLLP language. We then present a series of resource management systems designed to implement not only interpreters but also compilers based on an extension of the standard WAM model.