R. Milner. A mathematical model of computing agents. In H.E. Rose and J.C. Shepherdson, editors, Proceedings Logic Colloquium 1973, pages 158--173. North-Holland, 1973. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Games and Full Completeness for Multiplicative Linear Logic - Samson Abramsky And (1994) (132 citations) (Correct)
....completeness, one has the tightest possible connection between syntax and semantics. We are not aware of any previously published results of this type; however, the idea is related to representation theorems in category theory [FS91] to full abstraction theorems in programming language semantics [Mil75, Plo77]; to studies of parametric polymorphism [BFSS90, HRR89] and to the completeness conjecture in [Gir91a] 3 We now make a first statement in broad terms of our results. We have refined Blass game semantics for Linear Logic. This refinement is not a complication; on the contrary, it makes the ....
R. Milner. Processes, a mathematical model of computing agents. In Logic Colloquium, Bristol 1973, pages 157--174. North Holland, Amsterdam, 1975.
Full Abstraction for Idealized Algol with Passive Expressions - Abramsky, McCusker (1998) (12 citations) (Correct)
....different time slots in the life of a single underlying object with state which changes over time; this is sharing rather than copying. How can we capture these features The point of view we wish to adopt is one we have already hinted at, and indeed appears in a significant line of previous work [19, 21, 30]. We want to understand new x in C as binding the free identifier x of type var to an object or process which gives the behaviour of a storage cell. The behaviour of new x in C then arises from the interaction between C and this cell, which is internalized , i.e. hidden from the environment. ....
R. Milner. Processes, a mathematical model of computing agents. In Logic Colloquium, Bristol 1973.
Algebraic Process Verification - Groote, Reniers (2000) (5 citations) (Correct)
.... Systems) Mil80] CSP (Communicating Sequential Processes) Hoa85] and ACP (Algebra of Communicating Processes) BK84, BW90] The basic motivation for the introduction of process algebras was the need to describe and study programs that are dynamically interacting with their environment [Mil73, Bek71] Before this time the mathematical view on programs was that of deterministic input output transformers: a program starts with some input, runs for a while, and if it terminates, yields the output. Such programs can be characterised by partial functions from the input to the output. This ....
R. Milner. A mathematical model of computing agents. In H.E. Rose and J.C. Shepherdson, editors, Proceedings Logic Colloquium 1973, pages 158-173. North-Holland, 1973.
Correspondence between operational and denotational semantics: the.. - Ong (1995) (16 citations) (Correct)
....terms M and N , A[ M ] A[ N ] M t N: If, in addition, the converse is also valid, that is to say, A[ M ] A[ N ] M t N; then the denotational semantics is said to be (equationally) fully abstract for the language. The notion of full abstraction is due to Milner [ Milner, 1975 ] though it seems implicit in work in the pure lambda calculus by Hyland, Morris [ Morris, 1968 ] Plotkin, Wadsworth [ Wadsworth, 1976; Wadsworth, 1978 ] and others. Adequacy and full abstraction tell us how well the operational and the denotational views of program equivalence relate to each ....
R. Milner. Processes, a mathematical model of computing agents. In Logic Colloquium, Bristol 1973, pages 157--174. NorthHolland, Amsterdam, 1975.
Algebraic Process Verification - Groote, Reniers (5 citations) (Correct)
No context found.
R. Milner. A mathematical model of computing agents. In H.E. Rose and J.C. Shepherdson, editors, Proceedings Logic Colloquium 1973, pages 158--173. North-Holland, 1973.
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