Concurrent Constraint Programming and Non-commutative Logic

Abstract This paper presents a connection between the intuitionistic fragment of a non-commutative version of linear logic introduced by the first author (NLI) and concurrent constraint programming (CC). We refine existing logical characterizations of operational aspects of CC, by providing a logical interpretation of finer observable properties of CC programs, namely stores, successes and suspensions.

Authors

• Paul Ruet
• François Fages

Keywords

No keywords are indexed for this paper.