We stand with Ukraine

We stand with Ukraine

Robin Milner

According to our database¹, Robin Milner authored at least 102 papers between 1968 and 2013.

Collaborative distances:

Dijkstra number² of two.
Erdős number³ of four.

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

Dataset

Other

Links

Online presence:

On csauthors.net:

Bibliography

2013

An inductive characterization of matching in binding bigraphs.

[BibT_eX]

[DOI]

Troels Christoffer Damgaard

,

Arne J. Glenstrup

,

,

Formal Aspects Comput., 2013

2010

Discussant of Response to the <i>Computer Journal Lecture</i> by Morris Sloman.

[BibT_eX]

[DOI]

Comput. J., 2010

Unfolding CSP.

[BibT_eX]

[DOI]

Mikkel Bundgaard

,

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

2009

Bigraphical Categories.

[BibT_eX]

[DOI]

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

The Space and Motion of Communicating Agents.

[BibT_eX]

Cambridge University Press, ISBN: 978-0-521-73833-0, 2009

2008

Stochastic Bigraphs.

[BibT_eX]

[DOI]

,

,

Proceedings of the 24th Conference on the Mathematical Foundations of Programming Semantics, 2008

Categories, Software and Meaning.

[BibT_eX]

[DOI]

Proceedings of the Concurrency, 2008

Keynote: The Space and Motion of Large Informatic Systems.

[BibT_eX]

[DOI]

Proceedings of the Visions of Computer Science, 2008

2006

Scientific Foundation for Global Computing.

[BibT_eX]

[DOI]

Trans. Comp. Sys. Biology, 2006

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

[BibT_eX]

[DOI]

,

Samuel L. Braunstein

,

,

Andrew M. Tyrrell

,

Andrew Adamatzky

,

Robert E. Smith

,

Thomas R. Addis

,

Colin G. Johnson

,

Jonathan Timmis

,

,

,

Derek Partridge

Int. J. Parallel Emergent Distributed Syst., 2006

Transition systems, link graphs and Petri nets.

[BibT_eX]

[DOI]

James J. Leifer

,

Math. Struct. Comput. Sci., 2006

Pure bigraphs: Structure and dynamics.

[BibT_eX]

[DOI]

Inf. Comput., 2006

Bigraphs and Their Algebra.

[BibT_eX]

[DOI]

Proceedings of the LIX Colloquium on Emerging Trends in Concurrency Theory, 2006

Local Bigraphs and Confluence: Two Conjectures: (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the 13th International Workshop on Expressiveness in Concurrency, 2006

Matching of Bigraphs.

[BibT_eX]

[DOI]

,

Troels Christoffer Damgaard

,

Arne J. Glenstrup

,

Proceedings of the Workshop on Graph Transformation for Concurrency and Verification, 2006

Ubiquitous Computing: Shall we Understand It?

[BibT_eX]

[DOI]

Comput. J., 2006

2005

Journeys in non-classical computation I: A grand challenge for computing research.

[BibT_eX]

[DOI]

,

Samuel L. Braunstein

,

,

Andrew M. Tyrrell

,

Andrew Adamatzky

,

Robert E. Smith

,

,

Colin G. Johnson

,

Jonathan Timmis

,

,

,

Derek Partridge

Parallel Algorithms Appl., 2005

Axioms for bigraphical structure.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2005

Pervasive Process Calculus.

[BibT_eX]

[DOI]

Proceedings of the Workshop "Essays on Algebraic Process Calculi", 2005

Grand Challenges for Computing Research.

[BibT_eX]

[DOI]

,

Comput. J., 2005

The Spectra of Words.

[BibT_eX]

[DOI]

Proceedings of the Processes, 2005

Embeddings and Contexts for Link Graphs.

[BibT_eX]

[DOI]

Proceedings of the Formal Methods in Software and Systems Modeling, 2005

2004

Towards a Broader Theory of Mobile Processes.

[BibT_eX]

[DOI]

Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

Theories for the Global Ubiquitous Computer.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2004

2003

Bigraphs and transitions.

[BibT_eX]

[DOI]

Ole Høgh Jensen

,

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

Bigraphs for Petri Nets.

[BibT_eX]

[DOI]

Proceedings of the Lectures on Concurrency and Petri Nets, 2003

2002

Shallow Linear Action Graphs and their Embeddings.

[BibT_eX]

[DOI]

James J. Leifer

,

Formal Aspects Comput., 2002

Bigraphs as a Model for Mobile Interaction.

[BibT_eX]

[DOI]

Proceedings of the Graph Transformation, First International Conference, 2002

2001

Computational flux.

[BibT_eX]

[DOI]

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

Bigraphical Reactive Systems.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2001, 2001

The Flux of Interaction.

[BibT_eX]

[DOI]

Proceedings of the Application and Theory of Petri Nets 2001, 2001

2000

Graphical Theories of Interactive Systems: Can a Proof Assistant Help?

[BibT_eX]

[DOI]

Proceedings of the Theorem Proving in Higher Order Logics, 13th International Conference, 2000

Deriving Bisimulation Congruences for Reactive Systems.

[BibT_eX]

[DOI]

James J. Leifer

,

Proceedings of the CONCUR 2000, 2000

1999

Communicating and mobile systems - the Pi-calculus.

[BibT_eX]

Cambridge University Press, ISBN: 978-0-521-65869-0, 1999

1998

The Pi Calculus and Its Applications (Keynote Address).

[BibT_eX]

Proceedings of the 1998 Joint International Conference and Symposium on Logic Programming, 1998

1997

Strong Normalisation in Higher-Order Action Calculi.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Aspects of Computer Software, Third International Symposium, 1997

Graphical Calculi for Interaction (Abstract).

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

1996

Calculi for Interaction.

[BibT_eX]

[DOI]

Acta Informatica, 1996

1995

Control Structures

[BibT_eX]

[DOI]

,

,

Proceedings of the Proceedings, 1995

Control Structures: a Model of Interaction.

[BibT_eX]

[DOI]

Proceedings of the Category Theory and Computer Science, 6th International Conference, 1995

1994

Computing is Interaction.

[BibT_eX]

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.

[BibT_eX]

[DOI]

Proceedings of the Programming Languages and Systems, 1994

1993

Modal Logics for Mobile Processes.

[BibT_eX]

[DOI]

,

,

Theor. Comput. Sci., 1993

Unique Decomposition of Processes.

[BibT_eX]

[DOI]

,

Theor. Comput. Sci., 1993

Elements of Interaction - Turing Award Lecture.

[BibT_eX]

[DOI]

Commun. ACM, 1993

An Interview with Robin Milner.

[BibT_eX]

[DOI]

Karen A. Frenkel

,

Commun. ACM, 1993

Action Calculi, or Syntactic Action Structures.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

An Action Structure for Synchronous pi-Calculus.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 9th International Symposium, 1993

Higher-Order Action Calculi.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 7th Workshop, 1993

1992

A Calculus of Mobile Processes, II

[BibT_eX]

[DOI]

,

,

Inf. Comput., September, 1992

A Calculus of Mobile Processes, I

[BibT_eX]

[DOI]

,

,

Inf. Comput., September, 1992

A Compositional Protocol Verification Using Relativized Bisimulation

[BibT_eX]

[DOI]

Kim Guldstrand Larsen

,

Inf. Comput., July, 1992

Functions as Processes.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 1992

Concurrent Processes as Objects.

[BibT_eX]

[DOI]

Proceedings of the 5th Refinement Workshop, 1992

A Semantics for ML Concurrency Primitives.

[BibT_eX]

[DOI]

,

,

David N. Turner

Proceedings of the Conference Record of the Nineteenth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1992

Barbed Bisimulation.

[BibT_eX]

[DOI]

,

Davide Sangiorgi

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

The Problem of "Weak Bisimulation up to".

[BibT_eX]

[DOI]

Davide Sangiorgi

,

Proceedings of the CONCUR '92, 1992

The Polyadic Pi-calculus (Abstract).

[BibT_eX]

[DOI]

Proceedings of the CONCUR '92, 1992

1991

Co-Induction in Relational Semantics.

[BibT_eX]

[DOI]

,

Theor. Comput. Sci., 1991

Concurrent Processes as Objects (Abstract).

[BibT_eX]

[DOI]

Proceedings of the VDM '91, 1991

What Is An Object?

[BibT_eX]

[DOI]

,

,

Oscar Nierstrasz

,

,

Akinori Yonezawa

Proceedings of the Object-Based Concurrent Computing, 1991

Commentary on standard ML.

[BibT_eX]

,

MIT Press, ISBN: 978-0-262-63137-2, 1991

1990

Interpreting one Concurrent Calculus in Another.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1990

Foundations of Concurrent Object-Oriented Programming (Panel).

[BibT_eX]

,

Samson Abramsky

,

,

,

,

Akinori Yonezawa

Proceedings of the Conference on Object-Oriented Programming Systems, 1990

Operational and Algebraic Semantics of Concurrent Processes.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Theoretical Computer Science, 1990

Definition of standard ML.

[BibT_eX]

,

,

MIT Press, ISBN: 978-0-262-63132-7, 1990

1989

A Complete Axiomatisation for Observational Congruence of Finite-State Behaviors

[BibT_eX]

[DOI]

Inf. Comput., May, 1989

Communication and concurrency.

[BibT_eX]

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

1988

Some Directions in Concurrency Theory.

[BibT_eX]

Proceedings of the International Conference on Fifth Generation Computer Systems, 1988

1987

Is Computing an Experimental Science?

[BibT_eX]

[DOI]

J. Inf. Technol., 1987

Dialogue with a Proof System.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

,

,

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)

[BibT_eX]

Proceedings of the Symposium on Logic in Computer Science (LICS '87), 1987

Verifying a Protocol Using Relativized Bisimulation.

[BibT_eX]

[DOI]

Kim Guldstrand Larsen

,

Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987

1986

Process Constructors and Interpretations (Invited Paper).

[BibT_eX]

Proceedings of the Information Processing 86, 1986

1985

Algebraic Laws for Nondeterminism and Concurrency

[BibT_eX]

[DOI]

Matthew Hennessy

,

J. ACM, January, 1985

1984

A Complete Inference System for a Class of Regular Behaviours.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1984

A Proposal for Standard ML.

[BibT_eX]

[DOI]

Proceedings of the 1984 ACM Conference on LISP and Functional Programming, 1984

Lectures on a Calculus for Communicating Systems.

[BibT_eX]

[DOI]

Proceedings of the Seminar on Concurrency, 1984

1983

Calculi for Synchrony and Asynchrony.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1983

Firing Squad.

[BibT_eX]

[DOI]

Proceedings of the Analysis of Concurrent Systems, 1983

Parallel Combinator Reduction Machine.

[BibT_eX]

[DOI]

Proceedings of the Analysis of Concurrent Systems, 1983

Using Algebra for Concurrency: Some Approaches.

[BibT_eX]

[DOI]

Proceedings of the Analysis of Concurrent Systems, 1983

1982

Principal Type-Schemes for Functional Programs.

[BibT_eX]

[DOI]

,

Proceedings of the Conference Record of the Ninth Annual ACM Symposium on Principles of Programming Languages, 1982

Four Combinators for Concurrency.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 1982

1981

A Modal Characterisation of Observable Machine-Behaviour.

[BibT_eX]

[DOI]

Proceedings of the CAAP '81, 1981

1980

On Observing Nondeterminism and Concurrency.

[BibT_eX]

[DOI]

Matthew Hennessy

,

Proceedings of the Automata, 1980

A Calculus of Communicating Systems

[BibT_eX]

[DOI]

Lecture Notes in Computer Science 92, Springer, ISBN: 3-540-10235-3, 1980

1979

Flowgraphs and Flow Algebras.

[BibT_eX]

[DOI]

J. ACM, 1979

Concurrent Processes and Their Syntax.

[BibT_eX]

[DOI]

George J. Milne

,

J. ACM, 1979

An Algebraic Theory for Synchronization.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 1979

LCF: A Way of Doing Proofs with a Machine.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1979, 1979

Edinburgh LCF

[BibT_eX]

[DOI]

Michael J. C. Gordon

,

,

Christopher P. Wadsworth

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

1978

A Theory of Type Polymorphism in Programming.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1978

A Metalanguage for Interactive Proof in LCF.

[BibT_eX]

[DOI]

Michael J. C. Gordon

,

,

F. Lockwood Morris

,

Malcolm C. Newey

,

Christopher P. Wadsworth

Proceedings of the Conference Record of the Fifth Annual ACM Symposium on Principles of Programming Languages, 1978

Synthesis of Communicating Behaviour.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1978, 1978

1977

Fully Abstract Models of Typed <i>lambda</i>-Calculi.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1977

1972

Implementation and applications of Scott's logic for computable functions.

[BibT_eX]

[DOI]

Proceedings of ACM Conference on Proving Assertions About Programs, 1972

A calculus for the mathematical theory of computation.

[BibT_eX]

[DOI]

Proceedings of the International Sympoisum on Theoretical Programming, 1972

1971

An Algebraic Definition of Simulation Between Programs.

[BibT_eX]

[DOI]

Proceedings of the 2nd International Joint Conference on Artificial Intelligence. London, 1971

1970

Equivalences on Program Schemes.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1970

1968

String Handling in ALGOL.

[BibT_eX]

[DOI]

Comput. J., 1968

Loading...