| 2013 | ||
|---|---|---|
| j37 | Troels Christoffer Damgaard, Arne J. Glenstrup, Lars Birkedal, Robin Milner: An inductive characterization of matching in binding bigraphs. Formal Asp. Comput. 25(2): 257-288 (2013) | |
| 2010 | ||
| j36 | Robin Milner: Discussant of Response to the Computer Journal Lecture by Morris Sloman. Comput. J. 53(7): 1128 (2010) | |
| 2009 | ||
| b7 | Robin Milner: The Space and Motion of Communicating Agents. Cambridge University Press 2009, isbn 978-0-521-73833-0, pp. I-XXI, 1-191 | |
| c56 | ||
| 2008 | ||
| j35 | ||
| j34 | Jean Krivine, Robin Milner, Angelo Troina: Stochastic Bigraphs. Electr. Notes Theor. Comput. Sci. 218: 73-96 (2008) | |
| c55 | Robin Milner: Keynote: The Space and Motion of Large Informatic Systems. BCS Int. Acad. Conf. 2008: 1-79 | |
| c54 | ||
| 2007 | ||
| j33 | Robin Milner: Local Bigraphs and Confluence: Two Conjectures: (Extended Abstract). Electr. Notes Theor. Comput. Sci. 175(3): 65-73 (2007) | |
| j32 | Lars Birkedal, Troels Christoffer Damgaard, Arne J. Glenstrup, Robin Milner: Matching of Bigraphs. Electr. Notes Theor. Comput. Sci. 175(4): 3-19 (2007) | |
| 2006 | ||
| j31 | ||
| j30 | ||
| j29 | ||
| j28 | James J. Leifer, Robin Milner: Transition systems, link graphs and Petri nets. Mathematical Structures in Computer Science 16(6): 989-1047 (2006) | |
| j27 | Susan Stepney, Samuel L. Braunstein, John A. Clark, Andrew M. Tyrrell, Andrew Adamatzky, Robert E. Smith, Thomas R. Addis, Colin G. Johnson, Jonathan Timmis, Peter H. Welch, Robin Milner, Derek Partridge: Journeys in non-classical computation II: initial journeys and waypoints. IJPEDS 21(2): 97-125 (2006) | |
| j26 | ||
| 2005 | ||
| j25 | ||
| j24 | Robin Milner: Axioms for bigraphical structure. Mathematical Structures in Computer Science 15(6): 1005-1032 (2005) | |
| j23 | Susan Stepney, Samuel L. Braunstein, John A. Clark, Andrew M. Tyrrell, Andrew Adamatzky, Robert E. Smith, Tom Addis, Colin G. Johnson, Jonathan Timmis, Peter H. Welch, Robin Milner, Derek Partridge: Journeys in non-classical computation I: A grand challenge for computing research. Parallel Algorithms Appl. 20(1): 5-19 (2005) | |
| c53 | ||
| c52 | Robin Milner: Embeddings and Contexts for Link Graphs. Formal Methods in Software and Systems Modeling 2005: 343-351 | |
| 2004 | ||
| c51 | ||
| c50 | ||
| 2003 | ||
| c49 | ||
| c48 | ||
| 2002 | ||
| j22 | James J. Leifer, Robin Milner: Shallow Linear Action Graphs and their Embeddings. Formal Asp. Comput. 13(3-5): 327-340 (2002) | |
| c47 | ||
| 2001 | ||
| c46 | ||
| c45 | ||
| c44 | ||
| 2000 | ||
| c43 | James J. Leifer, Robin Milner: Deriving Bisimulation Congruences for Reactive Systems. CONCUR 2000: 243-258 | |
| c42 | Robin Milner: Graphical Theories of Interactive Systems: Can a Proof Assistant Help? TPHOLs 2000: 442 | |
| 1999 | ||
| b6 | Robin Milner: Communicating and mobile systems - the Pi-calculus. Cambridge University Press 1999, isbn 978-0-521-65869-0, pp. I-XII, 1-161 | |
| 1998 | ||
| c41 | ||
| 1997 | ||
| c40 | ||
| c39 | ||
| 1996 | ||
| j21 | ||
| 1995 | ||
| c38 | Robin Milner: Control Structures: a Model of Interaction. Category Theory and Computer Science 1995: 1-2 | |
| c37 | ||
| 1994 | ||
| c36 | ||
| c35 | ||
| 1993 | ||
| j20 | ||
| j19 | ||
| j18 | Robin Milner, Faron Moller: Unique Decomposition of Processes. Theor. Comput. Sci. 107(2): 357-363 (1993) | |
| j17 | Robin Milner, Joachim Parrow, David Walker: Modal Logics for Mobile Processes. Theor. Comput. Sci. 114(1): 149-171 (1993) | |
| c34 | ||
| c33 | ||
| c32 | ||
| 1992 | ||
| j16 | Kim Guldstrand Larsen, Robin Milner: A Compositional Protocol Verification Using Relativized Bisimulation. Inf. Comput. 99(1): 80-108 (1992) | |
| j15 | Robin Milner, Joachim Parrow, David Walker: A Calculus of Mobile Processes, I. Inf. Comput. 100(1): 1-40 (1992) | |
| j14 | Robin Milner, Joachim Parrow, David Walker: A Calculus of Mobile Processes, II. Inf. Comput. 100(1): 41-77 (1992) | |
| j13 | Robin Milner: Functions as Processes. Mathematical Structures in Computer Science 2(2): 119-141 (1992) | |
| c31 | ||
| c30 | ||
| c29 | ||
| c28 | Dave Berry, Robin Milner, David N. Turner: A Semantics for ML Concurrency Primitives. POPL 1992: 119-129 | |
| 1991 | ||
| b5 | Robin Milner, Mads Tofte: Commentary on standard ML. MIT Press 1991, isbn 978-0-262-63137-2, pp. 1-160 | |
| j12 | Robin Milner, Mads Tofte: Co-Induction in Relational Semantics. Theor. Comput. Sci. 87(1): 209-220 (1991) | |
| c27 | ||
| c26 | Pierre America, Robin Milner, Oscar Nierstrasz, Mario Tokoro, Akinori Yonezawa: What Is An Object? Object-Based Concurrent Computing 1991: 257-264 | |
| c25 | ||
| 1990 | ||
| b4 | Robin Milner, Mads Tofte, Robert Harper: Definition of standard ML. MIT Press 1990, isbn 978-0-262-63132-7, pp. I-XI, 1-101 | |
| j11 | Robin Milner, Faron Moller: Unique decomposition of processes. Bulletin of the EATCS 41: 226-233 (1990) | |
| j10 | Robin Milner: Interpreting one Concurrent Calculus in Another. Theor. Comput. Sci. 75(1&2): 3-13 (1990) | |
| p1 | Robin Milner: Operational and Algebraic Semantics of Concurrent Processes. Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B) 1990: 1201-1242 | |
| c24 | ||
| c23 | Gul Agha, Samson Abramsky, Carl Hewitt, Robin Milner, Peter Wegner, Akinori Yonezawa: Foundations of Concurrent Object-Oriented Programming (Panel). OOPSLA/ECOOP 1990: 100 | |
| 1989 | ||
| b3 | Robin Milner: Communication and concurrency. PHI Series in computer science, Prentice Hall 1989, isbn 978-0-13-115007-2, pp. I-XI, 1-260 | |
| j9 | Robin Milner: A Complete Axiomatisation for Observational Congruence of Finite-State Behaviors. Inf. Comput. 81(2): 227-247 (1989) | |
| 1988 | ||
| c22 | ||
| c21 | ||
| 1987 | ||
| c20 | Kim Guldstrand Larsen, Robin Milner: Verifying a Protocol Using Relativized Bisimulation. ICALP 1987: 126-135 | |
| c19 | ||
| c18 | ||
| c17 | Robert Harper, Robin Milner, Mads Tofte: A Type Discipline for Program Modules. TAPSOFT, Vol.2 1987: 308-319 | |
| 1986 | ||
| c16 | ||
| 1985 | ||
| j8 | Matthew Hennessy, Robin Milner: Algebraic Laws for Nondeterminism and Concurrency. J. ACM 32(1): 137-161 (1985) | |
| 1984 | ||
| j7 | Robin Milner: A Complete Inference System for a Class of Regular Behaviours. J. Comput. Syst. Sci. 28(3): 439-466 (1984) | |
| c15 | Robin Milner: Lectures on a Calculus for Communicating Systems. Seminar on Concurrency 1984: 197-220 | |
| c14 | ||
| 1983 | ||
| j6 | ||
| c13 | Robin Milner: Using Algebra for Concurrency: Some Approaches. The Analysis of Concurrent Systems 1983: 7-25 | |
| c12 | Robin Milner: Parallel Combinator Reduction Machine. The Analysis of Concurrent Systems 1983: 121-126 | |
| c11 | ||
| 1982 | ||
| c10 | ||
| c9 | ||
| 1981 | ||
| c8 | ||
| 1980 | ||
| b2 | Robin Milner: A Calculus of Communicating Systems. Lecture Notes in Computer Science 92, Springer 1980, isbn 3-540-10235-3 | |
| c7 | ||
| 1979 | ||
| b1 | Michael J. C. Gordon, Robin Milner, Christopher P. Wadsworth: Edinburgh LCF. Lecture Notes in Computer Science 78, Springer 1979, isbn 3-540-09724-4 | |
| j5 | ||
| j4 | ||
| c6 | ||
| c5 | ||
| 1978 | ||
| j3 | Robin Milner: A Theory of Type Polymorphism in Programming. J. Comput. Syst. Sci. 17(3): 348-375 (1978) | |
| c4 | ||
| c3 | Michael J. C. Gordon, Robin Milner, L. Morris, Malcolm C. Newey, Christopher P. Wadsworth: A Metalanguage for Interactive Proof in LCF. POPL 1978: 119-130 | |
| 1977 | ||
| j2 | ||
| 1972 | ||
| c2 | Robin Milner: A calculus for the mathematical theory of computation. International Sympoisum on Theoretical Programming 1972: 332-343 | |
| 1971 | ||
| c1 | ||
| 1970 | ||
| j1 | ||
Colors in the list of coauthors
Last update Mon May 20 09:31:37 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page