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.
Document type :
Journal articles
Complete list of metadatas

https://hal.inria.fr/hal-01431358
Contributor : Sylvain Soliman <>
Submitted on : Tuesday, January 10, 2017 - 5:00:07 PM
Last modification on : Monday, September 24, 2018 - 2:00:04 PM
Long-term archiving on : Tuesday, April 11, 2017 - 4:31:36 PM

File

FRS01ic.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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

Share

Metrics

Record views

470

Files downloads

170