Abstract

presented at Mathematical Foundations of Computer Science 1992, LNCS 629, pp. 336--345, 1992. 1 operation takes a constraint c and adds (conjoins) it to the store (when the store is consistent with c). As a consequence, variables can be linked once and for all to their value, that is cc-languages are not affected by the previous criticism against process algebras. However, if cc-languages have higher order power or how much of control is described by them (i.e., a comparison with the descriptive power of process algebras) are still open questions. Some phenomena, indeed, suggest a deep relationship between -calculus and cc-languages: as an example, mobility of channels is reflected in mobility of variables (giving rise to situations of extrusion and intrusion of the scope). In this paper we will prove that cc-languages yield higher order power even with a very poor underlying system of constraints (the signature through which constraints are defined has a constant and a concatenatio...

Citations