Observational equivalences for linear logic concurrent constraint languages

DOI10.1017/S1471068411000123MaRDI QIDQ3087436zbMATH OpenOpenAlexFDO

Authors Rémy Haemmerlé

Publication date 16 August 2011

Published in Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1108.0329

zbMATH Keywords

\(\pi \)-calculusbisimulationconcurrent constraint programmingconstraint handling ruleslinear logicobservational equivalences

Mathematics Subject Classification ID

Logic programming (68N17)

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.

Recommendations

• Linear concurrent constraint programming: Operational and phase semantics
• scientific article; zbMATH DE number 1223634
• scientific article; zbMATH DE number 1113818
• Subexponential concurrent constraint programming
• On concurrent behaviors and focusing in linear logic

Cites work

• Observable Confluence for Constraint Handling Rules

Cited in

(12)

• Linear concurrent constraint programming: Operational and phase semantics
• Session-based concurrency, declaratively
• Models and emerging trends of concurrent constraint programming
• On concurrent behaviors and focusing in linear logic
• Observational and behavioural equivalences for soft concurrent constraint programming
• Dynamic spaces in concurrent constraint programming
• Design and implementation of a concurrent logic programming language with linear logic constraints
• A concurrent constraint programming interpretation of access permissions
• Linear logical relations and observational equivalences for session-based concurrency
• Proving concurrent constraint programming correct, revisited
• Closures and Modules Within Linear Logic Concurrent Constraint Programming
• Subexponential concurrent constraint programming

This page was built for publication: Observational equivalences for linear logic concurrent constraint languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3087436)