| 2008 |
|---|
| 92 | EE | Robin Milner:
Categories, Software and Meaning.
Concurrency, Graphs and Models 2008: 799-801 |
| 91 | EE | Robin Milner:
Bigraphs and Their Algebra.
Electr. Notes Theor. Comput. Sci. 209: 5-19 (2008) |
| 90 | EE | Jean Krivine,
Robin Milner,
Angelo Troina:
Stochastic Bigraphs.
Electr. Notes Theor. Comput. Sci. 218: 73-96 (2008) |
| 2007 |
|---|
| 89 | EE | Robin Milner:
Local Bigraphs and Confluence: Two Conjectures: (Extended Abstract).
Electr. Notes Theor. Comput. Sci. 175(3): 65-73 (2007) |
| 88 | EE | Lars Birkedal,
Troels Christoffer Damgaard,
Arne J. Glenstrup,
Robin Milner:
Matching of Bigraphs.
Electr. Notes Theor. Comput. Sci. 175(4): 3-19 (2007) |
| 2006 |
|---|
| 87 | EE | Robin Milner:
Ubiquitous Computing: Shall we Understand It?
Comput. J. 49(4): 383-389 (2006) |
| 86 | EE | Robin Milner:
Pervasive Process Calculus.
Electr. Notes Theor. Comput. Sci. 162: 255-259 (2006) |
| 85 | EE | 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) |
| 84 | EE | Robin Milner:
Pure bigraphs: Structure and dynamics.
Inf. Comput. 204(1): 60-122 (2006) |
| 83 | EE | James J. Leifer,
Robin Milner:
Transition systems, link graphs and Petri nets.
Mathematical Structures in Computer Science 16(6): 989-1047 (2006) |
| 82 | EE | Robin Milner:
Scientific Foundation for Global Computing.
T. Comp. Sys. Biology: 1-13 (2006) |
| 2005 |
|---|
| 81 | EE | Robin Milner:
Embeddings and Contexts for Link Graphs.
Formal Methods in Software and Systems Modeling 2005: 343-351 |
| 80 | EE | Robin Milner:
The Spectra of Words.
Processes, Terms and Cycles 2005: 1-5 |
| 79 | EE | Tony Hoare,
Robin Milner:
Grand Challenges for Computing Research.
Comput. J. 48(1): 49-52 (2005) |
| 78 | EE | Robin Milner:
Axioms for bigraphical structure.
Mathematical Structures in Computer Science 15(6): 1005-1032 (2005) |
| 77 | EE | 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) |
| 2004 |
|---|
| 76 | EE | Robin Milner:
Theories for the Global Ubiquitous Computer.
FoSSaCS 2004: 5-11 |
| 75 | | Robin Milner:
Towards a Broader Theory of Mobile Processes.
IFIP TCS 2004: 19 |
| 2003 |
|---|
| 74 | EE | Robin Milner:
Bigraphs for Petri Nets.
Lectures on Concurrency and Petri Nets 2003: 686-701 |
| 73 | EE | Ole Høgh Jensen,
Robin Milner:
Bigraphs and transitions.
POPL 2003: 38-49 |
| 2002 |
|---|
| 72 | EE | Robin Milner:
Bigraphs as a Model for Mobile Interaction.
ICGT 2002: 8-13 |
| 71 | EE | James J. Leifer,
Robin Milner:
Shallow Linear Action Graphs and their Embeddings.
Formal Asp. Comput. 13(3-5): 327-340 (2002) |
| 2001 |
|---|
| 70 | EE | Robin Milner:
Bigraphical Reactive Systems.
CONCUR 2001: 16-35 |
| 69 | EE | Robin Milner:
The Flux of Interaction.
ICATPN 2001: 19-22 |
| 68 | EE | Robin Milner:
Computational flux.
POPL 2001: 220-221 |
| 2000 |
|---|
| 67 | EE | James J. Leifer,
Robin Milner:
Deriving Bisimulation Congruences for Reactive Systems.
CONCUR 2000: 243-258 |
| 66 | | Robin Milner:
Graphical Theories of Interactive Systems: Can a Proof Assistant Help?
TPHOLs 2000: 442 |
| 1998 |
|---|
| 65 | | Robin Milner:
The Pi Calculus and Its Applications (Keynote Address).
IJCSLP 1998: 3-4 |
| 1997 |
|---|
| 64 | | Robin Milner:
Graphical Calculi for Interaction (Abstract).
ICALP 1997: 1 |
| 63 | | Robin Milner:
Strong Normalisation in Higher-Order Action Calculi.
TACS 1997: 1-19 |
| 1996 |
|---|
| 62 | | Robin Milner:
Calculi for Interaction.
Acta Inf. 33(8): 707-737 (1996) |
| 1995 |
|---|
| 61 | | Robin Milner:
Control Structures: a Model of Interaction.
Category Theory and Computer Science 1995: 1-2 |
| 60 | | Alex Mifsud,
Robin Milner,
A. John Power:
Control Structures
LICS 1995: 188-198 |
| 1994 |
|---|
| 59 | | Robin Milner:
Pi-Nets: A Graphical Form of pi-Calculus.
ESOP 1994: 26-42 |
| 58 | | Robin Milner:
Computing is Interaction.
IFIP Congress (1) 1994: 232-233 |
| 1993 |
|---|
| 57 | | Robin Milner:
Higher-Order Action Calculi.
CSL 1993: 238-260 |
| 56 | | Robin Milner:
An Action Structure for Synchronous pi-Calculus.
FCT 1993: 87-105 |
| 55 | | Robin Milner:
Action Calculi, or Syntactic Action Structures.
MFCS 1993: 105-121 |
| 54 | | Robin Milner:
Elements of Interaction - Turing Award Lecture.
Commun. ACM 36(1): 78-89 (1993) |
| 53 | | Karen A. Frenkel,
Robin Milner:
An Interview with Robin Milner.
Commun. ACM 36(1): 90-97 (1993) |
| 52 | | Robin Milner,
Faron Moller:
Unique Decomposition of Processes.
Theor. Comput. Sci. 107(2): 357-363 (1993) |
| 51 | | Robin Milner,
Joachim Parrow,
David Walker:
Modal Logics for Mobile Processes.
Theor. Comput. Sci. 114(1): 149-171 (1993) |
| 1992 |
|---|
| 50 | | Robin Milner:
The Polyadic Pi-calculus (Abstract).
CONCUR 1992: 1 |
| 49 | | Davide Sangiorgi,
Robin Milner:
The Problem of ``Weak Bisimulation up to''.
CONCUR 1992: 32-46 |
| 48 | | Robin Milner,
Davide Sangiorgi:
Barbed Bisimulation.
ICALP 1992: 685-695 |
| 47 | | Dave Berry,
Robin Milner,
David N. Turner:
A Semantics for ML Concurrency Primitives.
POPL 1992: 119-129 |
| 46 | | Robin Milner,
Joachim Parrow,
David Walker:
A Calculus of Mobile Processes, I
Inf. Comput. 100(1): 1-40 (1992) |
| 45 | | Robin Milner,
Joachim Parrow,
David Walker:
A Calculus of Mobile Processes, II
Inf. Comput. 100(1): 41-77 (1992) |
| 44 | | Kim Guldstrand Larsen,
Robin Milner:
A Compositional Protocol Verification Using Relativized Bisimulation
Inf. Comput. 99(1): 80-108 (1992) |
| 43 | | Robin Milner:
Functions as Processes.
Mathematical Structures in Computer Science 2(2): 119-141 (1992) |
| 1991 |
|---|
| 42 | | Robin Milner,
Joachim Parrow,
David Walker:
Modal Logics for Mobile Processes.
CONCUR 1991: 45-60 |
| 41 | | Pierre America,
Robin Milner,
Oscar Nierstrasz,
Mario Tokoro,
Akinori Yonezawa:
What Is An Object?
Object-Based Concurrent Computing 1991: 257-264 |
| 40 | | Robin Milner:
Concurrent Processes as Objects (Abstract).
VDM Europe (1) 1991: 9 |
| 39 | | Robin Milner,
Mads Tofte:
Co-Induction in Relational Semantics.
Theor. Comput. Sci. 87(1): 209-220 (1991) |
| 1990 |
|---|
| 38 | | Robin Milner:
Functions as Processes.
ICALP 1990: 167-180 |
| 37 | | Gul Agha,
Samson Abramsky,
Carl Hewitt,
Robin Milner,
Peter Wegner,
Akinori Yonezawa:
Foundations of Concurrent Object-Oriented Programming (Panel).
OOPSLA/ECOOP 1990: 100 |
| 36 | | Robin Milner:
Operational and Algebraic Semantics of Concurrent Processes.
Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B) 1990: 1201-1242 |
| 35 | | Robin Milner,
Faron Moller:
Unique decomposition of processes.
Bulletin of the EATCS 41: 226-233 (1990) |
| 34 | | Robin Milner:
Interpreting one Concurrent Calculus in Another.
Theor. Comput. Sci. 75(1&2): 3-13 (1990) |
| 1989 |
|---|
| 33 | | Robin Milner:
A Complete Axiomatisation for Observational Congruence of Finite-State Behaviors
Inf. Comput. 81(2): 227-247 (1989) |
| 1988 |
|---|
| 32 | | Robin Milner:
Some Directions in Concurrency Theory.
FGCS 1988: 163-164 |
| 31 | | Robin Milner:
Interpreting One Concurrent Calculus in Another.
FGCS 1988: 321-326 |
| 1987 |
|---|
| 30 | | Kim Guldstrand Larsen,
Robin Milner:
Verifying a Protocol Using Relativized Bisimulation.
ICALP 1987: 126-135 |
| 29 | | Robin Milner:
Some Uses of Maximal Fixed Points (Abstract of Invited Lecture)
LICS 1987: 3 |
| 28 | | Robin Milner:
Dialogue with a Proof System.
TAPSOFT, Vol.1 1987: 271-275 |
| 27 | | Robert Harper,
Robin Milner,
Mads Tofte:
A Type Discipline for Program Modules.
TAPSOFT, Vol.2 1987: 308-319 |
| 1986 |
|---|
| 26 | | Robin Milner:
Process Constructors and Interpretations (Invited Paper).
IFIP Congress 1986: 507-514 |
| 1985 |
|---|
| 25 | EE | Matthew Hennessy,
Robin Milner:
Algebraic Laws for Nondeterminism and Concurrency
J. ACM 32(1): 137-161 (1985) |
| 1984 |
|---|
| 24 | | Robin Milner:
A Proposal for Standard ML.
LISP and Functional Programming 1984: 184-197 |
| 23 | | Robin Milner:
Lectures on a Calculus for Communicating Systems.
Seminar on Concurrency 1984: 197-220 |
| 22 | | Robin Milner:
A Complete Inference System for a Class of Regular Behaviours.
J. Comput. Syst. Sci. 28(3): 439-466 (1984) |
| 1983 |
|---|
| 21 | | Robin Milner:
Parallel Combinator Reduction Machine.
The Analysis of Concurrent Systems 1983: 121-126 |
| 20 | | Robin Milner:
Firing Squad.
The Analysis of Concurrent Systems 1983: 314-317 |
| 19 | | Robin Milner:
Using Algebra for Concurrency: Some Approaches.
The Analysis of Concurrent Systems 1983: 7-25 |
| 18 | | Robin Milner:
Calculi for Synchrony and Asynchrony.
Theor. Comput. Sci. 25: 267-310 (1983) |
| 1982 |
|---|
| 17 | | Robin Milner:
Four Combinators for Concurrency.
PODC 1982: 104-110 |
| 16 | | Luís Damas,
Robin Milner:
Principal Type-Schemes for Functional Programs.
POPL 1982: 207-212 |
| 1981 |
|---|
| 15 | | Robin Milner:
A Modal Characterisation of Observable Machine-Behaviour.
CAAP 1981: 25-34 |
| 1980 |
|---|
| 14 | | Robin Milner:
A Calculus of Communicating Systems
Springer 1980 |
| 13 | | Matthew Hennessy,
Robin Milner:
On Observing Nondeterminism and Concurrency.
ICALP 1980: 299-309 |
| 1979 |
|---|
| 12 | | Michael J. C. Gordon,
Robin Milner,
Christopher P. Wadsworth:
Edinburgh LCF
Springer 1979 |
| 11 | | Robin Milner:
LCF: A Way of Doing Proofs with a Machine.
MFCS 1979: 146-159 |
| 10 | | Robin Milner:
An Algebraic Theory for Synchronization.
Theoretical Computer Science 1979: 27-35 |
| 9 | EE | George Milne,
Robin Milner:
Concurrent Processes and Their Syntax.
J. ACM 26(2): 302-321 (1979) |
| 8 | EE | Robin Milner:
Flowgraphs and Flow Algebras.
J. ACM 26(4): 794-818 (1979) |
| 1978 |
|---|
| 7 | | Robin Milner:
Synthesis of Communicating Behaviour.
MFCS 1978: 71-83 |
| 6 | | 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 |
| 5 | | Robin Milner:
A Theory of Type Polymorphism in Programming.
J. Comput. Syst. Sci. 17(3): 348-375 (1978) |
| 1977 |
|---|
| 4 | | Robin Milner:
Fully Abstract Models of Typed lambda-Calculi.
Theor. Comput. Sci. 4(1): 1-22 (1977) |
| 1972 |
|---|
| 3 | | Robin Milner:
A calculus for the mathematical theory of computation.
International Sympoisum on Theoretical Programming 1972: 332-343 |
| 1971 |
|---|
| 2 | | Robin Milner:
An Algebraic Definition of Simulation Between Programs.
IJCAI 1971: 481-489 |
| 1970 |
|---|
| 1 | | Robin Milner:
Equivalences on Program Schemes.
J. Comput. Syst. Sci. 4(3): 205-219 (1970) |
