(Enter summary)
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 ... (Update)
Context of citations to this paper: More
...equivalence must take into account process store pairs and not just processes. A notion of (weak) bisimulation for CCP was introduced in [MPSS95] The idea is to consider not only moves of the processes, but also moves of the environment. These moves are interpreted as...
...and RREC are the same in ccp, hence the observations made in this section regarding dynamic scoping apply to ccp as well. As in [7], we use the notion of fresh variable meaning that it does not occur elsewhere in a process, definition or the store. It will be convenient to...
Cited by: More
Denotational Semantics for Asynchronous Concurrent Languages - Nyström (1996)
(Correct)
Notes on Timed CCP - Nielsen, Valencia
(Correct)
On the Expressive Power of Concurrent Constraint Programming.. - Nielsen, al. (2002)
(Correct)
Active bibliography (related documents): More All
0.5: Deliverables: A Categorical Approach to Program Development in.. - McKinna (1992)
(Correct)
0.5: A Robust Affine Matching Algorithm Using an Exponentially.. - Pinz, Prantl, Ganster (1995)
(Correct)
0.2: From Concurrent Logic Programming to Concurrent Constraint .. - de Boer, Palamidessi (1993)
(Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.5: Temporal Concurrent Constraint Programming - Valencia (2001)
(Correct)
0.3: Temporal Concurrent Constraint Programming: Applications and .. - Nielsen, Valencia (2001)
(Correct)
0.3: Discrete Quantum Causal Dynamics - Blute, Ivanov, Panangaden (2003)
(Correct)
Related documents from co-citation: More All
7: Semantic foundation of concurrent constraint programming
- Saraswat, Rinard et al. - 1991
5: Concurrent Constraint Programming (context) - Saraswat - 1990
5: A Timed Concurrent Constraint Language (context) - de Boer, Gabbrielli et al.
BibTeX entry: (Update)
N. Mendler, P. Panangaden, P.J. Scott, and R.A.G. Seely. A logical view of concurrent constraint programming. Nordic J. of Computing, 2, 1995. http://citeseer.ist.psu.edu/mendler95logical.html More
@article{ mendler95logical,
author = "Nax P. Mendler and Prakash Panangaden and P. J. Scott and R. A. G. Seely",
title = "A logical view of concurrent constraint programming",
journal = "Nordic Journal of Computing",
volume = "2",
number = "2",
month = "Summer",
pages = "181--220",
year = "1995",
url = "citeseer.ist.psu.edu/mendler95logical.html" }
Citations (may not include all citations):
1933
Communication and Concurrency (context) - Milner - 1989
562
Categories for the Working Mathematician (context) - Lane - 1971
359
Introduction to Higher Order Categorical Logic (context) - Lambek, Scott - 1986
344
Concurrent Constraint Programming (context) - Saraswat - 1993
268
Proofs and Types (context) - Girard - 1989
242
Linear Logic (context) - Girard - 1987
216
Semantic foundations of concurrent constraint programming
- Saraswat, Jagadeesan et al. - 1991
216
Semantic Foundations of Concurrent Constraint Programming
- Vijay, Martin et al. - 1991
214
Domains for denotational semantics (context) - Scott - 1982
194
Functions as Processes (context) - Milner - 1992
144
Models for Concurrency
- Nielsen, Winskel - 1994
83
Cylindric Algebras (context) - Leon, Donald et al. - 1971
81
A Multiple-Conclusion Meta-Logic
- Miller - 1994
50
New foundations for the geometry of interaction
- Abramsky, Jagadeesan - 1993
46
A Course in Mathematical Logic (context) - Bell, Machover - 1977
34
Equality in hyperdoctrines and the comprehension schema as a.. (context) - Lawvere - 1970
32
Full Abstraction for a Shared Variable Parallel Language
- Brookes - 1993
23
Bisimulation and Open Maps
- Joyal, Nielsen et al. - 1993
17
Proofs as Processes (context) - Abramsky - 1994
17
The Expressive Power of Indeterminate Dataflow Primitives
- Panangaden, Shanbhogue - 1992
6
A Hyperdoctrinal View of Concurrent Constraint Programming
- Panangaden, Saraswat et al. - 1993
5
Fully Abstract Denotational Models for Nonuniform Concurrent.. (context) - Horita, de Bakker et al. - 1994
5
Higher-order (context) - Saraswat, Lincoln - 1992
2
natural deduction and the Beck conditions (context) - Seely - 1983
1
Concurrent Constraint Programming (context) - VIEW, CCP et al. - 1990
1
Polymorphic linear logic and topos models (context) - math, Grundlagen et al. - 1990
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.brics.dk/~prakash/pubs.html): More
Nonexpressibility of Fairness and Signaling - McAllester, Panangaden.. (1990)
(Correct)
The Expressive Power of Indeterminate Dataflow Primitives - Panangaden, Shanbhogue (1995)
(Correct)
A Logical Characterization of Bisimulation for Labeled.. - Desharnais, Edalat, al. (1998)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC