Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRobin Milner
Person information
- award (1991): Turing Award
- award (2001): Programming Languages Achievement Award
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 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- 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 - 1991
- [b5]Robin Milner, Mads Tofte:
Commentary on standard ML. MIT Press 1991, ISBN 978-0-262-63137-2, pp. 1-160 - 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 - 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 - 1980
- [b2]Robin Milner:
A Calculus of Communicating Systems. Lecture Notes in Computer Science 92, Springer 1980, ISBN 3-540-10235-3 - 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
Journal Articles
- 2013
- [j34]Troels Christoffer Damgaard, Arne J. Glenstrup, Lars Birkedal, Robin Milner:
An inductive characterization of matching in binding bigraphs. Formal Aspects Comput. 25(2): 257-288 (2013) - 2010
- [j33]Robin Milner:
Discussant of Response to the Computer Journal Lecture by Morris Sloman. Comput. J. 53(7): 1128 (2010) - 2006
- [j32]Robin Milner:
Ubiquitous Computing: Shall we Understand It? Comput. J. 49(4): 383-389 (2006) - [j31]Robin Milner:
Pure bigraphs: Structure and dynamics. Inf. Comput. 204(1): 60-122 (2006) - [j30]James J. Leifer, Robin Milner:
Transition systems, link graphs and Petri nets. Math. Struct. Comput. Sci. 16(6): 989-1047 (2006) - [j29]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. Int. J. Parallel Emergent Distributed Syst. 21(2): 97-125 (2006) - [j28]Robin Milner:
Scientific Foundation for Global Computing. Trans. Comp. Sys. Biology 4: 1-13 (2006) - 2005
- [j27]Tony Hoare, Robin Milner:
Grand Challenges for Computing Research. Comput. J. 48(1): 49-52 (2005) - [j26]Robin Milner:
Axioms for bigraphical structure. Math. Struct. Comput. Sci. 15(6): 1005-1032 (2005) - [j25]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) - 2002
- [j24]James J. Leifer, Robin Milner:
Shallow Linear Action Graphs and their Embeddings. Formal Aspects Comput. 13(3-5): 327-340 (2002) - 1996
- [j23]Robin Milner:
Calculi for Interaction. Acta Informatica 33(8): 707-737 (1996) - 1993
- [j22]Robin Milner:
Elements of Interaction - Turing Award Lecture. Commun. ACM 36(1): 78-89 (1993) - [j21]Karen A. Frenkel, Robin Milner:
An Interview with Robin Milner. Commun. ACM 36(1): 90-97 (1993) - [j20]Robin Milner, Faron Moller:
Unique Decomposition of Processes. Theor. Comput. Sci. 107(2): 357-363 (1993) - [j19]Robin Milner, Joachim Parrow, David Walker:
Modal Logics for Mobile Processes. Theor. Comput. Sci. 114(1): 149-171 (1993) - 1992
- [j18]Kim Guldstrand Larsen, Robin Milner:
A Compositional Protocol Verification Using Relativized Bisimulation. Inf. Comput. 99(1): 80-108 (1992) - [j17]Robin Milner, Joachim Parrow, David Walker:
A Calculus of Mobile Processes, I. Inf. Comput. 100(1): 1-40 (1992) - [j16]Robin Milner, Joachim Parrow, David Walker:
A Calculus of Mobile Processes, II. Inf. Comput. 100(1): 41-77 (1992) - [j15]Robin Milner:
Functions as Processes. Math. Struct. Comput. Sci. 2(2): 119-141 (1992) - 1991
- [j14]Robin Milner, Mads Tofte:
Co-Induction in Relational Semantics. Theor. Comput. Sci. 87(1): 209-220 (1991) - 1990
- [j13]Robin Milner, Faron Moller:
Unique decomposition of processes. Bull. EATCS 41: 226-233 (1990) - [j12]Robin Milner:
Interpreting one Concurrent Calculus in Another. Theor. Comput. Sci. 75(1&2): 3-13 (1990) - 1989
- [j11]Robin Milner:
A Complete Axiomatisation for Observational Congruence of Finite-State Behaviors. Inf. Comput. 81(2): 227-247 (1989) - 1987
- [j10]Robin Milner:
Is Computing an Experimental Science? J. Inf. Technol. 2(2): 58-66 (1987) - 1985
- [j9]Matthew Hennessy, Robin Milner:
Algebraic Laws for Nondeterminism and Concurrency. J. ACM 32(1): 137-161 (1985) - 1984
- [j8]Robin Milner:
A Complete Inference System for a Class of Regular Behaviours. J. Comput. Syst. Sci. 28(3): 439-466 (1984) - 1983
- [j7]Robin Milner:
Calculi for Synchrony and Asynchrony. Theor. Comput. Sci. 25: 267-310 (1983) - 1979
- [j6]George J. Milne, Robin Milner:
Concurrent Processes and Their Syntax. J. ACM 26(2): 302-321 (1979) - [j5]Robin Milner:
Flowgraphs and Flow Algebras. J. ACM 26(4): 794-818 (1979) - 1978
- [j4]Robin Milner:
A Theory of Type Polymorphism in Programming. J. Comput. Syst. Sci. 17(3): 348-375 (1978) - 1977
- [j3]Robin Milner:
Fully Abstract Models of Typed lambda-Calculi. Theor. Comput. Sci. 4(1): 1-22 (1977) - 1970
- [j2]Robin Milner:
Equivalences on Program Schemes. J. Comput. Syst. Sci. 4(3): 205-219 (1970) - 1968
- [j1]Robin Milner:
String Handling in ALGOL. Comput. J. 10(4): 321-324 (1968)
Conference and Workshop Papers
- 2009
- [c63]Robin Milner:
Bigraphical Categories. CONCUR 2009: 30-36 - 2008
- [c62]Robin Milner:
Keynote: The Space and Motion of Large Informatic Systems. BCS Int. Acad. Conf. 2008: 1-79 - [c61]Robin Milner:
Categories, Software and Meaning. Concurrency, Graphs and Models 2008: 799-801 - [c60]Jean Krivine, Robin Milner, Angelo Troina:
Stochastic Bigraphs. MFPS 2008: 73-96 - 2006
- [c59]Lars Birkedal, Troels Christoffer Damgaard, Arne J. Glenstrup, Robin Milner:
Matching of Bigraphs. GT-VC@CONCUR 2006: 3-19 - [c58]Robin Milner:
Bigraphs and Their Algebra. LIX 2006: 5-19 - [c57]Robin Milner:
Local Bigraphs and Confluence: Two Conjectures: (Extended Abstract). EXPRESS 2006: 65-73 - 2005
- [c56]Robin Milner:
The Spectra of Words. Processes, Terms and Cycles 2005: 1-5 - [c55]Robin Milner:
Embeddings and Contexts for Link Graphs. Formal Methods in Software and Systems Modeling 2005: 343-351 - [c54]Robin Milner:
Pervasive Process Calculus. APC 25 2005: 255-259 - 2004
- [c53]Robin Milner:
Theories for the Global Ubiquitous Computer. FoSSaCS 2004: 5-11 - [c52]Robin Milner:
Towards a Broader Theory of Mobile Processes. IFIP TCS 2004: 19 - 2003
- [c51]Robin Milner:
Bigraphs for Petri Nets. Lectures on Concurrency and Petri Nets 2003: 686-701 - [c50]Ole Høgh Jensen, Robin Milner:
Bigraphs and transitions. POPL 2003: 38-49 - 2002
- [c49]Robin Milner:
Bigraphs as a Model for Mobile Interaction. ICGT 2002: 8-13 - 2001
- [c48]Robin Milner:
The Flux of Interaction. ICATPN 2001: 19-22 - [c47]Robin Milner:
Bigraphical Reactive Systems. CONCUR 2001: 16-35 - [c46]Robin Milner:
Computational flux. POPL 2001: 220-221 - 2000
- [c45]James J. Leifer, Robin Milner:
Deriving Bisimulation Congruences for Reactive Systems. CONCUR 2000: 243-258 - [c44]Robin Milner:
Graphical Theories of Interactive Systems: Can a Proof Assistant Help? TPHOLs 2000: 442 - 1998
- [c43]Robin Milner:
The Pi Calculus and Its Applications (Keynote Address). IJCSLP 1998: 3-4 - 1997
- [c42]Robin Milner:
Graphical Calculi for Interaction (Abstract). ICALP 1997: 1 - [c41]Robin Milner:
Strong Normalisation in Higher-Order Action Calculi. TACS 1997: 1-19 - 1995
- [c40]Robin Milner:
Control Structures: a Model of Interaction. Category Theory and Computer Science 1995: 1-2 - [c39]Alex Mifsud, Robin Milner, A. John Power:
Control Structures. LICS 1995: 188-198 - 1994
- [c38]Robin Milner:
Pi-Nets: A Graphical Form of pi-Calculus. ESOP 1994: 26-42 - [c37]Robin Milner:
Computing is Interaction. IFIP Congress (1) 1994: 232-233 - 1993
- [c36]Robin Milner:
Higher-Order Action Calculi. CSL 1993: 238-260 - [c35]Robin Milner:
An Action Structure for Synchronous pi-Calculus. FCT 1993: 87-105 - [c34]Robin Milner:
Action Calculi, or Syntactic Action Structures. MFCS 1993: 105-121 - 1992
- [c33]Robin Milner:
The Polyadic Pi-calculus (Abstract). CONCUR 1992: 1 - [c32]Davide Sangiorgi, Robin Milner:
The Problem of "Weak Bisimulation up to". CONCUR 1992: 32-46 - [c31]Robin Milner, Davide Sangiorgi:
Barbed Bisimulation. ICALP 1992: 685-695 - [c30]Dave Berry, Robin Milner, David N. Turner:
A Semantics for ML Concurrency Primitives. POPL 1992: 119-129 - [c29]Robin Milner:
Concurrent Processes as Objects. Refine 1992: 3 - 1991
- [c28]Robin Milner, Joachim Parrow, David Walker:
Modal Logics for Mobile Processes. CONCUR 1991: 45-60 - [c27]Pierre America, Robin Milner, Oscar Nierstrasz, Mario Tokoro, Akinori Yonezawa:
What Is An Object? Object-Based Concurrent Computing 1991: 257-264 - [c26]Robin Milner:
Concurrent Processes as Objects (Abstract). VDM Europe (1) 1991: 9 - 1990
- [c25]Robin Milner:
Functions as Processes. ICALP 1990: 167-180 - [c24]Gul Agha, Samson Abramsky, Carl Hewitt, Robin Milner, Peter Wegner, Akinori Yonezawa:
Foundations of Concurrent Object-Oriented Programming (Panel). OOPSLA/ECOOP 1990: 100 - 1988
- [c23]Robin Milner:
Some Directions in Concurrency Theory. FGCS 1988: 163-164 - [c22]Robin Milner:
Interpreting One Concurrent Calculus in Another. FGCS 1988: 321-326 - 1987
- [c21]Kim Guldstrand Larsen, Robin Milner:
Verifying a Protocol Using Relativized Bisimulation. ICALP 1987: 126-135 - [c20]Robin Milner:
Some Uses of Maximal Fixed Points (Abstract of Invited Lecture). LICS 1987: 3 - [c19]Robin Milner:
Dialogue with a Proof System. TAPSOFT, Vol.1 1987: 271-275 - [c18]Robert Harper, Robin Milner, Mads Tofte:
A Type Discipline for Program Modules. TAPSOFT, Vol.2 1987: 308-319 - 1986
- [c17]Robin Milner:
Process Constructors and Interpretations (Invited Paper). IFIP Congress 1986: 507-514 - 1984
- [c16]Robin Milner:
Lectures on a Calculus for Communicating Systems. Seminar on Concurrency 1984: 197-220 - [c15]Robin Milner:
A Proposal for Standard ML. LISP and Functional Programming 1984: 184-197 - 1983
- [c14]Robin Milner:
Using Algebra for Concurrency: Some Approaches. The Analysis of Concurrent Systems 1983: 7-25 - [c13]Robin Milner:
Parallel Combinator Reduction Machine. The Analysis of Concurrent Systems 1983: 121-126 - [c12]Robin Milner:
Firing Squad. The Analysis of Concurrent Systems 1983: 314-317 - 1982
- [c11]Robin Milner:
Four Combinators for Concurrency. PODC 1982: 104-110 - [c10]Luís Damas, Robin Milner:
Principal Type-Schemes for Functional Programs. POPL 1982: 207-212 - 1981
- [c9]Robin Milner:
A Modal Characterisation of Observable Machine-Behaviour. CAAP 1981: 25-34 - 1980
- [c8]Matthew Hennessy, Robin Milner:
On Observing Nondeterminism and Concurrency. ICALP 1980: 299-309 - 1979
- [c7]Robin Milner:
LCF: A Way of Doing Proofs with a Machine. MFCS 1979: 146-159 - [c6]Robin Milner:
An Algebraic Theory for Synchronization. Theoretical Computer Science 1979: 27-35 - 1978
- [c5]Robin Milner:
Synthesis of Communicating Behaviour. MFCS 1978: 71-83 - [c4]Michael J. C. Gordon, Robin Milner, F. Lockwood Morris, Malcolm C. Newey, Christopher P. Wadsworth:
A Metalanguage for Interactive Proof in LCF. POPL 1978: 119-130 - 1972
- [c3]Robin Milner:
A calculus for the mathematical theory of computation. International Sympoisum on Theoretical Programming 1972: 332-343 - [c2]Robin Milner:
Implementation and applications of Scott's logic for computable functions. Proving Assertions About Programs 1972: 1-6 - 1971
- [c1]Robin Milner:
An Algebraic Definition of Simulation Between Programs. IJCAI 1971: 481-489
Parts in Books or Collections
- 2010
- [p2]Mikkel Bundgaard, Robin Milner:
Unfolding CSP. Reflections on the Work of C. A. R. Hoare 2010: 213-228 - 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
Editorship
- 1976
- [e1]S. Michaelson, Robin Milner:
Third International Colloquium on Automata, Languages and Programming, University of Edinburgh, UK, July 20-23, 1976. Edinburgh University Press 1976, ISBN 0-85224-308-1 [contents]
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 01:40 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
