On the Expressive Power of Concurrent Constraint Programming Languages
DOI:
https://doi.org/10.7146/brics.v9i22.21738Resumé
The 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:- (1)
- recursive procedures with parameters can be encoded into parameterless recursive procedures with dynamic scoping, and vice-versa.
- (2)
- replication can be encoded into parameterless recursive procedures with static scoping, and vice-versa.
- (3)
- the languages from (1) are strictly more expressive than the languages from (2).
Downloads
Publiceret
2002-05-05
Citation/Eksport
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
Nummer
Sektion
Artikler
Licens
Authors who publish with this journal agree to the following terms:- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).