an:01178643
Zbl 0902.68034
Marriott, Kim; Odersky, Martin
A confluent calculus for concurrent constraint programming
EN
Theor. Comput. Sci. 173, No. 1, 209-233 (1997).
0304-3975
1997
j
68N99
confluence; concurrent constraint programs
Summary: 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 schedulings. Unfortunately, the usual operational semantics for concurrent constraint programs is not confluent as different process schedulings 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.