Linear Concurrent Constraint Programming: Operational and Phase Semantics

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 successe...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Information and computation Ročník 165; číslo 1; s. 14 - 41
Hlavní autoři: Fages, François, Ruet, Paul, Soliman, Sylvain
Médium: Journal Article
Jazyk:angličtina
Vydáno: San Diego, CA Elsevier Inc 25.02.2001
Elsevier
Témata:
Applied sciences
Calculus of variations and optimal control
Computer Science
Computer science; control theory; systems
Exact sciences and technology
Language theory and syntactical analysis
Mathematical analysis
Mathematical programming
Mathematics
Operational research and scientific management
Operational research. Management science
Programming Languages
Sciences and techniques of general use
Theoretical computing
Logical semantics
Intuitionistic logic
Operational semantics
Linear programming
Logical programming
Mutual exclusion
Constrained optimization
Relation
Constrainte system
transition relation
Concurrency
Semantics
Transition
Mathematical programming
ISSN:0890-5401, 1090-2651
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
ISSN:0890-5401
1090-2651
DOI:10.1006/inco.2000.3002