R. Milner. Functions as processes. Mathematical Structures in Computer Science, 2:119--141, 1992. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Constraints for Free in Concurrent Computation - Niehren, Müller (1995) (18 citations) (Correct)
....in continuation passing style. The ae calculus over an arbitrary constraint system is an extension of the standard cc model with procedural abstraction. 1 Introduction Concurrent computation allows the unification of many programmingparadigms. This observation underlies Milner s calculus [14, 13], Saraswat s concurrent constraint (cc) model [21] and Smolka s fl calculus [23] It is also central to the actor model by Hewitt and Agha [1] Concurrency is the key to the programming language Oz [24] which integrates functional [16] object oriented [7] and constraint programming [9, 15] In ....
....[16] The ae calculus is syntactically compositional: Constraints, applications, conditionals, and cells can be freely combined by composition, declaration, and abstraction. The reduction relation of ae is defined up to a structural congruence, as familiar from recent presentations of [13, 3, 8] and fl [23] The central novelty in the version presented here is the distinction of logical conjunction ( on constraints from composition ( In the standard cc model [21, 5, 6] these distinctions hold implicitly due to a monolithic constraint store. In a compositional syntax, the separation ....
[Article contains additional citation context not shown here]
R. Milner. Functions as Processes. Mathematical Structures in Computer Science, 2(2):119--141, 1992.
Genericity and the π-Calculus - Berger, Honda, Yoshida (2002) (Correct)
....:x and F = x: x :y. Then the relation =8 [28] is the largest congruence satisfying: 8M 1;2 : B : M 1 =8 M 2 , M 1 T ,M 2 T) It can be shown that T and F are essentially the only inhabitants of B . 9. 1 Encoding and Adequacy We use Milner s untyped call by value encoding [24] (this only di ers from Turner s translation [38] in the treatment of quanti cation) We use this particular encoding since it allows us to present the de nability argument in a simplest possible form (cf. 16] The call by name or other reasonable encodings (for example as found in [9] induce ....
Milner, R. Functions as processes. Mathematical Structures in Computer Science 2, 2 (1992), 119-141.
Genericity and the π-Calculus - Berger, Honda, Yoshida (2002) (Correct)
....(xx) T = Ax. AxX.AyX.x and F = Ax. AxX.AyX.y. Then the relation v [28] is the largest congruence satisfying: VM1,2: x. M1 M2 4 (M1 4) T 4 M2 4) T) It can be shown that T and F are essentially the only inhabitants of 9. 1 Encoding and Adequacy We use Milner s untyped call by value encoding [24] (this only differs from Turner s translation [38] in the treatment of quantification) We use this par ticular encoding since it allows us to present the definability argument in a simplest possible form (cf. 16] The call by name or other reasonable encodings (for example as found in [9] ....
MILNER, R. Functions as processes. Mathematical Structures in Computer Science 2, 2 (1992), 119-141.
Linearity, Sharing and State: a fully abstract game.. - Abramsky, McCusker (1997) (2 citations) (Correct)
....semantics of Idealized Algol and demonstrate that the the games model is both sound and computationally adequate, yielding an inequational soundness theorem. We present the operational semantics as a big step evaluation relation, with an auxiliary relation of structural congruence (cf. [17]) denoted by j. The structural congruence is that generated by fi conversion and all instances of M j YM: We shall assume that the only program variables are of type N for simplicity. Let us introduce some notation. A var[N] context Gamma is one of the form Gamma = x 1 : var[N] xn : ....
R. Milner. Functions as processes. Mathematical Structures in Computer Science, 2(2):119--142, 1992.
Full Abstraction for Idealized Algol with Passive Expressions - Abramsky, McCusker (1998) (12 citations) (Correct)
....semantics of Idealized Algol and demonstrate that the the games model is both sound and computationally adequate, yielding an inequational soundness theorem. We present the operational semantics as a big step evaluation relation, with an auxiliary relation 32 of structural congruence (cf. [18]) denoted by j. The structural congruence is that generated by fi conversion and all instances of M j YM: Let us introduce some notation. A var context Gamma is one of the form Gamma = x 1 : var; xn : var, with the x i distinct. A Gamma store is a partial function s : fx 1 ; ....
R. Milner. Functions as processes. Mathematical Structures in Computer Science, 2(2):119--142, 1992.
The Formal Relationship Between Direct and Continuation-Passing.. - Sabry (1994) (9 citations) (Correct)
....(W (alloc A P ) alloc A (W P ) A 62 FV (W ) l lift ) alloc A P ) P A 62 FV (P ) gc) Axioms fi v and lk 1 are straightforward and self explanatory. Axiom lk 2 ensures that store components not containing the looked up address are preserved. Axiom l lift implements scope extrusion [29, 66]; it lifts the binding of the location A to permit the evaluation of the application (W P ) The condition A 62 FV (W ) ensures that alloc does not capture any free locations A in W and may require that the bound location A be renamed, e.g. hd; si:s A) alloc A hA; Si) alloc A 1 ( hd; ....
Milner, R. Functions as processes. Mathematical Structures in Computer Science, 2 (1992) 119--141.
Is It Possible to Decide Whether a Cryptographic Protocol is .. - Comon, Shmatikov (2001) (11 citations) (Correct)
....and strand spaces [THG99] For information about the relation between different models, see [CDL 00] 3.2. Spi calculus In the spi calculus [AG99] the behavior of honest protocol participants is formalized as a process in a specialpurpose process calculus (basically, an extension of p calculus [Mil92] with cryptographic operations) This process can be replicated any number of times to model several instances of the protocol running concurrently. The attacker can observe and participate in any communication in any possible way. The model, however, also relies on the perfect cryptography ....
R. Milner. Functions as processes. Mathematical Structures in Computer Science, 2:119--141, 1992.
Presheaf Models Concurrency - Cattani (1999) (35 citations) (Correct)
....P P Q Q P (P Q) R P (Q R) P P P (P (Q Here P [z y] denotes capture avoiding substitution which may of course require in turn the # conversion of subexpressions. This equivalence is not as aggressive as the structural congruence of, say, Definition 3. 1 in [83], which allows name restriction #x( to change its scope. Nevertheless it cuts down the operational rules we shall need, with none at all for matching and replication. All this is to some degree a matter of taste: if we treat process terms as concrete syntax, with no structural identification, ....
Robin Milner. Functions as processes. Mathematical Structures in Computer Science, 20(2):119--141, 1992.
Research Directions in Rewriting Logic - Meseguer (1998) (10 citations) (Correct)
....Viry [159] has given a very natural specification of the calculus in rewriting logic. The realization that the operational semantics of the calculus can be naturally described using rewrite rules modulo the associativity and commutativity of a multiset union operator goes back to Milner [128]. However, as in the case of rewriting logic specifications of the lambda calculus discussed in Section 3.1, binding operators become an extra feature that should be accounted for. As for the lambda calculus, the answer given by Viry [158] resides in an equational theory of explicit substitution, ....
R. Milner. Functions as processes. Mathematical Structures in Computer Science, 2(2):119--141, 1992.
A Calculus for Cryptographic Protocols - The Spi Calculus - Abadi, Gordon (1998) (353 citations) (Correct)
No context found.
R. Milner. Functions as processes. Mathematical Structures in Computer Science, 2:119--141, 1992.
Provable Implementations of Security Protocols - Andrew Gordon Microsoft (Correct)
No context found.
R. Milner. Functions as processes. Mathematical Structures in Computer Science, 2(2):119--141, 1992.
Verified Interoperable Implementations of Security Protocols - Karthikeyan Bhargavan Edric (2006) (Correct)
No context found.
R. Milner. Functions as processes. Mathematical Structures in Computer Science, 2(2):119--141, 1992.
Universita degli Studi di Pisa - Facolta Di Scienze (Correct)
No context found.
R. Milner. Function as processes. Mathematical Structures in Computer Science, 2:119--141, 1992.
Ensuring Termination by Typability - Deng, Sangiorgi (Correct)
No context found.
R. Milner. Functions as processes. Mathematical Structures in Computer Science, 2(2):119--141, 1992.
Combinatory Representation of Mobile Processes - Kohei Honda Kohei (1994) (19 citations) (Correct)
No context found.
Milner, R., Functions as Processes. Mathematical Structure in Computer Science, 2(2), pp.119--146, 1992.
Replication in Concurrent Combinators - Honda, Yoshida (1994) (9 citations) (Correct)
No context found.
Milner, R., Functions as Processes. Mathematical Structure in Computer Science, 2(2), pp.119--146, 1992.
On Bisimulations for the Asynchronous π-calculus? - Amadio, Castellani, Sangiorgi (1997) (Correct)
No context found.
R. Milner. Functions as processes. Mathematical Structures in Computer Science, 2(2):11914.
Is It Possible to Decide Whether a Cryptographic Protocol Is .. - Common, Shmatikov (Correct)
No context found.
R. Milner. Functions as processes. Mathematical Structures in Computer Science, 2:119--141, 1992.
A Calculus for Cryptographic Protocols - The Spi Calculus - Abadi, Gordon (1996) (353 citations) (Correct)
No context found.
R. Milner. Functions as processes. Mathematical Structures in Computer Science, 2:119--141, 1992.
Rewriting Logic Semantics: From Language Specifications To.. - Meseguer, Rosu (2004) (Correct)
No context found.
R. Milner. Functions as processes. Mathematical Structures in Computer Science, 2(2):119--141, 1992.
Explicit Fusions - Wischik, Gardner (2000) (7 citations) (Correct)
No context found.
R. Milner. Functions as processes. Mathematical Structures in Computer Science, 2(2):119--141, 1992.
Synthesising Labelled Transitions and Operational Congruences in.. - Leifer (2002) (7 citations) (Correct)
No context found.
R. Milner. Functions as processes. Mathematical Structures in Computer Science, 2(2):119--141, 1992. 20, 35}
Secure Implementation of Channel Abstractions - Mart Abadi Abadi (1998) (9 citations) (Correct)
No context found.
Robin Milner. Functions as processes. Mathematical Structures in Computer Science, 2:119-141, 1992.
A Distributed Calculus for R ole-Based Access Control - Chiara Braghin Daniele (2004) (2 citations) (Correct)
No context found.
R. Milner. Functions as processes. Mathematical Structures in Computer Science, 2(2):119--141, 1992.
Description and Verification of Mobile Processes with Graph.. - König (Correct)
No context found.
Robin Milner. Functions as processes. Mathematical Structures in Computer Science, 2:119--141, 1992. 217
First 50 documents Next 50
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