Observational equivalences for linear logic CC languages
Abstract
Linear logic Concurrent Constraint programming (LCC) is an extension of concurrent constraint programming (CC) 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 \pi-calculus can be viewed as simple syntactical restrictions of LCC. Finally we show LCC observational equivalences can be transposed straightforwardly to classical Concurrent Constraint languages and Constraint Handling Rules, and investigate the resulting equivalences.
Cite
@article{arxiv.1108.0329,
title = {Observational equivalences for linear logic CC languages},
author = {Rémy Haemmerlé},
journal= {arXiv preprint arXiv:1108.0329},
year = {2011}
}
Comments
17 pages