Samson Abramsky  Home/Search
Context Related
| dcs.ed.ac.uk/home/samson/pr209.ps.gz 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: www2.dcs.ed.ac.uk/home/samson/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper aims to give a readable and reasonably accessible account of some ideas linking the currently still largely separate worlds of concurrency theory and process algebra, on the one hand, and type theory, categorical models and realizability on the other. Background in process algebra may be found in standard texts such as [Hoa85, Hen88, Mil89, Ros97]; while background in realizability, categorical models etc. is provided by texts such as [GLT89, AL91, Cro93, AC98, BW99]. A modest... (Update)
Context of citations to this paper: More
...who wins these. For more on this, see [Abr97] and for further development of the connection between processes, games and Linear Logic, see [Abr00]. We have already developed these ideas more than enough for our purposes in this paper. 3 Composition We now turn to the crucial...
Cited by: More
Relating State-Based and Process-Based Concurrency through.. - Cervesato, Scedrov (2006) (Correct)
Information-Intensive Proof Technology - Constable (2003) (Correct)
Sequentiality vs. Concurrency in Games and Logic - Abramsky (2001) (Correct)
Active bibliography (related documents): More All
0.5: Predicate transformers and Linear Logic - yet another.. - Hyvernat (2004) (Correct)
0.1: A Characterization Of The Left Exact Categories Whose Exact.. - Menni (1999) (Correct)
0.1: An Extension of Models of Axiomatic Domain Theory to Models.. - Fiore, Plotkin (1997) (Correct)
Similar documents based on text: More All
0.4: A General Notion of Realizability - Birkedal (2000) (Correct)
0.4: Relative and Modified Relative Realizability - Birkedal, van Oosten (2000) (Correct)
0.4: Realizability and Verification of MSC Graphs - Alur, Etessami, Yannakakis (2001) (Correct)
Related documents from co-citation: More All
4: Concurrent games and full completeness - Abramsky, Mellies - 1998
3: Concurrent Constraint Programming (context) - Saraswat - 1990
3: Theoretical Computer Science (context) - Girard - 1987
BibTeX entry: (Update)
S. Abramsky. Process Realizability. In Foundations of Secure Computation, F. L. Bauer and R. Steinbruggen, eds. IOS Press 2000, 167-180. http://citeseer.ist.psu.edu/abramsky00process.html More
@misc{ abramsky00process,
author = "S. Abramsky",
title = "Process Realizability",
text = "S. Abramsky. Process Realizability. In Foundations of Secure Computation,
F. L. Bauer and R. Steinbruggen, eds. IOS Press 2000, 167-180.",
year = "2000",
url = "citeseer.ist.psu.edu/abramsky00process.html" }
Citations (may not include all citations):2732 Communicating Sequential Processes (context) - Hoare - 1985
1933 Communication and Concurrency (context) - Milner - 1989
299 Algebraic Theory of Processes (context) - Hennessy - 1988
268 Proofs and Types (context) - Girard, Lafont et al. - 1989
232 Category Theory for Computing Science (context) - Barr, Wells - 1999
231 A Theory of Communicating Sequential Processes (context) - Brookes, Hoare et al. - 1984
195 The Theory and Practice of Concurrency (context) - Roscoe - 1997
162 Data Types as Lattices (context) - Scott - 1976
149 Testing Equivalence for Processes (context) - DeNicola, Hennessy - 1983
121 Intensional interpretation of functionals of finite type (context) - Tait - 1967
81 Principles of Quantum Mechanics (context) - Dirac - 1967
50 Domains and Lambda-Calculi (context) - Amadio, Curien - 1998
49 An Improved Failures Model for Communicating Processes (context) - Brookes, Roscoe - 1984
44 the interpretation of intuitionistic number theory (context) - Kleene - 1945
38 Interaction Categories and Communicating Sequential Processe.. (context) - Abramsky - 1994
35 Cambridge University Press (context) - Crole, Types - 1993
24 Program extraction from classical proofs (context) - Berger, Schwichtenberg - 1995
19 Types and Structures (context) - Asperti, Longo - 1991
17 Proofs as Processes (context) - Abramsky - 1994
9 Department of Computer Science (context) - Longley, Language et al. - 1995
2 A specification structure for deadlockfreedom of synchronous.. - Abramsky, Gay et al. - 1999
1 Behavioural Equivalences induced by Programming Logics (context) - Brookes, Rounds - 1983
Documents on the same site (http://www2.dcs.ed.ac.uk/home/samson/): More
Concurrent Games and Full Completeness - Abramsky, Melliès (1998) (Correct)
Games in the Semantics of Programming Languages - Abramsky (1997) (Correct)
Retracing some paths in Process Algebra - Abramsky (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