Integrating objects with constraint-programming languages

1994 ◽  
pp. 248-265 ◽  
Author(s):  
Massimo Paltrinieri
Keyword(s):  
Programming Languages ◽  
Constraint Programming

scholarly journals On the Expressive Power of Concurrent Constraint Programming Languages

2002 ◽  
Vol 9 (22) ◽  
Author(s):  
Mogens Nielsen ◽  
Catuscia Palamidessi ◽  
Frank D. Valencia
Keyword(s):  
Programming Languages ◽  
Constraint Programming ◽  
Expressive Power ◽  
Finite Domain ◽  
Process Variables ◽  
Recursive Procedures ◽  
Undecidability Result ◽  
Concurrent Constraint Programming

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:<dl compact="compact"><dt>(1)</dt><dd>recursive procedures with parameters can be encoded into parameterless recursive procedures with dynamic scoping, and vice-versa.</dd><dt>(2)</dt><dd>replication can be encoded into parameterless recursive procedures with static scoping, and vice-versa.</dd><dt>(3)</dt><dd>the languages from (1) are strictly more expressive than the languages from (2).</dd></dl>Furthermore, we show that behavioural equivalence is undecidable for the languages from (1), but decidable for the languages from (2). The undecidability result holds even if the process variables take values from a fixed finite domain.

Sign in / Sign up

Export Citation Format

Share Document