A logical view of concurrent constraint programming

Authors:
Nax P. Mendler;Prakash Panangaden;P. J. Scott;R. A. G. Seely
Affiliations:
Department of Mathematics, University of Ottawa, Ottawa, Ontario, Canada;School of Computer Science, McGill University, Montreal, Quebec, Canada;Department of Mathematics, University of Ottawa, Ottawa, Ontario, Canada;Department of Mathematics, McGill University, Montreal, Quebec, Canada
Venue:
Nordic Journal of Computing
Year:
1995

Citing 14
Cited 6

Introduction to higher order categorical logic

Introduction to higher order categorical logic
Linear logic

Theoretical Computer Science
Communication and concurrency

Communication and concurrency
Proofs and types

Proofs and types
Concurrent constraint programming

POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The semantic foundations of concurrent constraint programming

POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A fully abstract model for concurrent constraint programming

TAPSOFT '91 Proceedings of the international joint conference on theory and practice of software development on Colloquium on trees in algebra and programming (CAAP '91): vol 1
Concurrent constraint programming

Concurrent constraint programming
The expressive power of indeterminate dataflow primitives

Information and Computation
New foundations for the geometry of interaction

Information and Computation
Fully abstract denotational models for nonuniform concurrent languages

Information and Computation
Proofs as processes

MFPS '92 Selected papers of the conference on Meeting on the mathematical foundations of programming semantics, part I : linear logic: linear logic
Domains for Denotational Semantics

Proceedings of the 9th Colloquium on Automata, Languages and Programming
A Hyperdoctrinal View of Concurrent Constraint Programming

Proceedings of the REX Workshop on Sematics: Foundations and Applications

On the expressive power of temporal concurrent constraint programming languages

Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming
A framework for abstract interpretation of timed concurrent constraint programs

PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
Deriving labels and bisimilarity for concurrent constraint programming

FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Spatial and epistemic modalities in constraint-based process calculi

CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Efficient computation of program equivalence for confluent concurrent constraint programming

Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
Models and emerging trends of concurrent constraint programming

Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract

Concurrent Constraint Programming (CCP) has been the subject of growing interest as the focus of a new paradigm for concurrent computation. Like logic programming it claims close relations to logic. In fact CCP languages are logics in a certain sense that we make precise in this paper. In recent work it was shown that the denotational semantics of determinate concurrent constraint programming languages forms a fibred categorical structure called a hyperdoctrine, which is used as the basis of the categorical formulation of first-order logic. What this shows is that the combinators of determinate CCP can be viewed as logical connectives. In this paper we extend these ideas to the operational semantics of such languages and thus make available similar analogies for a much broader variety of languages including indeterminate CCP languages and concurrent block-structured imperative languages.