Robin Milner

Q: What Schools Are Affiliated With Robin Milner

Robin Milner is affiliated with the following schools: City, University of London, University of Edinburgh, Stanford University, Laboratory for Foundations of Computer Science, University of Cambridge

Robin Milner's AcademicInfluence.com Rankings

Robin Milner

Computer Science

#46

World Rank

#48

Historical Rank

Database

#116

World Rank

#119

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Why Is Robin Milner Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Arthur John Robin Gorell Milner was a British computer scientist, and a Turing Award winner. Life, education and career Milner was born in Yealmpton, near Plymouth, England into a military family. He gained a King's Scholarship to Eton College in 1947, and was awarded the Tomline Prize in 1952. Subsequently, he served in the Royal Engineers, attaining the rank of Second Lieutenant. He then enrolled at King's College, Cambridge, graduating in 1957. Milner first worked as a schoolteacher then as a programmer at Ferranti, before entering academia at City University, London, then Swansea University, Stanford University, and from 1973 at the University of Edinburgh, where he was a co-founder of the Laboratory for Foundations of Computer Science . He returned to Cambridge as the head of the Computer Laboratory in 1995 from which he eventually stepped down, although he was still at the laboratory. From 2009, Milner was a Scottish Informatics & Computer Science Alliance Advanced Research Fellow and held the Chair of Computer Science at the University of Edinburgh.

(See a Problem?)

Robin Milner's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Communication and concurrency (1989) (9177)
A Calculus of Communicating Systems (1980) (5044)
On Observing Nondeterminism and Concurrency (1980) (4589)
A Calculus of Mobile Processes, II (1992) (2920)
A Theory of Type Polymorphism in Programming (1978) (2623)
Definition of standard ML (1990) (2508)
Communicating and mobile systems - the Pi-calculus (1999) (2495)
Algebraic laws for nondeterminism and concurrency (1985) (1491)
Calculus of Mobile Processes (1992) (1454)
Principal type-schemes for functional programs (1982) (1339)
The Polyadic π-Calculus: a Tutorial (1993) (1126)
Calculi for Synchrony and Asynchrony (1983) (1029)
Functions as processes (1990) (780)
An Algebraic Definition of Simulation Between Programs (1971) (631)
Theories for the Global Ubiquitous Computer (2004) (565)
Barbed Bisimulation (1992) (503)
Fully Abstract Models of Typed lambda-Calculi (1977) (458)
Bigraphical Reactive Systems (2001) (409)
The Definition of Standard ML (Revised) (1997) (387)
A Complete Inference System for a Class of Regular Behaviours (1984) (363)
Operational and Algebraic Semantics of Concurrent Processes (1991) (361)
An Action Structure for Synchronous pi-Calculus (1993) (348)
Edinburgh lcf: a mechanized logic of computation (1978) (320)
Mathematical Centre Tracts (1976) (317)
The Space and Motion of Communicating Agents (2009) (315)
A proposal for standard ML (1984) (303)
Modal Logics for Mobile Processes (1991) (293)
Elements of interaction: Turing award lecture (1993) (253)
Deriving Bisimulation Congruences for Reactive Systems (2000) (249)
Commentary on standard ML (1990) (218)
The Problem of "Weak Bisimulation up to" (1992) (191)
Concurrent Processes and Their Syntax (1979) (190)
A Complete Axiomatisation for Observational Congruence of Finite-State Behaviors (1989) (184)
Pure bigraphs: Structure and dynamics (2006) (180)
Edinburgh LCF (1979) (173)
Co-Induction in Relational Semantics (1991) (172)
A Modal Characterisation of Observable Machine-Behaviour (1981) (169)
A Metalanguage for interactive proof in LCF (1978) (167)
Processes: A Mathematical Model of Computing Agents (1975) (163)
Bigraphs and mobile processes (revised) (2004) (146)
Stochastic Bigraphs (2008) (123)
Bigraphs and transitions (2003) (118)
Implementation and applications of Scott's logic for computable functions (1972) (114)
Lectures on a Calculus for Communicating Systems (1984) (111)
A semantics for ML concurrency primitives (1992) (108)
Calculi for interaction (1996) (108)
Logic for Computable Functions: description of a machine implementation. (1972) (106)
Flowgraphs and Flow Algebras (1979) (105)
Handbook of Theoretical Computer Science (Vol. B) (1990) (102)
Action Calculi, or Syntactic Action Structures (1993) (97)
Journeys in non-classical computation I: A grand challenge for computing research (2005) (89)
Unique decomposition of processes (1993) (88)
Local Bigraphs and Confluence: Two Conjectures: (Extended Abstract) (2007) (87)
A Theoretical Basis of Communication-Centred Concurrent Programming (2005) (85)
Elements of interaction (1993) (85)
The definition of standard ML, Version 3 (1988) (83)
Grand Challenges for Computing Research (2005) (81)
Axioms for bigraphical structure (2005) (79)
Bigraphs and Their Algebra (2008) (79)
The Flux of Interaction (2001) (74)
Proving compiler correctness in a mechanised logic (1972) (72)
Transition systems, link graphs and Petri nets (2006) (69)
Bigraphs for Petri Nets (2003) (63)
Control structures (1995) (59)
Bigraphical reactive systems: basic theory (2001) (59)
On relating synchrony and asynchrony (1980) (53)
A Finite Delay Operator in Synchronous CCS. (1982) (53)
LCF: A Way of Doing Proofs with a Machine (1979) (51)
The use of machines to assist in rigorous proof (1984) (51)
Synthesis of Communicating Behaviour (1978) (51)
Journeys in non-classical computation II: initial journeys and waypoints (2006) (47)
Pi-Nets: A Graphical Form of pi-Calculus (1994) (47)
Bigraphs and mobile processes (2003) (47)
Models of LCF. (1973) (44)
Ubiquitous Computing: Shall we Understand It? (2006) (44)
Matching of Bigraphs (2007) (43)
Standard ML: Report ECS-LFCS-86-2 (1986) (40)
Bigraphs whose names have multiple locality (2004) (38)
Ubiquitous Computing: Experience, Design and Science (2006) (38)
Verifying a Protocol Using Relativized Bisimulation (1987) (38)
A Type Discipline for Program Modules (1987) (37)
An Approach to the Semantics of Parallel Programs (1973) (34)
The definition of standard ML Version 2: LFCS report ECS-LFCS-88-62 (1988) (33)
A Logic for Computable Functions with Reflexive and Polymorphic Types (1975) (32)
A Compositional Protocol Verification Using Relativized Bisimulation (1992) (31)
Turing, Computing and Communication (2006) (29)
Action Structures (1992) (29)
The Polyadic Pi-calculus (Abstract) (1992) (28)
Computing Tomorrow: Future Research Directions in Computer Science (1997) (25)
Science for Global Ubiquitous Computing (2004) (23)
Is Computing an Experimental Science? (1987) (23)
Contexts and embeddings for closed shallow action graphs (2000) (21)
Action Structures and the Pi Calculus (1995) (21)
Bigraphs and mobile processes (revised): Technical report 580 (2004) (19)
Four combinators for concurrency (1982) (19)
Action calculi V: Reflexive molecular forms (1993) (19)
An interview with Robin Milner (1993) (19)
Pure bigraphs (1993) (19)
Semantic ideas in computing (1997) (19)
Higher-Order Action Calculi (1993) (18)
The Pi calculus and its applications (1998) (17)
Program Semantics and mechanized proof (1976) (16)
Calculi for interaction (1996) (16)
Scientific Foundation for Global Computing (2006) (15)
On using Edinburgh LCF to prove the correctness of a parsing algorithm (1982) (14)
An inductive characterization of matching in binding bigraphs (2013) (14)
Algebras for communicating systems (1978) (14)
Equivalences on Program Schemes (1970) (13)
Editors' note: bibliometrics and the curators of orthodoxy (2009) (13)
Control Flow and Data Flow: Concepts of Distributed Programming (1987) (12)
Action structures: LFCS report ECS-LFCS-92-249 (1992) (11)
Computing is Interaction (1994) (11)
Computational flux (2001) (10)
Bigraphs as a Model for Mobile Interaction (2002) (10)
The Pi Calculus and Its Applications (Keynote Address) (1998) (9)
Interpreting one Concurrent Calculus in Another (1990) (9)
A calculus for the mathematical theory of computation (1972) (9)
An Algebraic Theory for Synchronization (1979) (8)
Nanotechnology: opportunities and challenges (2004) (7)
How ML evlolved (1982) (7)
Program semantics and correctness in a mechanised logic (1972) (7)
Program schemes and recursive function theory (1969) (7)
Process Constructors and Interpretations (Invited Paper) (1986) (6)
Shallow Linear Action Graphs and their Embeddings (2002) (6)
The tower of informatic models (2008) (6)
The variety of process algebra (DRAFT) (1991) (5)
The semantics of standard LM Version 1: LFCS report ECS-LFCS-87-36 (1987) (5)
The Spectra of Words (2005) (5)
From Semantics to Computer Science: The tower of informatic models (2009) (4)
Dialogue with a Proof System (1987) (4)
Action calculi IV: molecular forms (1993) (4)
Axioms for biographical structure (2004) (4)
CONCUR 2000 — Concurrency Theory (2000) (4)
Unfolding CSP (2010) (3)
Bigraphical reactive systems: basic theory: Technical Report 523 (2001) (3)
Seminar on Concurrency (1984) (3)
Graphical Calculi for Interaction (Abstract) (1997) (3)
Parallel Combinator Reduction Machine (1983) (3)
Embeddings and Contexts for Link Graphs (2005) (3)
Firing Squad (1983) (3)
Bigraphical Categories (2009) (3)
Pervasive Process Calculus (2006) (3)
What Is An Object? (1991) (3)
Strong Normalisation in Higher-Order Action Calculi (1997) (3)
Using algebra for concurrency (1984) (2)
Action calculi III: Higher-order calculi (1993) (2)
Theories for Ubiquitous Processes and Data Platform for a 15-year Grand Challenge (2002) (2)
Lecture notes on Bigraphs : a Model for Mobile Agents (2009) (2)
How ML Evolved (2014) (2)
Understanding ubiquitous computing (2008) (2)
8 Conclusions and Future Work (1996) (2)
The Space and Motion of Communicating Agents: Behavioural theory for CCS (2009) (1)
Seminar notes on developments in bigraphs (2009) (1)
Closing Remarks (1987) (1)
Bigraphs and mobile processs: Technical Report 570 (2003) (1)
Transitions, link graphs and peti nets (2004) (1)
Using Algebra for Concurrency: Some Approaches (1983) (1)
An Action Structure for Synchronous-Calculus (1993) (1)
String Handling in ALGOL (1968) (1)
Some Directions in Concurrency Theory (1988) (1)
Action Structures for the -Calculus (2005) (1)
Transitions, link graphs and peti nets: Technical report 598 (2004) (1)
Concurrent Processes as Objects (1992) (1)
IJCSLP: Proceedings of the 1998 Joint International Conference and Symposium on Logic Programming (1998) (1)
6. Communication trees (CTs) as a model of CCS (1980) (1)
The Space and Motion of Communicating Agents: Bigraphical reactive systems (2009) (1)
Co-induction in semantics relational (1991) (1)
LCF: A methodology for performing rigorous proofs about programs (Invited Paper) (1976) (1)
5. Syntax and semantics of CCS (1980) (1)
Review: J. W. de Bakker, Recursive Procedures (1975) (1)
Concurrent Processes as Objects (Abstract) (1991) (1)
The Space and Motion of Communicating Agents: Reactions and transitions (2009) (0)
Computing Tomorrow: Preface (1996) (0)
Static Semantics for the Core (1997) (0)
4. Case studies in value-communication (1980) (0)
Syntax of the Core (1997) (0)
Foreword by Robin Milner (2004) (0)
Proof of the Subject Reduction Property for a -calculus in Coq Proof of the Subject Reduction Property for a -calculus in Coq Thhme 1 Rrseaux Et Systtmes Projet Meije (1999) (0)
Logic colloquium '73: proceedings of the Logic Colloquium, Bristol, July 1973 (1975) (0)
Workshop on Towers of Models co-located with TOOLS Europe Proceedings (2007) (0)
The Space and Motion of Communicating Agents: Background, development and related work (2009) (0)
Appendix: The Initial Static Basis (1997) (0)
Appendix: Derived Forms (1997) (0)
Bigraphs whose names have multiple locality Robin Milner (1993) (0)
Relative and minimal bounds (2009) (0)
Foundations of Concurrent Object-Oriented Programming (Panel) (1990) (0)
The Space and Motion of Communicating Agents: Bigraphical structure (2009) (0)
Explorer A Compositional Protocol Verification Using Relativized (2017) (0)
C Proof of Theorem 4 . 1 a Proof of Theorem 3 . 1 (1994) (0)
Proceedings of 1st Italian Conference on Theoretical Computer Science (ICTCS), Pisa, 1972 (1973) (0)
3. A case study in synchronization and proof techniques (1980) (0)
Appendix: The Initial Dynamic Basis (1997) (0)
Introduction (1988) (0)
The tower of informatics models (2009) (0)
The Space and Motion of Communicating Agents: Defining bigraphs (2009) (0)
Some Uses of Maximal Fixed Points (Abstract of Invited Lecture) (1987) (0)
Control Structures: a Model of Interaction (1995) (0)
Panel: What is an object?: Object-Based Concurrent Computing (1992) (0)
7. Observation equivalence and its properties (1980) (0)
9. Translation into CCS (1980) (0)
Towards a Broader Theory of Mobile Processes (2004) (0)
Closing Remarks (1989) (0)
Stochastic Bigraphs 1 (2008) (0)
The Space and Motion of Communicating Agents: The idea of bigraphs (2009) (0)
Dynamic Semantics for Modules (1997) (0)
The semantics of standard LM Version 1 (1987) (0)
Appendix: Full Grammar (1997) (0)
What purpose is served by a concept of process ? (2009) (0)
Solutions to exercises (2009) (0)
Explorer Local Bigraphs and Confluence : Two Conjectures : ( Extended (2015) (0)
Computation in the Informatic Jungle Draft (2010) (0)
Appendix: What is New? (1997) (0)
Behaviour in link graphs (2009) (0)
Dynamic Semantics for the Core (1997) (0)
Computing Tomorrow: References (1996) (0)
Graphical Theories of Interactive Systems: Can a Proof Assistant Help? (2000) (0)
Robin Milner: 13 January 1934–20 March 2010 (2010) (0)
1. Experimenting on nondeterministic machines (1980) (0)
Computation in the Informatic Jungle Extended abstract (2010) (0)
Syntax of Modules (1997) (0)
Explorer Equivalences on program schemes (0)
A semantics for ML concurrency (1992) (0)
Summary (1988) (0)
Automata, languages, and programming : third international colloquium at the University of Edinburgh (1976) (0)
Static Semantics for Modules (1997) (0)
Axioms for biographical structure: Technical report 581 (2004) (0)
Introduction (1987) (0)
Glossary of terms and symbols (2009) (0)
8. Some proofs about data structures (1980) (0)
Categories, Software and Meaning (2008) (0)
13 Semantic Ideas in Computing (2009) (0)
Keynote: The Space and Motion of Large Informatic Systems (2008) (0)
The Space and Motion of Communicating Agents: Algebra for bigraphs (2009) (0)
An inductive characterization of matching in binding bigraphs (2011) (0)
Discussant of Response to the Computer Journal Lecture by Morris Sloman (2010) (0)
Action Calculi VI: Strong normalisation at higher order (1993) (0)
Action structires for the π-calculus (1993) (0)
Pi-nets: a graphica l form of 7r-calculus 1 (2005) (0)
10. Determinancy and confluence (1980) (0)
report on EPSRC Grant GR / L 62290 / 01 ( 01 / 07 / 98 – 30 / 06 / 01 ) Calculi for Interactive Systems : Theory and Experiment (2001) (0)

This paper list is powered by the following services:

Other Resources About Robin Milner

en.wikipedia.org

What Schools Are Affiliated With Robin Milner?

Robin Milner is affiliated with the following schools:

Robin Milner's Academic­Influence.com Rankings