Gordon D. Plotkin

According to our database, Gordon D. Plotkin authored at least 136 papers between 1974 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Polynomial Lawvere Logic.

Giorgio Bacci, Radu Mardare, Prakash Panangaden, Gordon D. Plotkin

CoRR, 2024

2023

Smart Choices and the Selection Monad.

Martín Abadi, Gordon D. Plotkin

Log. Methods Comput. Sci., 2023

Bidirectional Reactive Programming for Machine Learning.

Dumitru Potop-Butucaru, Albert Cohen, Gordon D. Plotkin, Hugo Pompougnac

CoRR, 2023

Propositional Logics for the Lawvere Quantale.

Giorgio Bacci, Radu Mardare, Prakash Panangaden, Gordon D. Plotkin

Proceedings of the 39th Conference on the Mathematical Foundations of Programming Semantics, 2023

2022

Sum and Tensor of Quantitative Effects.

Giorgio Bacci, Radu Mardare, Prakash Panangaden, Gordon D. Plotkin

CoRR, 2022

Recursion does not always help.

Gordon D. Plotkin

CoRR, 2022

2021

Fixed-Points for Quantitative Equational Logics.

Radu Mardare, Prakash Panangaden, Gordon D. Plotkin

Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

Tensor of Quantitative Equational Theories.

Giorgio Bacci, Radu Mardare, Prakash Panangaden, Gordon D. Plotkin

Proceedings of the 9th Conference on Algebra and Coalgebra in Computer Science, 2021

2020

A simple differentiable programming language.

Martín Abadi, Gordon D. Plotkin

Proc. ACM Program. Lang., 2020

A Complete Equational Axiomatisation of Partial Differentiation.

Gordon D. Plotkin

Proceedings of the 36th Conference on the Mathematical Foundations of Programming Semantics, 2020

Reverse Derivative Categories.

J. Robin B. Cockett, Geoff S. H. Cruttwell, Jonathan Gallagher, Jean-Simon Pacaud Lemay, Benjamin MacAdam, Gordon D. Plotkin, Dorette Pronk

Proceedings of the 28th EACSL Annual Conference on Computer Science Logic, 2020

2019

Chromar, a language of parameterised agents.

Ricardo Honorato-Zimmer, Andrew J. Millar, Gordon D. Plotkin, Argyris Zardilis

Theor. Comput. Sci., 2019

Programming and Reasoning with Algebraic Effects and Effect Handlers (NII Shonan Meeting 146).

Oleg Kiselyov, Sam Lindley, Gordon D. Plotkin, Nicolas Wu

NII Shonan Meet. Rep., 2019

2018

Free complete Wasserstein algebras.

Radu Mardare, Prakash Panangaden, Gordon D. Plotkin

Log. Methods Comput. Sci., 2018

Chromar, a Rule-based Language of Parameterised Objects.

Ricardo Honorato-Zimmer, Andrew J. Millar, Gordon D. Plotkin, Argyris Zardilis

Proceedings of SASB 2018, 2018

Initial Algebras and Final Coalgebras Consisting of Nondeterministic Finite Trace Strategies.

Nathan J. Bowler, Paul Blain Levy, Gordon D. Plotkin

Proceedings of the Thirty-Fourth Conference on the Mathematical Foundations of Programming Semantics, 2018

Alonzo Church Award 2018 - Call for Nominations.

Thomas Eiter, Javier Esparza, Catuscia Palamidessi, Gordon D. Plotkin, Natarajan Shankar

Bull. EATCS, 2018

An Algebraic Theory of Markov Processes.

Giorgio Bacci, Radu Mardare, Prakash Panangaden, Gordon D. Plotkin

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

2017

Alonzo Church Award 2017 - Call for Nominations.

Natarajan Shankar, Catuscia Palamidessi, Gordon D. Plotkin, Moshe Y. Vardi

Bull. EATCS, 2017

Mixed powerdomains for probability and nondeterminism.

Klaus Keimel, Gordon D. Plotkin

Log. Methods Comput. Sci., 2017

Dijkstra monads for free.

Danel Ahman, Catalin Hritcu, Kenji Maillard, Guido Martínez, Gordon D. Plotkin, Jonathan Protzenko, Aseem Rastogi, Nikhil Swamy

Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, 2017

On the axiomatizability of quantitative algebras.

Radu Mardare, Prakash Panangaden, Gordon D. Plotkin

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

2016

Dijkstra Monads for Free.

Danel Ahman, Catalin Hritcu, Guido Martínez, Gordon D. Plotkin, Jonathan Protzenko, Aseem Rastogi, Nikhil Swamy

CoRR, 2016

Scaling network verification using symmetry and surgery.

Gordon D. Plotkin, Nikolaj S. Bjørner, Nuno P. Lopes, Andrey Rybalchenko, George Varghese

Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2016

Quantitative Algebraic Reasoning.

Radu Mardare, Prakash Panangaden, Gordon D. Plotkin

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Dependent Types and Fibred Computational Effects.

Danel Ahman, Neil Ghani, Gordon D. Plotkin

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

Interacting with Large Distributed Datasets Using Sketch.

Mihai Budiu, Rebecca Isaacs, Derek Murray, Gordon D. Plotkin, Paul Barham, Samer Al-Kiswany, Yazan Boshmaf, Qingzhou Luo, Alexandr Andoni

Proceedings of the 16th Eurographics Symposium on Parallel Graphics and Visualization, 2016

2015

Foundations of Differential Dataflow.

Martín Abadi, Frank McSherry, Gordon D. Plotkin

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

2014

Cartesian closed categories of separable Scott domains.

Andrej Bauer, Gordon D. Plotkin, Dana S. Scott

Theor. Comput. Sci., 2014

Approximating Markov Processes by Averaging.

Philippe Chaput, Vincent Danos, Prakash Panangaden, Gordon D. Plotkin

J. ACM, 2014

On Hierarchical Graphs: Reconciling Bigraphs, Gs-monoidal Theories and Gs-graphs.

Roberto Bruni, Ugo Montanari, Gordon D. Plotkin, Daniele Terreni

Fundam. Informaticae, 2014

2013

Multi-level modelling via stochastic multi-level multiset rewriting.

Nicolas Oury, Gordon D. Plotkin

Math. Struct. Comput. Sci., 2013

Dedication.

Stephen Brookes, Benjamin C. Pierce, Gordon D. Plotkin, Dana S. Scott

Proceedings of the Twenty-ninth Conference on the Mathematical Foundations of Programming Semantics, 2013

Layout Randomization and Nondeterminism.

Martín Abadi, Jérémy Planul, Gordon D. Plotkin

Proceedings of the Twenty-ninth Conference on the Mathematical Foundations of Programming Semantics, 2013

Handling Algebraic Effects.

Gordon D. Plotkin, Matija Pretnar

Log. Methods Comput. Sci., 2013

The Compiler Forest.

Mihai Budiu, Joel Galenson, Gordon D. Plotkin

Proceedings of the Programming Languages and Systems, 2013

A Calculus of Chemical Systems.

Gordon D. Plotkin

Proceedings of the In Search of Elegance in the Theory and Practice of Computation, 2013

Partial Recursive Functions and Finality.

Gordon D. Plotkin

Proceedings of the Computation, Logic, Games, and Quantum Foundations. The Many Facets of Samson Abramsky, 2013

2012

On Protection by Layout Randomization.

Martín Abadi, Gordon D. Plotkin

ACM Trans. Inf. Syst. Secur., 2012

Algebraic foundations for effect-dependent optimisations.

Ohad Kammar, Gordon D. Plotkin

Proceedings of the 39th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2012

Concurrency and the Algebraic Theory of Effects - (Abstract).

Gordon D. Plotkin

Proceedings of the CONCUR 2012 - Concurrency Theory - 23rd International Conference, 2012

2011

Coloured stochastic multilevel multiset rewriting.

Nicolas Oury, Gordon D. Plotkin

Proceedings of the Computational Methods in Systems Biology, 9th International Conference, 2011

2010

A Language for Biochemical Systems: Design and Formal Specification.

Michael Pedersen, Gordon D. Plotkin

Trans. Comp. Sys. Biology, 2010

Obituary: Robin Milner (1934-2010).

Gordon D. Plotkin, Colin Stirling, Mads Tofte

Bull. EATCS, 2010

A Model of Cooperative Threads

Martín Abadi, Gordon D. Plotkin

Log. Methods Comput. Sci., 2010

On CSP and the Algebraic Theory of Effects

Rob J. van Glabbeek, Gordon D. Plotkin

CoRR, 2010

Robin Milner, a Craftsman of Tools for the Mind.

Gordon D. Plotkin

Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, 2010

On CSP and the Algebraic Theory of Effects.

Rob J. van Glabbeek, Gordon D. Plotkin

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

2009

Configuration structures, event structures and Petri nets.

Rob J. van Glabbeek, Gordon D. Plotkin

Theor. Comput. Sci., 2009

Predicate transformers for extended probability and non-determinism.

Klaus Keimel, Gordon D. Plotkin

Math. Struct. Comput. Sci., 2009

On the completeness of order-theoretic models of the lambda-calculus.

Furio Honsell, Gordon D. Plotkin

Inf. Comput., 2009

Handlers of Algebraic Effects.

Gordon D. Plotkin, Matija Pretnar

Proceedings of the Programming Languages and Systems, 2009

Adequacy for Infinitary Algebraic Effects (Abstract).

Gordon D. Plotkin

Proceedings of the Algebra and Coalgebra in Computer Science, 2009

Approximating Labelled Markov Processes Again!

Philippe Chaput, Vincent Danos, Prakash Panangaden, Gordon D. Plotkin

Proceedings of the Algebra and Coalgebra in Computer Science, 2009

2008

Tensors of Comodels and Models for Operational Semantics.

Gordon D. Plotkin, John Power

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

A Logic for Algebraic Effects.

Gordon D. Plotkin, Matija Pretnar

Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, 2008

A Language for Biochemical Systems.

Michael Pedersen, Gordon D. Plotkin

Proceedings of the Computational Methods in Systems Biology, 6th International Conference, 2008

Finite Dimensional Vector Spaces Are Complete for Traced Symmetric Monoidal Categories.

Masahito Hasegawa, Martin Hofmann, Gordon D. Plotkin

Proceedings of the Pillars of Computer Science, 2008

2007

Combining algebraic effects with continuations.

Martin Hyland, Paul Blain Levy, Gordon D. Plotkin, John Power

Theor. Comput. Sci., 2007

2006

Combining effects: Sum and tensor.

Martin Hyland, Gordon D. Plotkin, John Power

Theor. Comput. Sci., 2006

A domain-theoretic Banach-Alaoglu theorem.

Gordon D. Plotkin

Math. Struct. Comput. Sci., 2006

Hennessy-Plotkin-Brookes Revisited.

Gordon D. Plotkin

Proceedings of the FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 2006

Some Varieties of Equational Logic.

Gordon D. Plotkin

Proceedings of the Algebra, Meaning, and Computation, 2006

2005

Adequacy for Algebraic Effects with State.

Gordon D. Plotkin

Proceedings of the Algebra and Coalgebra in Computer Science: First International Conference, 2005

2004

A structural approach to operational semantics.

Gordon D. Plotkin

J. Log. Algebraic Methods Program., 2004

The origins of structural operational semantics.

Gordon D. Plotkin

J. Log. Algebraic Methods Program., 2004

Foreword.

Gordon D. Plotkin

Ann. Pure Appl. Log., 2004

Event Structures for Resolvable Conflict.

Rob J. van Glabbeek, Gordon D. Plotkin

Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

2003

Algebraic Operations and Generic Effects.

Gordon D. Plotkin, John Power

Appl. Categorical Struct., 2003

Logic for Computational Effects: Work in Progress.

Gordon D. Plotkin, John Power

Proceedings of the 6th International Workshop on Formal Methods, 2003

2002

Three Inadequate Models.

Gordon D. Plotkin

Formal Aspects Comput., 2002

Computational Effects and Operations: An Overview.

Gordon D. Plotkin, A. John Power

Proceedings of the Workshop on Domains VI 2002, Birmingham, UK, September 16-19, 2002, 2002

Combining Computational Effects: commutativity & sum.

Martin Hyland, Gordon D. Plotkin, John Power

Proceedings of the Foundations of Information Technology in the Era of Networking and Mobile Computing, 2002

Notions of Computation Determine Monads.

Gordon D. Plotkin, John Power

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

2001

Semantics for Algebraic Operations.

Gordon D. Plotkin, John Power

Proceedings of the Seventeenth Conference on the Mathematical Foundations of Programming Semantics, 2001

Bialgebraic Semantics and Recursion (Extended Abstract).

Gordon D. Plotkin

Proceedings of the Coalgebraic Methods in Computer Science, 2001

Adequacy for Algebraic Effects.

Gordon D. Plotkin, John Power

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

2000

Complete Axioms for Categorical Fixed-Point Operators.

Alex K. Simpson, Gordon D. Plotkin

Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science, 2000

Some New Directions in the Syntax and Semantics of Formal Languages.

Gordon D. Plotkin

Proceedings of the Theoretical Computer Science, 2000

Lax Logical Relations.

Gordon D. Plotkin, John Power, Donald Sannella, Robert D. Tennent

Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

A brief scientific biography of Robin Milner.

Gordon D. Plotkin, Colin Stirling, Mads Tofte

Proceedings of the Proof, Language, and Interaction, Essays in Honour of Robin Milner, 2000

Bistructures, bidomains, and linear logic.

Pierre-Louis Curien, Gordon D. Plotkin, Glynn Winskel

Proceedings of the Proof, Language, and Interaction, Essays in Honour of Robin Milner, 2000

1999

Full abstraction, totality and PCF.

Gordon D. Plotkin

Math. Struct. Comput. Sci., 1999

Abstract Syntax and Variable Binding.

Marcelo P. Fiore, Gordon D. Plotkin, Daniele Turi

Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science, 1999

Full Completeness of the Multiplicative Linear Logic of Chu Spaces.

Harish Devarajan, Dominic J. D. Hughes, Gordon D. Plotkin, Vaughan R. Pratt

Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science, 1999

1997

Towards a Mathematical Operational Semantics.

Daniele Turi, Gordon D. Plotkin

Proceedings of the Proceedings, 12th Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, June 29, 1997

Complete Cuboidal Sets in Axiomatic Domain Theory.

Marcelo P. Fiore, Gordon D. Plotkin, A. John Power

Proceedings of the Proceedings, 12th Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, June 29, 1997

From Action Calculi to Linear Logic.

Andrew G. Barber, Philippa Gardner, Masahito Hasegawa, Gordon D. Plotkin

Proceedings of the Computer Science Logic, 11th International Workshop, 1997

1996

On a Question of H. Friedman.

Gordon D. Plotkin

Inf. Comput., 1996

Teams can see pomsets.

Gordon D. Plotkin, Vaughan R. Pratt

Proceedings of the Partial Order Methods in Verification, Proceedings of a DIMACS Workshop, 1996

An Extension of Models of Axiomatic Domain Theory to Models of Synthetic Domain Theory.

Marcelo P. Fiore, Gordon D. Plotkin

Proceedings of the Computer Science Logic, 10th International Workshop, 1996

1995

Uncountable Limits and the lambda Calculus.

Pietro Di Gianantonio, Furio Honsell, Gordon D. Plotkin

Nord. J. Comput., 1995

Configuration Structures

Rob J. van Glabbeek, Gordon D. Plotkin

Proceedings of the Proceedings, 1995

1994

A Semantics for Static Type Inference

Gordon D. Plotkin

Inf. Comput., 1994

Subtyping and Parametricity

Gordon D. Plotkin, Martín Abadi, Luca Cardelli

Proceedings of the Ninth Annual Symposium on Logic in Computer Science (LICS '94), 1994

An Axiomatization of Computationally Adequate Domain Theoretic Models of FPC

Marcelo P. Fiore, Gordon D. Plotkin

Proceedings of the Ninth Annual Symposium on Logic in Computer Science (LICS '94), 1994

Bistructures, Bidomains and Linear Logic.

Gordon D. Plotkin, Glynn Winskel

Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994

Countable Non-Determinism and Uncountable Limits.

Pietro Di Gianantonio, Furio Honsell, Silvia Liani, Gordon D. Plotkin

Proceedings of the CONCUR '94, 1994

1993

On Functors Expressible in the Polymorphic Typed Lambda Calculus

John C. Reynolds, Gordon D. Plotkin

Inf. Comput., July, 1993

A Calculus for Access Control in Distributed Systems.

Martín Abadi, Michael Burrows, Butler W. Lampson, Gordon D. Plotkin

ACM Trans. Program. Lang. Syst., 1993

Set-Theoretical and Other Elementary Models of the lambda-Calculus.

Gordon D. Plotkin

Theor. Comput. Sci., 1993

Concrete Domains.

Gilles Kahn, Gordon D. Plotkin

Theor. Comput. Sci., 1993

A Logical View of Composition.

Martín Abadi, Gordon D. Plotkin

Theor. Comput. Sci., 1993

A Framework for Defining Logics.

Robert Harper, Furio Honsell, Gordon D. Plotkin

J. ACM, 1993

A Logic for Parametric Polymorphism.

Gordon D. Plotkin, Martín Abadi

Proceedings of the Typed Lambda Calculi and Applications, 1993

Type Theory and Recursion (Extended Abstract)

Gordon D. Plotkin

Proceedings of the Eighth Annual Symposium on Logic in Computer Science (LICS '93), 1993

1991

Dynamic Typing in a Statically Typed Language.

Martín Abadi, Luca Cardelli, Benjamin C. Pierce, Gordon D. Plotkin

ACM Trans. Program. Lang. Syst., 1991

Faithful Ideal Models for Recursive Polymorphic Types.

Martín Abadi, Benjamin C. Pierce, Gordon D. Plotkin

Int. J. Found. Comput. Sci., 1991

A Semantics for Type Checking.

Gordon D. Plotkin

Proceedings of the Theoretical Aspects of Computer Software, 1991

A Logical View of Composition and Refinement.

Martín Abadi, Gordon D. Plotkin

Proceedings of the Conference Record of the Eighteenth Annual ACM Symposium on Principles of Programming Languages, 1991

1990

A Per Model of Polymorphism and Recursive Types

Martín Abadi, Gordon D. Plotkin

Proceedings of the Fifth Annual Symposium on Logic in Computer Science (LICS '90), 1990

1989

A Probabilistic Powerdomain of Evaluations

C. Jones, Gordon D. Plotkin

Proceedings of the Fourth Annual Symposium on Logic in Computer Science (LICS '89), 1989

1988

Abstract Types Have Existential Type.

John C. Mitchell, Gordon D. Plotkin

ACM Trans. Program. Lang. Syst., 1988

Preface

Gordon D. Plotkin

Inf. Comput., 1988

1987

On Proving Limiting Completeness.

Peter D. Mosses, Gordon D. Plotkin

SIAM J. Comput., 1987

1986

Countable nondeterminism and random assignment.

Krzysztof R. Apt, Gordon D. Plotkin

J. ACM, 1986

An Ideal Model for Recursive Polymorphic Types

David B. MacQueen, Gordon D. Plotkin, Ravi Sethi

Inf. Control., 1986

A Framework for Intuitionistic Modal Logics.

Gordon D. Plotkin, Colin Stirling

Proceedings of the 1st Conference on Theoretical Aspects of Reasoning about Knowledge, 1986

1982

The Category-Theoretic Solution of Recursive Domain Equations.

Michael B. Smyth, Gordon D. Plotkin

SIAM J. Comput., 1982

An Operational Semantics for CSP.

Gordon D. Plotkin

Proceedings of the Formal Description of Programming Concepts : Proceedings of the IFIP Working Conference on Formal Description of Programming Concepts- II, 1982

A Powerdomain for Countable Non-Determinism (Extended Abstract).

Gordon D. Plotkin

Proceedings of the Automata, 1982

1981

Petri Nets, Event Structures and Domains, Part I.

Mogens Nielsen, Gordon D. Plotkin, Glynn Winskel

Theor. Comput. Sci., 1981

A First Attempt at Translating CSP into CCS.

Matthew Hennessy, Wei Li, Gordon D. Plotkin

Proceedings of the 2nd International Conference on Distributed Computing Systems, 1981

A Cook's Tour of Countable Nondeterminism.

Krzysztof R. Apt, Gordon D. Plotkin

Proceedings of the Automata, 1981

1980

A Term Model for CCS.

Matthew Hennessy, Gordon D. Plotkin

Proceedings of the Mathematical Foundations of Computer Science 1980 (MFCS'80), 1980

An operational semantics for CSO.

Gordon D. Plotkin

Proceedings of the Logics of Programs and Their Applications, 1980

1979

Petri Nets, Event Structures and Domains.

Mogens Nielsen, Gordon D. Plotkin, Glynn Winskel

Proceedings of the Semantics of Concurrent Computation, 1979

Full Abstraction for a Simple Parallel Programming Language.

Matthew Hennessy, Gordon D. Plotkin

Proceedings of the Mathematical Foundations of Computer Science 1979, 1979

Dijkstras Predicate Transformers & Smyth's Power Domaine.

Gordon D. Plotkin

Proceedings of the Abstract Software Specifications, 1979 Copenhagen Winter School, January 22, 1979

1978

T^omega as a Universal Domain.

Gordon D. Plotkin

J. Comput. Syst. Sci., 1978

1977

LCF Considered as a Programming Language.

Gordon D. Plotkin

Theor. Comput. Sci., 1977

Analysis of an Extended Concept-Learning Task.

Richard M. Young, Gordon D. Plotkin, R. F. Linz

Proceedings of the 5th International Joint Conference on Artificial Intelligence. Cambridge, 1977

The Category-Theoretic Solution of Recursive Domain Equations (Extended Abstract)

Michael B. Smyth, Gordon D. Plotkin

Proceedings of the 18th Annual Symposium on Foundations of Computer Science, Providence, Rhode Island, USA, 31 October, 1977

1976

A Powerdomain Construction.

Gordon D. Plotkin

SIAM J. Comput., 1976

1975

Call-by-Name, Call-by-Value and the lambda-Calculus.

Gordon D. Plotkin

Theor. Comput. Sci., 1975

1974

The lambda-Calculus is omega-Incomplete.

Gordon D. Plotkin

J. Symb. Log., 1974