id: 05939278
dt: j
an: 05939278
au: Haemmerlé, Rémy
ti: Observational equivalences for linear logic concurrent constraint
    languages.
so: Theory Pract. Log. Program. 11, No. 4-5, 469-485 (2011).
py: 2011
pu: Cambridge University Press, Cambridge
la: EN
cc: 
ut: concurrent constraint programming; linear logic; observational
    equivalences; bisimulation; $π$-calculus; constraint handling rules
ci: 
li: doi:10.1017/S1471068411000123
ab: Summary: Linear logic concurrent constraint programming (LCC) is an
    extension of concurrent constraint programming, where the constraint
    system is based on Girard’s linear logic instead of the classical
    logic. In this paper, we address the problem of program equivalence for
    this programming framework. For this purpose, we present a structural
    operational semantics for LCC based on a label transition system and
    investigate different notions of observational equivalences inspired by
    the state of art of process algebras. Then, we demonstrate that the
    asynchronous $π$-calculus can be viewed as simple syntactical
    restrictions of LCC. Finally, we show that LCC observational
    equivalences can be transposed straightforwardly to classical
    concurrent constraint languages and constraint handling rules, and
    investigate the resulting equivalences.
rv: