On the Expressive Power of Concurrent Constraint Programming Languages
AbstractThe tcc paradigm is a formalism for timed concurrent constraint programming. Several tcc languages differing in their way of expressing infinite behaviour have been proposed in the literature. In this paper we study the expressive power of some of these languages. In particular, we show that:
- recursive procedures with parameters can be encoded into parameterless recursive procedures with dynamic scoping, and vice-versa.
- replication can be encoded into parameterless recursive procedures with static scoping, and vice-versa.
- the languages from (1) are strictly more expressive than the languages from (2).
How to Cite
Nielsen, M., Palamidessi, C., & Valencia, F. D. (2002). On the Expressive Power of Concurrent Constraint Programming Languages. BRICS Report Series, 9(22). https://doi.org/10.7146/brics.v9i22.21738
Articles published in DAIMI PB are licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.