Mikkel Nygaard  Home/Search
Context
Related
| daimi.au.dk/~nygaard/pub/disi.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: daimi.au.dk/~nygaard/notes (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Introduction Process calculi like CCS have been motivated and studied operationally, thus from the outset lacking the abstract mathematical treatment provided by a domain theory. Consequently, concurrency has become a rather separate study; in particular, higher-order and functional features as known from sequential programming are most often treated in an ad hoc fashion, if at all. The study of presheaf models of processes [3, 14] can be seen as an attempt to bring concurrency back within... (Update)
Similar documents (at the sentence level):
6.9%: Linearity in Process Languages - Nygaard, Winskel (2002) (Correct)
Active bibliography (related documents): More All
0.9: Presheaf semantics for HOPLA - Nygaard (2002) (Correct)
0.9: Domain Theory for Concurrency - Nygaard (2003) (Correct)
0.5: Towards an Operational Understanding of Presheaf Models - Nygaard (2001) (Correct)
Similar documents based on text: More All
0.3: HOPLA - A Higher-Order Process Language - Nygaard, Winskel (2002) (Correct)
0.2: Presheaf Models for Concurrency - Cattani, Winskel (1997) (Correct)
0.2: Presheaf Models for CCS-like Languages - Cattani, Winskel (1999) (Correct)
BibTeX entry: (Update)
@misc{ nygaard-presheaf,
author = "Mikkel Nygaard",
title = "Presheaf Models and Process Calculi",
url = "citeseer.ist.psu.edu/article/nygaard02presheaf.html" }
Citations (may not include all citations):2732 Communicating sequential processes (context) - Hoare - 1978
1933 Communication and Concurrency (context) - Milner - 1989
502 Concurrency and automata on infinite sequences (context) - Park - 1981
484 A Calculus of Communicating Systems (context) - Milner - 1980
302 The semantics of a simple language for parallel programming (context) - Kahn - 1974
233 Computational interpretation of linear logic - Abramsky - 1990
156 Basic concepts of enriched category theory (context) - Kelly - 1982
144 Models for concurrency - Winskel, Nielsen - 1995
125 Event structures (context) - Winskel - 1987
83 Sheaves in Geometry and Logic (context) - Lane, Moerdijk - 1992
75 Proving congruence of bisimulation in functional programming.. - Howe - 1996
69 Information and Computation (context) - Joyal, Nielsen et al. - 1996
58 Presheaf Models for Concurrency - Cattani - 1999
41 Annals of Pure and Applied Logic (context) - Jacobs, weakening - 1994
35 Basic Set Theory (context) - Levy - 1979
33 A completeness theorem for open maps (context) - Joyal, Moerdijk - 1994
27 A presheaf semantics of value-passing processes - Winskel
22 Weak bisimulation and open maps - Fiore, Cattani et al.
21 A theory of recursive domains with applications to concurren.. - Cattani, Fiore et al.
17 Presheaf models for the -calculus - Cattani, Stark et al.
14 A categorical axiomatics for bisimulation - Cattani, Power et al. - 1998
12 An Axiomatic Approach to Adequacy (context) - Brauner - 1996
8 Categorical Models for Concurrency: Independence (context) - Hildebrandt - 2000
6 Towards an Operational Understanding of Presheaf Models - Nygaard - 2001
5 Relational semantics of non-deterministic dataflow - Hildebrandt, Panangaden et al.
5 A fully abstract presheaf semantics for SCCS with finite del.. - Hildebrandt
2 A higher-order process language (context) - Nygaard, Winskel
Documents on the same site (http://www.daimi.au.dk/~nygaard/notes.html):
Presheaf semantics for HOPLA - Nygaard (2002) (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