ICLP 2005 doctoral consortium

Authors:
Rémy Haemmerlé
Affiliations:
Project Contraintes, INRIA Rocquencourt, France
Venue:
ICLP'05 Proceedings of the 21st international conference on Logic Programming
Year:
2005

Citing 4
Cited 0

Linear logic

Theoretical Computer Science
A calculus for the construction of modular Prolog programs

Journal of Logic Programming
Concurrent constraint programming

Concurrent constraint programming
Linear concurrent constraint programming: operational and phase semantics

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Concurrent Constraint (CC) [8] languages allow to model a large number of constraint programming systems, form Prolog coroutinings to constraints propagation mechanisms such these implemented in the Finite Domain (FD) solver of GNU-Prolog [2]. These languages are an extension of CLP obtained by an addition of a synchronization primitive based on constraint implication. The Linear Concurrent Constraint (LCC) [9] languages are generalizations of CC languages that consists of considerating constraint systems on Girard's linear logic [5] instead of the classical logic. This new kind of languages offer an unified framework combining constraints with state change and allow us to express the semantics of constraint programming together with concurrency and imperative features such as multiple assignment variables. It is, then, possible to defined solvers as pure libraries written in the same languages as the system.