R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes. Technical report, Laboratory for Foundations of Computer Science, Department of Computer Science, University of Edinburgh, 1989. @ NUS Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Functional Computation as Concurrent Computation - Niehren (1996) (17 citations) (Correct)
....follows: Callby need reduction shares the evaluation of functional arguments and evaluates only needed arguments. As a formal basis, we use a uniformly confluent applicative core of a concurrent calculus that we call ffi 0 calculus. This is a proper subset of the polyadic asynchronous calculus [Mil91, HT91, Bou92] and of the ae calculus [NM95, Smo94] the latter being a foundation of higher order concurrent constraint programming. The choice of ffi 0 has the following advantages: 1. Delay and triggering mechanisms as needed for programming laziness are expressible within ffi 0 . 2. Mutually recursive ....
....case, the rightmost computation in Figure 1. This statement holds in general and enables us to compare call by need and call by value complexity in the ffi calculus. 3 The Applicative Core of the Calculus We define ffi 0 as the applicative core of the polyadic asynchronous calculus [Mil91, HT91, Bou92] and the ae calculus [NM95, Smo94] Interestingly, ffi 0 as formulated here is part of the Oz computation model [Smo94] and the Pict computation model [PT95b] which have been developed independently. We define the calculus ffi 0 via expressions, structural congruence, and reduction. The ....
[Article contains additional citation context not shown here]
Robin Milner. The polyadic -calculus: A tutorial. ECS-LFCS Report Series 91--180, Laboratory for Foundations of Computer Science, University of Edinburgh, 1991.
Functional Computation as Concurrent Computation - Niehren (1995) (17 citations) (Correct)
....follows: Call by need reduction shares the evaluation of functional arguments and evaluates only needed arguments. As a formal basis, we use a uniformly confluent applicative core of a concurrent calculus that we call ffi 0 calculus. This is a proper subset of the polyadic asynchronous calculus [Mil91, HT91, Bou92] and of the ae calculus [NM95, Smo94] the latter being a foundation of higher order concurrent constraint programming. The choice of ffi 0 has the following advantages: 1. Delay and triggering mechanisms as needed for programming laziness are expressible within ffi 0 . Originally, Smolka s ....
....case, the rightmost computation in Figure 1. This statement holds in general and enables us to compare call by need and call by value complexity in the ffi calculus. 3 The Applicative Core of the Calculus We define ffi 0 as the applicative core of the polyadic asynchronous calculus [Mil91, HT91, Bou92] and the ae calculus [NM95, Smo94] Interestingly, ffi 0 as formulated here is part of the Oz computation model [Smo94] and the Pict computation model [PT95b] which have been developed independently. We define the calculus ffi 0 via expressions, structural congruence, and reduction. The ....
[Article contains additional citation context not shown here]
Robin Milner. The polyadic -calculus: A tutorial. ECS-LFCS Report Series 91--180, Laboratory for Foundations of Computer Science, University of Edinburgh, Edinburgh EH9 3JZ, October 1991.
Hardware/Software Co-Design using Functional Languages - Mycroft, Sharp (2001) (4 citations) (Correct)
....the project is still in its early stages. We are currently investigating ways of extending the SAFL language to make it more expressive without loosing too many of its mathematical properties. Our current ideas centre around adding synchronous communication and a restricted form of # calculus [7] style channel passing. We believe that this will allow us to capture the semantics of I O whilst maintaining the correspondence between high level function definitions and hardware level resources. 4. ACKNOWLEDGEMENTS This work is part of a collaborative project, Self Timed Microprocessors , ....
Milner, R. The Polyadic #-calculus: a tutorial. Technical Report ECS-LFCS-91-180, Laboratory for Foundations of Computer Science, University of Edinburgh, October 1991.
The Definition of Kernel Oz - Smolka (1994) (24 citations) (Correct)
....from Hewitt s actor model of computation [6] However, both models have in common that they are inherently concurrent (Hewitt speaks of ultra concurrency) a class of expressions modulo a structural congruence. This set up, which is also employed in more recent presentations of the calculus [8, 7], proves particularly useful for Oz since constraint propagation and simplification can be accommodated elegantly by means of the structural congruence. Kernel Oz itself consists of a class of expressions whose semantics is defined by a translation into the elaborable expressions of the actor ....
....model can be seen as a computational metaphor for the calculus providing motivation and intuition. The Oz calculus models concurrent computation as rewriting of a class of expressions modulo a structural congruence. This set up, which is also employed in more recent presentations of the calculus [8, 7], proves particularly useful for Oz since constraint propagation and simplification can be accommodated elegantly by means of the structural congruence. The Oz calculus is not committed to a particular constraint system; instead, it is parameterized with respect to a general and straightforward ....
Robin Milner. The polyadic -calculus: A tutorial. ECS-LFCS Report Series 91-180, Laboratory for Foundations of Computer Science, University of Edinburgh, Edinburgh EH9 3JZ, October 1991.
Genericity and the π-Calculus - Berger, Honda, Yoshida (2002) (Correct)
....types proper) in [34] has a direct parallel in the present setting. As an example, a (non destructive) list type is de ned by: List(x ) xList(x) Then nil (located at x) becomes x(c) cin 1 , while cons of a value v and a list l (located at x) becomes x(c) cin 2 hvli (this follows [23]) We can then add relational actions on such types to obtain the extended relational theory. We leave the discussions on a systematic study of constant types to future occasions. 41 7 Generic Transition and Innocence This section discusses another basic element of the present theory, generic ....
Milner, R. The polyadic -calculus: A tutorial. Tech. Rep. 91-180, Laboratory for Foundations of Computer Science, Department of Computer Science, University of Edinburgh, 1991.
Genericity and the π-Calculus - Berger, Honda, Yoshida (2002) (Correct)
....introducing recursive types proper) in [34] has a direct parallel in the present setting. As an example, a (non destructive) list type is defined by: List(x ) Then nil (located at x) becomes x(c) inl, while cons of a value v and a list l (located at x) becomes x(c) in2(vl) this follows [23]) We can then add relational actions on such types to obtain the extended relational theory. We leave the discussions on a systematic study of constant types to future occasions. 41 7 Generic Transition and Innocence This section discusses another basic element of the present theory, generic ....
MILNER, R. The polyadic r-calculus: A tutorial. Tech. Rep. 91-180, Laboratory for Foundations of Computer Science, Department of Computer Science, University of Edinburgh, 1991.
Encoding Distributed Areas and Local Communication into the.. - Chothia, Stark (2001) (1 citation) Self-citation (Calculus) (Correct)
No context found.
Robin Milner. The polyadic #-calculus --- a tutorial. Technical Report ECSLFCS -91-180, Laboratory for Foundations of Computer Science, University of Edinburgh, 1991.
Guessing Attacks in the pi-calculus with a Computational.. - Chothia (2005) Self-citation (Pi-calculus) (Correct)
No context found.
Robin Milner. The polyadic pi-calculus - a tutorial. Technical Report ECS-LFCS91 -180, Laboratory for the Foundations of Computer Science, 1991.
A Distributed π-Calculus with Local Areas of Communication - Chothia, Stark (2001) Self-citation (Calculus) (Correct)
No context found.
Robin Milner. The polyadic #-calculus --- a tutorial. Technical Report ECSLFCS -91-180, Laboratory for Foundations of Computer Science, University of Edinburgh, 1991.
Encoding Distributed Areas and Local Communication into the.. - Chothia, Stark (2002) (1 citation) Self-citation (Calculus) (Correct)
No context found.
Robin Milner. The polyadic #-calculus --- a tutorial. Technical Report ECSLFCS -91-180, Laboratory for Foundations of Computer Science, University of Edinburgh, 1991.
Lu'is Lopes Vasco T. Vasconcelos - Departamento De Ciencia Self-citation (Calculus) (Correct)
.... calculus [15] was the first calculus in which processes could send one upright at a time through a named channel. This is called the monadic calculus. Later on this calculus was extended to allow for tuples to be exchanged in a single message, giving rise to the polyadic calculus [14]. This extension eased the programming task but did not increase the power of the calculus itself. Instead it introduced the possibility of protocol errors. These occur when two processes communicate exchanging tuples with different lengths. Such errors can be detected at compile time by using ....
....it introduced the possibility of protocol errors. These occur when two processes communicate exchanging tuples with different lengths. Such errors can be detected at compile time by using appropriate type inference algorithms, thus enforcing some kind of typing discipline on the usage of channels [14, 21, 19]. Recently, a considerable effort has been devoted to the problem of introducing objects into these calculi [8, 20, 24] thus providing a formal framework for modeling concurrent object oriented languages. TyCO [20, 22] is just one of these efforts. It is a calculus that formally describes the 2 ....
R. Milner. The Polyadic -Calculus: a Tutorial. Technical Report ECS-LFCS-91-180, Laboratory for Foundations of Computer Science, University of Edinburgh , October 1991.
New Foundations for the Geometry of Interaction - Samson Abramsky Radha (1993) (27 citations) (Correct)
No context found.
R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes. Technical report, Laboratory for Foundations of Computer Science, Department of Computer Science, University of Edinburgh, 1989.
New Foundations for the Geometry of Interaction - Samson Abramsky Radha (1993) (27 citations) (Correct)
No context found.
R. Milner. The polyadic -calculus: A tutorial. Technical report, Laboratory for Foundations of Computer Science, Department of Computer Science, University of Edinburgh, 1991.
A Calculus for Cryptographic Protocols - Lecture Notes Andrew (Correct)
No context found.
Robin Milner, Joachim Parrow, and David Walker. A calculus of mobile processes, parts I and II. Technical Reports ECS--LFCS--89--85 and --86, Laboratory for Foundations of Computer Science, Department of Computer Science, University of Edinburgh, June 1989.
Equational Properties of Mobile Ambients - Gordon, Cardelli (1999) (35 citations) (Correct)
No context found.
R. Milner. The polyadic -calculus: A tutorial. Technical Report ECS-- LFCS--91--180, Laboratory for Foundations of Computer Science, Department of Computer Science, University of Edinburgh, October 1991.
Behavior Model of Mobile Agent Systems - Pierre Vigneras Labri (Correct)
No context found.
Robin Milner. The polyadic #-calculus : a tutorial. Technical report, Laboratory for Foundation of Computer Science, Computer Science Department, Edinburgh University, octobre 1991.
A Framework for Seamlesly Making Object Oriented.. - Serge Chaumette And (Correct)
No context found.
Robin Milner, Joachim Parrow, and David Walker. A calculus of mobile processes (parts i and ii). Technical report, Laboratory for Foundation of Computer Science, Computer Science Department, Edinburgh University, June 1989.
Decoding Choice Encodings - Nestmann, Pierce (1996) (52 citations) (Correct)
No context found.
Robin Milner, Joachim Parrow, and David Walker. A Calculus of Mobile Processes, Part I/II. Technical Report ECS-LFCS-89-85/86, Laboratory for Foundations of Computer Sci ence, University of Edinburgh, June 1989. Published in Information and Computation 100:177, 1992. 45
On Asynchrony in Name-Passing Calculi - Merro, Sangiorgi (2002) (47 citations) (Correct)
No context found.
R. Milner. Action structure for the #-calculus. Technical Report ECS--LFCS--93--264, Laboratory for Foundations of Computer Science, Computer Science Department, Edinburgh University, 1992.
An Election Model in π-Calculus - Wu (Correct)
No context found.
Milner, R. (1991). The polyadic #-calculus: a tutorial. Technical Report ECS-LFCS91 -180, Laboratory for the Foundations of Computer Science, Department of Computer Science, University of Edinburgh.
Soft Scheduling for Hardware - Sharp, Mycroft (2001) (Correct)
No context found.
Milner, R. The Polyadic -calculus: a tutorial. Technical Report ECS-LFCS-91180, Laboratory for Foundations of Computer Science, University of Edinburgh, October 1991.
Hardware/Software Co-Design Using Functional Languages - Mycroft, Sharp (2001) (4 citations) (Correct)
No context found.
Milner, R. The Polyadic -calculus: a tutorial. Technical Report ECS-LFCS-91180, Laboratory for Foundations of Computer Science, University of Edinburgh, October 1991.
Description and Verification of Mobile Processes with Graph.. - König (Correct)
No context found.
R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, Part II. Tech. Rep. ECS-LFCS-89-86, University of Edinburgh, Laboratory for Foundations of Computer Science, 1989.
Description and Verification of Mobile Processes with Graph.. - König (Correct)
No context found.
R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, Part I. Tech. Rep. ECS-LFCS-89-85, University of Edinburgh, Laboratory for Foundations of Computer Science, 1989.
Description and Verification of Mobile Processes with Graph.. - König (Correct)
No context found.
Robin Milner. The polyadic -calculus: a tutorial. Tech. Rep. ECSLFCS -91-180, University of Edinburgh, Laboratory for Foundations of Computer Science, 1991.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST at NUS Add search form to your site Submit documents Feedback
CiteSeer.IST at NUS - Copyright Penn State and NEC. Hosted by the School of Computing, National University of Singapore.