| Alternate document: Details Presheaf Models and Process Calculi (02) Mikkel Nygaard |
Mikkel Nygaard  Home/Search
Context
Related
| daimi.au.dk/~nygaard/pub/itc.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, higherorder 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 [1, 10] can be seen as an attempt to bring concurrency back within the ... (Update)
Similar documents (at the sentence level):
7.4%: HOPLA - A Higher-Order Process Language - Nygaard, Winskel (2002) (Correct)
7.4%: Presheaf Models and Process Calculi - Nygaard (2002) (Correct)
Active bibliography (related documents): More All
0.5: Some Algebraic Properties of (Co)Spans - Bruni, Gadducci (2000) (Correct)
0.4: Domain Theory for Concurrency - Nygaard (2003) (Correct)
0.3: Towards an Operational Understanding of Presheaf Models - Nygaard (2001) (Correct)
Similar documents based on text: More All
0.5: Full Abstraction for HOPLA - Nygaard, Winskel (2003) (Correct)
0.2: Linearity in Process Languages - Nygaard, Winskel (2002) (Correct)
0.1: A Fully Abstract Presheaf Semantics of SCCS with Finite Delay - Hildebrandt (1999) (Correct)
BibTeX entry: (Update)
@misc{ nygaard-presheaf,
author = "Mikkel Nygaard",
title = "Presheaf semantics for HOPLA",
url = "citeseer.ist.psu.edu/nygaard02presheaf.html" }
Citations (may not include all citations):2732 Communicating sequential processes (context) - Hoare - 1978
484 A Calculus of Communicating Systems (context) - Milner - 1980
156 Basic concepts of enriched category theory (context) - Kelly - 1982
83 Sheaves in Geometry and Logic (context) - Lane, Moerdijk - 1992
69 Information and Computation (context) - Joyal, Nielsen et al. - 1996
58 Presheaf Models for Concurrency - Cattani - 1999
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
8 Categorical Models for Concurrency: Independence (context) - Hildebrandt - 2000
2 Relational semantics of non-deterministic data ow (context) - Hildebrandt, Panangaden et al.
2 A higher-order process language (context) - Nygaard, Winskel
1 A fully abstract presheaf semantics for SCCS with nite delay (context) - Hildebrandt
Documents on the same site (http://www.daimi.au.dk/~nygaard/notes.html):
Presheaf Models and Process Calculi - 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