Robin Milner

According to our database1, Robin Milner authored at least 103 papers between 1970 and 2013.

Collaborative distances:

Awards

Turing Prize recipient

Turing Prize 1991, "For three distinct and complete achievements: 1) LCF theorem prover|LCF, the mechanization of Scott's Logic of Computable Functions, probably the first theoretically based yet practical tool for automated theorem proving|machine assisted proof construction; 2) ML programming language|ML, the first language to include polymorphic type inference together with a type safety|type-safe exception handling|exception-handling mechanism; 3) calculus of communicating systems|CCS, a general theory of concurrency (computer science)|concurrency. In addition, he formulated and strongly advanced full abstraction, the study of the relationship between operational semantics|operational and denotational semantics|denotational semantics.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2013
An inductive characterization of matching in binding bigraphs.
Formal Asp. Comput., 2013

2010
Discussant of Response to the Computer Journal Lecture by Morris Sloman.
Comput. J., 2010

Unfolding CSP.
Proceedings of the Reflections on the Work of C. A. R. Hoare., 2010

2009
Bigraphical Categories.
Proceedings of the CONCUR 2009 - Concurrency Theory, 20th International Conference, 2009

The Space and Motion of Communicating Agents.
Cambridge University Press, ISBN: 978-0-521-73833-0, 2009

2008
Bigraphs and Their Algebra.
Electr. Notes Theor. Comput. Sci., 2008

Stochastic Bigraphs.
Electr. Notes Theor. Comput. Sci., 2008

Categories, Software and Meaning.
Proceedings of the Concurrency, 2008

Keynote: The Space and Motion of Large Informatic Systems.
Proceedings of the Visions of Computer Science, 2008

2007
Local Bigraphs and Confluence: Two Conjectures: (Extended Abstract).
Electr. Notes Theor. Comput. Sci., 2007

Matching of Bigraphs.
Electr. Notes Theor. Comput. Sci., 2007

2006
Scientific Foundation for Global Computing.
, 2006

Journeys in non-classical computation II: initial journeys and waypoints.
IJPEDS, 2006

Transition systems, link graphs and Petri nets.
Mathematical Structures in Computer Science, 2006

Pure bigraphs: Structure and dynamics.
Inf. Comput., 2006

Pervasive Process Calculus.
Electr. Notes Theor. Comput. Sci., 2006

Ubiquitous Computing: Shall we Understand It?
Comput. J., 2006

2005
Journeys in non-classical computation I: A grand challenge for computing research.
Parallel Algorithms Appl., 2005

Axioms for bigraphical structure.
Mathematical Structures in Computer Science, 2005

Grand Challenges for Computing Research.
Comput. J., 2005

The Spectra of Words.
Proceedings of the Processes, 2005

Embeddings and Contexts for Link Graphs.
Proceedings of the Formal Methods in Software and Systems Modeling, 2005

2004
Towards a Broader Theory of Mobile Processes.
Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

Theories for the Global Ubiquitous Computer.
Proceedings of the Foundations of Software Science and Computation Structures, 2004

2003
Bigraphs and transitions.
Proceedings of the Conference Record of POPL 2003: The 30th SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2003

Bigraphs for Petri Nets.
Proceedings of the Lectures on Concurrency and Petri Nets, 2003

2002
Shallow Linear Action Graphs and their Embeddings.
Formal Asp. Comput., 2002

Bigraphs as a Model for Mobile Interaction.
Proceedings of the Graph Transformation, First International Conference, 2002

2001
Computational flux.
Proceedings of the Conference Record of POPL 2001: The 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2001

Bigraphical Reactive Systems.
Proceedings of the CONCUR 2001, 2001

The Flux of Interaction.
Proceedings of the Application and Theory of Petri Nets 2001, 2001

2000
Graphical Theories of Interactive Systems: Can a Proof Assistant Help?
Proceedings of the Theorem Proving in Higher Order Logics, 13th International Conference, 2000

Deriving Bisimulation Congruences for Reactive Systems.
Proceedings of the CONCUR 2000, 2000

1999
Communicating and mobile systems - the Pi-calculus.
Cambridge University Press, ISBN: 978-0-521-65869-0, 1999

1998
The Pi Calculus and Its Applications (Keynote Address).
Proceedings of the 1998 Joint International Conference and Symposium on Logic Programming, 1998

1997
Strong Normalisation in Higher-Order Action Calculi.
Proceedings of the Theoretical Aspects of Computer Software, Third International Symposium, 1997

Graphical Calculi for Interaction (Abstract).
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

1996
Calculi for Interaction.
Acta Inf., 1996

1995
Control Structures
Proceedings of the Proceedings, 1995

Control Structures: a Model of Interaction.
Proceedings of the Category Theory and Computer Science, 6th International Conference, 1995

1994
Computing is Interaction.
Proceedings of the Technology and Foundations - Information Processing '94, Volume 1, Proceedings of the IFIP 13th World Computer Congress, Hamburg, Germany, 28 August, 1994

Pi-Nets: A Graphical Form of pi-Calculus.
Proceedings of the Programming Languages and Systems, 1994

1993
Modal Logics for Mobile Processes.
Theor. Comput. Sci., 1993

Unique Decomposition of Processes.
Theor. Comput. Sci., 1993

Elements of Interaction - Turing Award Lecture.
Commun. ACM, 1993

An Interview with Robin Milner.
Commun. ACM, 1993

Action Calculi, or Syntactic Action Structures.
Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

An Action Structure for Synchronous pi-Calculus.
Proceedings of the Fundamentals of Computation Theory, 9th International Symposium, 1993

Higher-Order Action Calculi.
Proceedings of the Computer Science Logic, 7th Workshop, 1993

1992
A Calculus of Mobile Processes, II
Inf. Comput., September, 1992

A Calculus of Mobile Processes, I
Inf. Comput., September, 1992

A Compositional Protocol Verification Using Relativized Bisimulation
Inf. Comput., July, 1992

Functions as Processes.
Mathematical Structures in Computer Science, 1992

A Semantics for ML Concurrency Primitives.
Proceedings of the Conference Record of the Nineteenth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1992

Barbed Bisimulation.
Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992

The Problem of "Weak Bisimulation up to".
Proceedings of the CONCUR '92, 1992

The Polyadic Pi-calculus (Abstract).
Proceedings of the CONCUR '92, 1992

1991
Co-Induction in Relational Semantics.
Theor. Comput. Sci., 1991

Concurrent Processes as Objects (Abstract).
Proceedings of the VDM '91, 1991

What Is An Object?
Proceedings of the Object-Based Concurrent Computing, 1991

Modal Logics for Mobile Processes.
Proceedings of the CONCUR '91, 1991

Commentary on standard ML.
MIT Press, ISBN: 978-0-262-63137-2, 1991

1990
Interpreting one Concurrent Calculus in Another.
Theor. Comput. Sci., 1990

Unique decomposition of processes.
Bulletin of the EATCS, 1990

Foundations of Concurrent Object-Oriented Programming (Panel).
Proceedings of the Conference on Object-Oriented Programming Systems, 1990

Functions as Processes.
Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990

Operational and Algebraic Semantics of Concurrent Processes.
Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B), 1990

Definition of standard ML.
MIT Press, ISBN: 978-0-262-63132-7, 1990

1989
A Complete Axiomatisation for Observational Congruence of Finite-State Behaviors
Inf. Comput., May, 1989

Communication and concurrency.
PHI Series in computer science, Prentice Hall, ISBN: 978-0-13-115007-2, 1989

1988
Interpreting One Concurrent Calculus in Another.
FGCS, 1988

Some Directions in Concurrency Theory.
FGCS, 1988

1987
Is Computing an Experimental Science?
JIT, 1987

Dialogue with a Proof System.
Proceedings of the TAPSOFT'87: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1987

A Type Discipline for Program Modules.
Proceedings of the TAPSOFT'87: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1987

Some Uses of Maximal Fixed Points (Abstract of Invited Lecture)
Proceedings of the Symposium on Logic in Computer Science (LICS '87), 1987

Verifying a Protocol Using Relativized Bisimulation.
Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987

1986
Process Constructors and Interpretations (Invited Paper).
IFIP Congress, 1986

1985
Algebraic Laws for Nondeterminism and Concurrency
J. ACM, January, 1985

1984
A Complete Inference System for a Class of Regular Behaviours.
J. Comput. Syst. Sci., 1984

A Proposal for Standard ML.
LISP and Functional Programming, 1984

Lectures on a Calculus for Communicating Systems.
Proceedings of the Seminar on Concurrency, 1984

1983
Calculi for Synchrony and Asynchrony.
Theor. Comput. Sci., 1983

Firing Squad.
Proceedings of the Analysis of Concurrent Systems, 1983

Parallel Combinator Reduction Machine.
Proceedings of the Analysis of Concurrent Systems, 1983

Using Algebra for Concurrency: Some Approaches.
Proceedings of the Analysis of Concurrent Systems, 1983

1982
Principal Type-Schemes for Functional Programs.
Proceedings of the Conference Record of the Ninth Annual ACM Symposium on Principles of Programming Languages, 1982

Four Combinators for Concurrency.
Proceedings of the ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 1982

1981
A Modal Characterisation of Observable Machine-Behaviour.
Proceedings of the CAAP '81, 1981

1980
On Observing Nondeterminism and Concurrency.
Proceedings of the Automata, 1980

A Calculus of Communicating Systems
Lecture Notes in Computer Science 92, Springer, ISBN: 3-540-10235-3, 1980

1979
Flowgraphs and Flow Algebras.
J. ACM, 1979

Concurrent Processes and Their Syntax.
J. ACM, 1979

An Algebraic Theory for Synchronization.
Proceedings of the Theoretical Computer Science, 1979

LCF: A Way of Doing Proofs with a Machine.
Proceedings of the Mathematical Foundations of Computer Science 1979, 1979

Edinburgh LCF
Lecture Notes in Computer Science 78, Springer, ISBN: 3-540-09724-4, 1979

1978
A Theory of Type Polymorphism in Programming.
J. Comput. Syst. Sci., 1978

A Metalanguage for Interactive Proof in LCF.
Proceedings of the Conference Record of the Fifth Annual ACM Symposium on Principles of Programming Languages, 1978

Synthesis of Communicating Behaviour.
Proceedings of the Mathematical Foundations of Computer Science 1978, 1978

1977
Fully Abstract Models of Typed lambda-Calculi.
Theor. Comput. Sci., 1977

1972
A calculus for the mathematical theory of computation.
Proceedings of the International Sympoisum on Theoretical Programming, 1972

1971
An Algebraic Definition of Simulation Between Programs.
Proceedings of the 2nd International Joint Conference on Artificial Intelligence. London, 1971

1970
Equivalences on Program Schemes.
J. Comput. Syst. Sci., 1970


  Loading...