Theoretical Computer Science
A Prolog technology theorem prover: implementation by an extended Prolog computer
Journal of Automated Reasoning
Concurrent constraint programming
Concurrent constraint programming
Logic programming in a fragment of intuitionistic linear logic
Papers presented at the IEEE symposium on Logic in computer science
Linear concurrent constraint programming: operational and phase semantics
Information and Computation
Programming in Lygon: An Overview
AMAST '96 Proceedings of the 5th International Conference on Algebraic Methodology and Software Technology
Journal of Functional Programming
Logic programming in the context of multiparadigm programming: the Oz experience
Theory and Practice of Logic Programming
On the Expressiveness of Linearity vs Persistence in the Asychronous Pi-Calculus
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Hi-index | 0.00 |
There are two somewhat contradictory ways of looking at modules in a given programming language. On the one hand, module systems are largely independent of the particulars of programming languages. On the other hand, the module constructs may interfere with the programming constructs, and may be redundant with the other scope mechanisms of a specific programming language, such as closures for instance. There is therefore a need to unify the programming concepts that are similar, and retain a minimum number of essential constructs to avoid arbitrary programming choices. In this paper, we realize this aim in the framework of linear logic concurrent constraint programming (LCC) languages. We first show how declarations and closures can be internalized as agents in a variant of LCC for which we provide precise operational and logical semantics in linear logic. Then, we show how a complete module system can be represented within LCC, and prove for it a general code protection property. Finally we study the instanciation of this scheme to the implementation of a safe module system for constraint logic programs, and conclude on the generality of this approach to programming languages with logical variables.