Nobuko Yoshida  Home/Search
Context Related
| cogs.susx.ac.uk/users...minimum_s.ps.gz mcs.le.ac.uk/~nyoshid...minimum_s.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: cogs.susx.ac.uk/users/nob...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: ) y Nobuko Yoshida ? Abstract. In [18, 19], we presented a theory of concurrent combinators for the asynchronous monadic ß-calculus without match or summation operator [7, 16]. The system of concurrent combinators is based on a finite number of atoms and fixed interaction rules, but is as expressive as the original calculus, so that it can represent diverse interaction structures, including polyadic synchronous name passing [23] and input guarded summations [26]. The present paper shows that... (Update)
Context of citations to this paper: More
.... in [28] another property called locality where new receptors are not created by received channels, has also been studied in [3, 4, 20, 34] for an asynchronous version of the p calculus [16] The combination of these constraints provides a model of a realistic...
...for non determinism. Using these graphs, Yoshida shows that a minimal set of combinators can be used to represent the # calculus [Yos98]. Figure 11 illustrates some process graphs. The nodes K, L, M are the same as nodes in interaction nets. As with interaction nets, the...
Cited by: More
On Asynchrony in Name-Passing Calculi - Merro, Sangiorgi (2002) (Correct)
Localité Dans Le Pi-Calcul Et Applications Aux . . . - Merro (2000) (Correct)
Symmetric Action Calculi - Gardner, Wischik (1999) (Correct)
Similar documents (at the sentence level):
48.1%: Minimality and Separation Results on Asynchronous Mobile.. - Yoshida (1998) (Correct)
35.0%: Minimality and Separation Results on Asynchronous Mobile.. - Yoshida (1998) (Correct)
Active bibliography (related documents): More All
0.4: Graph Types For Monadic Mobile Processes - Yoshida (1996) (Correct)
0.4: Elementary Structures in Process Theory (1) Sets with Renaming - Honda (1997) (Correct)
0.3: Process Structures - Honda (1997) (Correct)
Similar documents based on text: More All
0.2: On the Expressive Power of Polyadic Synchronisation in.. - Carbone, Maffeis (2002) (Correct)
0.2: Channel Dependent Types for Higher-Order Mobile Processes.. - Yoshida (2004) (Correct)
0.2: Replication in Concurrent Combinators - Honda, Yoshida (1994) (Correct)
Related documents from co-citation: More All
6: Expressing Mobility (context) - Sangiorgi - 1993
6: The fusion calculus: Expressiveness and symmetry in mobile processes - Parrow, Victor - 1998
6: Information and Computation (context) - Milner, Parrow et al. - 1992
BibTeX entry: (Update)
N. Yoshida. Minimality and separation results on asynchronous mobile processes: Representability theorems by concurrent combinators. In Proceedings of CONCUR '98, LNCS 1466, pages 131-146, Springer-Verlag, 1998. http://citeseer.ist.psu.edu/article/yoshida98minimality.html More
@inproceedings{ yoshida98minimality,
author = "Nobuko Yoshida",
title = "Minimality and Separation Results on Asynchronous Mobile Processes: Representability Theorems by Concurrent Combinators (Extended Abstract)",
booktitle = "International Conference on Concurrency Theory",
pages = "131-146",
year = "1998",
url = "citeseer.ist.psu.edu/article/yoshida98minimality.html" }
Citations (may not include all citations):854 Information and Computation (context) - Milner, Parrow et al. - 1992
729 The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
294 An Object Calculus for Asynchronous Communication - Honda, Tokoro - 1991
291 A Calculus for Mobile Agents - Fournet - 1996
248 Expressing Mobility (context) - Sangiorgi - 1992
200 Pict: A Programming Language Based on the Pi-calculus - Pierce, Turner - 1997
194 Functions as Processes (context) - Milner - 1992
159 The Chemical Abstract Machine (context) - Berry, Boudol - 1992
143 A New Implementation Technique for Applicative Languages (context) - Turner - 1979
140 On Reduction-Based Process Semantics - Honda, Yoshida - 1995
127 Information and Computation (context) - Walker - 1995
115 An asynchronous model of locality (context) - Amadio - 1997
73 Comparing the Expressive Power of the Synchronous and the As.. - Palamidessi - 1997
66 Graph Types for Monadic Mobile Processes - Yoshida - 1996
61 The Fusion Calculus: Expressiveness and Symmetry in Mobile P.. - Parrow, Victor - 1998
60 Decoding choice encodings - Nestmann, Pierce - 1996
60 On asynchrony in name-passing calculi - Merro, Sangiorgi - 1998
42 Algebraic Theories for Name-Passing Calculi - Parrow, Sangiorgi - 1993
35 Combinatory Representation of Mobile Processes - Honda, Yoshida - 1994
35 Games Semantics and Abstract Machines (context) - Danos, Herbelin et al. - 1996
33 Asynchrony and ß-calculus (context) - Boudol - 1992
30 Some chemical abstract machines (context) - Boudol - 1994
27 the Expressiveness of Internal Mobility in Name-Passing Calc.. (context) - Boreale - 1996
23 Logic and Algebra of Specification (context) - Milner - 1992
22 Replication in Concurrent Combinators - Honda, Yoshida - 1994
22 On Bisimulations for the Asynchronous ß-calculus (context) - Amadio, Casellani - 1996
22 A Small Calculus for Concurrent Objects (context) - Honda, Tokoro - 1991
22 Graph Notation for Concurrent Combinators - Yoshida - 1995
20 Polarized Name Passing (context) - Odersky - 1995
18 Future Generation Computer Systems - Parrow - 1990
16 Two Bisimilarities in -calculus (context) - Honda - 1992
10 Process Structure - Honda - 1995
7 Combinatory Formulations of Concurrent Languages (context) - Raja, Shyamasundar - 1997
6 Available from http://www (context) - Honda, Process - 1997
3 of Advanced Study Institute on Proof and Computation (context) - Milner - 1993
2 Notes on Undirected Action Structure (context) - Honda - 1997
2 LFCS short course lecture (context) - Abramsky - 1997
2 Festschrift in honour of Robin Milner (context) - Parrow - 1998
1 A Typed Language for Distibuted Mobile Processes (context) - Riely, Hennessy - 1998
1 To appear as a technical report of Sussex University (context) - of - 1998
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cogs.susx.ac.uk/users/nobuko/index.html): More
Subtyping and Locality in Distributed Higher Order Processes - Yoshida, Hennessy (1999) (Correct)
Game Theoretic Analysis Of Call-By-Value Computation - Honda, YOSHIDA (1997) (Correct)
Minimality and Separation Results on Asynchronous Mobile.. - Yoshida (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