Theoretical Computer Science
Logic programming in a fragment of intuitionistic linear logic
Papers presented at the IEEE symposium on Logic in computer science
The functional approach to programming
The functional approach to programming
Efficient resource management for linear logic proof search
Theoretical Computer Science - Special issue on proof-search in type-theoretic languages
Logic for Problem Solving
Programming in PROLOG
Programming in Lygon: An Overview
AMAST '96 Proceedings of the 5th International Conference on Algebraic Methodology and Software Technology
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Resource-distribution via Boolean constraints
ACM Transactions on Computational Logic (TOCL)
Proof-Search and Countermodel Generation in Propositional BI Logic
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Possible worlds and resources: the semantics of BI
Theoretical Computer Science - Mathematical foundations of programming semantics
Logical approximation for program analysis
Higher-Order and Symbolic Computation
| Hi-index | 0.00 |
We give an operational semantics for the logic programming language BLP, based on the hereditary Harrop fragment of the logic of bunched implications, BI. We introduce BI, explaining the account of the sharing of resources built into its semantics, and indicate how it may be used to give a logic programming language. We explain that the basic input/output model of operational semantics, used in linear logic programming, will not work for bunched logic. We show how to obtain a complete, goal-directed proof theory for hereditary Harrop BI and how to reformulate the operational model to account for the interaction between multiplicative and additive structure. We give a prototypical example of how the resulting programming language handles, in contrast with Prolog, sharing and non-sharing use of resources purely logically.