R. Milner. Elements of interaction. Communications of the ACM, 36(1):78--89, January 1993. Turing Award lecture. (p. 4)  Home/Search   Document Not in Database   Summary   ACM   TOC   Related Articles   Check

.... algebra with a recursive operator like the construct [118, 122, 197] the calculus [161, 196] and the lazy calculus [120, 195] 7 Denotational Semantics Following a bias towards operational methods in process theory that dates back to Milner s original development of the theory of CCS [153, 160], most of the work in the field of the meta theory of process description languages reported in this chapter is concerned with operational and axiomatic semantics for terms and the relationships between the two. In particular, it is by 95 now clear that it is often possible to automatically ....

, Elements of interaction (Turing Award Lecture), Comm. ACM, 36 (1993), pp. 78--89. 121

....a reactive system, a single object, a single user DBMS are all SIMs. Algorithms, task sequences and function calls are TMs. It is generally agreed that reactive systems cannot be adequately modeled by algorithms or task sequences. See for example, contentions by Manna and Pnueli [6] and Milner [8]) The fundamental model of a reactive system is a Labeled Transition System (LTS) which is of the form LT = A, 6 , where is a set of states, A is a set of actions and 6: A x is a set of enabled transitions from each state that can take the machine to another state. A reactive ....

R. Milner. Elements of interaction (turing award lecture). Communications of the A CM, 36(1), January 1993.

.... in the language [23, 36, 88, 87, 16, 21, 22] that a process equivalence can be equationally characterized [7, 5] or that a language is implementable [23, 89] Following a bias towards operational methods in process theory that dates back to Milner s original development of the theory of CCS [59, 65], most of the work reported in the aforementioned references is concerned with operational, axiomatic semantics for processes and the relationships between the two. In particular, it is by now clear that it is often possible to automatically translate an operational theory of processes into an ....

, Elements of interaction (Turing Award Lecture), Comm. ACM, 36 (1993),

....Structures with Boxes : 54 6.3 Slicings : 61 6. 4 Translation of MALL proof structures : 64 7 The Exponentials 68 8 Acknowledgements 71 1 Introduction Milner s calculus [25, 26] is a recent addition to a large and active literature on the foundations of concurrent computation. These theories attempt to analyze and clarify the world of concurrently communicating processes (and associated programming languages) in much the same way as lambda calculus and other models of ....

....literature on the foundations of concurrent computation. These theories attempt to analyze and clarify the world of concurrently communicating processes (and associated programming languages) in much the same way as lambda calculus and other models of computation have done for the sequential world [26]. In a different direction, Jean Yves Girard [13, 16, 17, 18] has instituted the rapidly growing area of linear logic, a radical modification of traditional logic which appears to have strong connections with theoretical computer science. In several publications [16, 15] Girard has suggested that ....

R. Milner. Turing Award Lecture, 1992.

....rather than running the model. Once we have the mathematical apparatus to discover deadlock, we can also apply it to test models for livelock, fairness, and a variety of safety and progress properties. 3. 1 Modelling in CCS CCS is a process algebra developed by Milner over the last 20 years [28]. CCS is a very small language (just half a dozen syntactic rules) with a clean semantics and a rich equational reasoning system for analyzing behaviours and equalities. It permits descriptions of a system by the composition of its constituent parts called agents. CCS scales hierarchically and is ....

R. Milner. Elements of Interaction (Turing Award lecture). Communications of tne ACM, 16(1):78--89, January, 1993.

....view, compositions which share components might be considered as a single composition. Future developments of this work are concentrated in the area of formalization, especially the integration of the naming mechanisms which are proposed into specification languages. In this context, p Calculus [Miln93] may play an important role. Since p Calculus is built upon the notion of naming and because it provides a convient semantic substrate for object oriented programming (see for [Miln93] more detail) the formal framework provided by sense of direction can be specified using p Calculus, and later ....

....integration of the naming mechanisms which are proposed into specification languages. In this context, p Calculus [Miln93] may play an important role. Since p Calculus is built upon the notion of naming and because it provides a convient semantic substrate for object oriented programming (see for [Miln93] more detail) the formal framework provided by sense of direction can be specified using p Calculus, and later integrated in the formal semantics of an object oriented programming language. Walker explored first the use of the p Calculus to give semantics to concurrent object oriented programming ....

Milner, R., Elements of Interaction, Turing Award lecture, CACM Vol. 36, No. 1, January 1993, pp. 78-89.

....Proof Structures with Boxes : 54 6.3 Slicings : 61 6. 4 Translation of MALL proof structures : 64 7 The Exponentials 68 8 Acknowledgements 71 1 Introduction Milner s calculus [25, 26] is a recent addition to a large and active literature on the foundations of concurrent computation. These theories attempt to analyze and clarify the world of concurrently communicating processes (and associated programming languages) in much the same way as lambda calculus and other models of ....

....literature on the foundations of concurrent computation. These theories attempt to analyze and clarify the world of concurrently communicating processes (and associated programming languages) in much the same way as lambda calculus and other models of computation have done for the sequential world [26]. In a different direction, Jean Yves Girard [13, 16, 17, 18] has instituted the rapidly growing area of linear logic, a radical modification of traditional logic which appears to have strong connections with theoretical computer science. In several publications [16, 15] Girard has suggested that ....

R. Milner. Turing Award Lecture, 1992.

....This reflects the autonomy and time independence that agents have with respect to each others. Agents are free from following any rule to access data, so that previous models for concurrency, where the communication via shared variables needs explicit declaration of producer consumer relationships [4, 34, 48, 49, 50, 47], are no more suited. 2.1 Interaction The LO formalism considered in this paper uses a shared data space as the essential means of interaction between objects. In this respect, we focus on systems consisting of agents with multiple goals and interacting among themselves; in this sense ....

R. Milner. Interaction. turing award lecture. Communication of the ACM, 1993.

....replication. The semantic mapping is a strong bisimulation, and structurally congruent processes have the same semantics. This paper is readable without knowledge of Petri nets. 1 Introduction The calculus has recently been introduced as an extension of CCS to mobile concurrent processes (see [16, 13, 14, 15]) As for CCS [12] the (interleaving) semantics of the calculus is given by a transition system of which the states are process terms. In this paper, and in its sequel paper [9] we provide a Petri net semantics for the small calculus , i.e. the subset of the calculus defined by Milner in ....

R.Milner; Elements of interaction, Comm. of the ACM 36 (1993), 78-89, Turing Award Lecture

....is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and or specific permission. c fl 1993 ACM We are in good company; for instance Milner s Turing Award Lecture emphasizes naming as the key idea of the calculus [9]. However, Milner relies on names and processes alone, and requires an implementation mapping to recapture functional programming [8] This implementation is not fully abstract in that it invalidates observational equivalences that hold in a purely functional programming language. By contrast, ....

R. Milner. Elements of interaction. Communications of the ACM, 36(1):78--89, January 1993. Turing Award lecture.

....(see [OP92] and Appendix B) ffl It facilitates a form of higher order communication, where (names of links to) processes are transmitted between agents [San92] Neither of these were easily expressible in more classical process algebras such as CCS, CSP or ACP. Moreover, the calculus features [Mil93a] ffl A uniform way for defining data structures such as lists, numbers, Booleans, etc. MPW92, Mil93b] ffl A simple translation of the calculus into the calculus [MPW92] ffl A clear relation to object oriented programming, where naming of messages, objects, and classes is essential ....

R. Milner. Elements of interaction. Communications of the ACM, 36(1):78--89, 1993. Turing Award Lecture.

.... Peter Wegner has documented and explored the paradigm shift from algorithms to interaction in his recent CACM articles [Weg95, Weg97] Our view is of computation and interaction as two somewhat orthogonal concepts as opposed to the view of computation as interaction characterised by Milner in [Mil93]. An interactive program is inserted into the environment and interacts with it; the behaviour of this program depends on the behaviour of an environment and also the environment with such a program inserted into it changes its own behaviour as well. Therefore it is natural to consider a function ....

R. Milner. Elements of interaction. Communications of the ACM, 36(1):78--89, 1993. Turing Award Lecture.

....[71, 70] TRuby [69] have developed a rewriting tool based on the Ruby algebra for VLSI design derivation. 2.1. FORMAL METHODS 11 2.1.3 Process Calculi Process calculi provide an elegant formal basis for reasoning about interacting sequential systems. Milner s CCS [56, 57] and Pi calculus [58, 59] have had a great influence on the work in this dissertation. The idea of simulation in this thesis is inspired by the bisimulation relation among processes in CCS and Pi calculus. Hennessy s work on process algebra [32] and Hoare s CSP [33] have also given me valuable insights into the ....

Robin Milner. Elements of interaction. Communications of the ACM, 36(1):78-- 89, January 1993. Turing award lecture.

....1 ; 1 ] 1 Delta Delta Delta g; where [s; oe; deadlocks if [s; oe; 1 [ s; oe 0 ; 0 ] for no s 2 Stat e , oe 0 2 SynState , and 0 2 SynStore . The operational semantics is not compositional with respect to parallel composition as is shown in the following examples (cf. [Mil93]) The operational semantics is compositional with respect to all the other operators. 6 We present this alternative formulation as it can be generalized more conveniently (see Property 4.7) Example 2.10 We have that O [ v : 1 ; v : 2] O [ v : 1 ; v : v 1] but O [ v : 1 ; v : ....

R. Milner. Elements of Interaction. Communications of the ACM, 36(1):78--89, January 1993. Turing Award Lecture.

....use of so called channels. In value passing CCS, these synchronization channels are further used to carry values from one process (called the sender) to another process (called the receiver) where the values may be taken from some externally specified domain. In the calculus, the simple idea [Mil93] is to allow processes to exchange specific values channel names themselves 1 and, by that, to dynamically change their interconnection structures: processes become mobile. 1 The calculus had various other predecessors that also tried to pursue the idea of using channels as data in ....

R. Milner. Elements of Interaction. Communications of the ACM, 36(1):78--89, 1993. Turing Award Lecture.

No context found.

R. Milner. Elements of interaction. Communications of the ACM, 36(1):78--89, January 1993. Turing Award lecture. (p. 4)

No context found.

Robin Milner. Elements of interaction. Communications of the ACM, 36(1):78{ 89, 1993. Turing Award Lecture.

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