The Replacement Operation for CCP Programs.
Marco Bertolino, Sandro Etalle, Catuscia Palamidessi · University of Twente Research Information · 1999
. The replacement is a very powerful transformation operation which { both within the functional paradigm as well as within the logic programming one { can mimic the most common transformation operations such as unfold, fold, switching, distribution. Because of this exibility, it can be incorrect if used without specic applicability conditions. In this paper we present applicability conditions which ensure the correctness of the replacement operation in the context of Concurrent Constraint Programs. Furthermore we show that, under these conditions, the replacement generalizes both the unfolding operation as well as a restricted form of folding operation. 1 Introduction Concurrent constraint programming ([26]) (ccp, for short) is a concurrent programming paradigm which derives from replacing the store-as-valuation concept of von Neumann computing by the store-as-constraint model. The computational model of ccp is based on a global store, represented by a constraint, which expresses ...