Robin Milner [FOAF] [Follow]

Position:	appointed Professor of Computer Science
Affiliation:	Computer Science Cambridge UK
Email:
Homepage:	http://www.fairdene.com/picalculus/robin...
	[Edit]

Statistics:	H-index: 39 (See all experts' h-index.) total citation number: 15273 highest-cited paper: A Theory of Type Polymorphism in Programming (1978) at J. Comput. Syst. Sci. (Cited By 2078) More Statistics...

Research Interest:

Mobile Processes, Communicating Systems, Concurrent Processes, Concurrent Calculus, Edinburgh LCF

Show Temporal Interests (Do you want to see the change of his/her research interests?)

Publications: [Edit disambiguation Result]

Group By Year Group By Category

2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1998 1997 1996 1995 1994 1993 1992 1991 1990 1989 1988 1987 1986 1985 1984 1983 1982 1981 1980 1979 1978 1977 1972 1971 1970

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

Logic Programs / Algebraic Semantics Computer / Systems

Logic Programs / Algebraic Semantics(97)

Top

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

Computer / Systems(1)

Top

[1]	Karen A. Frenkel, Robin Milner. An Interview with Robin Milner. Commun. ACM, 1993: 90~97 [Bibtex]