Closures and Modules Within Linear Logic Concurrent Constraint Programming - Archive ouverte HAL Access content directly
Conference Papers Year : 2007

Closures and Modules Within Linear Logic Concurrent Constraint Programming


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.
No file

Dates and versions

hal-01779531 , version 1 (26-04-2018)


  • HAL Id : hal-01779531 , version 1


Rémy Haemmerlé, François Fages, Sylvain Soliman. Closures and Modules Within Linear Logic Concurrent Constraint Programming. FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007, Berlin, Heidelberg, Unknown Region. pp.544--556. ⟨hal-01779531⟩


39 View
0 Download


Gmail Facebook X LinkedIn More