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.
Type de document :
Article dans une revue
Information and Computation, Elsevier, 2001, 165 (1), pp.14--41. 〈10.1006/inco.2000.3002〉
Liste complète des métadonnées

https://hal.inria.fr/hal-01431358
Contributeur : Sylvain Soliman <>
Soumis le : mardi 10 janvier 2017 - 17:00:07
Dernière modification le : jeudi 9 février 2017 - 16:02:27
Document(s) archivé(s) le : mardi 11 avril 2017 - 16:31:36

Fichier

FRS01ic.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

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〉

Partager

Métriques

Consultations de la notice

281

Téléchargements de fichiers

36