Linear Concurrent Constraint Programming: Operational and Phase Semantics - Archive ouverte HAL Access content directly
Journal Articles Information and Computation Year : 2001

Linear Concurrent Constraint Programming: Operational and Phase Semantics

Abstract

In this paper we give a logical semantics for the class CC of concurrent constraint programming languages and for its extension LCC based on linear constraint systems. Besides the characterization in intuitionistic logic of the stores of CC computations, we show that both the stores and the successes of LCC computations can be characterized in intuitionistic linear logic. We illustrate the usefulness of these results by showing with examples how the phase semantics of linear logic can be used to give simple \semantical" proofs of safety properties of LCC programs.
Fichier principal
Vignette du fichier
FRS01ic.pdf (363.56 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01431358 , version 1 (10-01-2017)

Identifiers

Cite

François Fages, Paul Ruet, Sylvain Soliman. Linear Concurrent Constraint Programming: Operational and Phase Semantics. Information and Computation, 2001, 165 (1), pp.14--41. ⟨10.1006/inco.2000.3002⟩. ⟨hal-01431358⟩

Collections

INRIA INRIA2
213 View
105 Download

Altmetric

Share

Gmail Facebook X LinkedIn More