Confluent calculus for concurrent constraint programming with guarded choice

Kim Marriott, Martin Odersky

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

3 Citations (Scopus)


Confluence is an important and desirable property as it allows the program to be understood by considering any desired scheduling rule, rather than having to consider all possible scheduling. Unfortunately, the usual operational semantics for concurrent constraint programs is not confluent as different process scheduling give rise to different sets of possible outcomes. We show that it is possible to give a natural confluent calculus for concurrent constraint programs, if the syntactic domain is extended by a blind choice operator and a special constant standing for a discarded branch. This has application to program analysis.

Original languageEnglish
Title of host publicationPrinciples and Practice of Constraint Programming — CP 1995 - 1st International Conference, CP 1995, Proceedings
EditorsUgo Montanari, Francesca Rossi
Number of pages18
ISBN (Print)3540602992, 9783540602996
Publication statusPublished - 1 Jan 1995
EventInternational Conference on Principles and Practice of Constraint Programming 1995 - Cassis, France
Duration: 19 Sep 199522 Sep 1995
Conference number: 1st

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


ConferenceInternational Conference on Principles and Practice of Constraint Programming 1995
Abbreviated titleCP 1995

Cite this