Treffer: Truly concurrent constraint programming
Title:
Truly concurrent constraint programming
Authors:
Source:
Mathematical Foundations of Programming SemanticsTheoretical computer science. 278(1-2):223-255
Publisher Information:
Amsterdam: Elsevier, 2002.
Publication Year:
2002
Physical Description:
print, 27 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences et techniques communes, Sciences and techniques of general use, Mathematiques, Mathematics, Logique mathématique, fondements, théorie des ensembles, Mathematical logic, foundations, set theory, Logique et fondements, Logic and foundations, Logique générale, General logic, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Théorie des langages et analyse syntaxique, Language theory and syntactical analysis, Causalité, Causality, Causalidad, Contrainte, Constraint, Coacción, Programmation logique avec contrainte, Constraint logic programming, Programación lógica con restricción, Programme concurrent, Concurrent program, Programa competidor, Simultanéité informatique, Concurrency, Simultaneidad informatica, Sémantique dénotationnelle, Denotational semantics, Semántica denotacional
Document Type:
Konferenz
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Stratify Inc., 501 Ellis Street, Mountain View, CA 94043, United States
Department of Computer Science, Loyola University Chicago, 6525 N. Sheridan Road, Chicago, IL 60626, United States
Department of Computer Science, Loyola University Chicago, 6525 N. Sheridan Road, Chicago, IL 60626, United States
ISSN:
0304-3975
Rights:
Copyright 2002 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Mathematics
Mathematics
Accession Number:
edscal.13661426
Database:
PASCAL Archive
Weitere Informationen
We study causality relationships in Concurrent Constraint Programming: what is observed is not just the conjunction of constraints deposited in the store, but also the causal dependencies between these constraints. We describe a denotational semantics for cc that is fully abstract with respect to observing this causality relation on constraints. This semantics preserves more fine-grained structure of computation; in particular the Interleaving Law (a → P) ∥ (b → Q) = (a → (P | (b → Q)))(b → (Q ∥ (a → P))) is not verified (? is indeterminate choice). Relationships between such a denotational approach to true concurrency and different powerdomain constructions are explored.