Gordon D. Plotkin
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
60
Venues
16
Active years
1977–2026
Best venue rank
A*
Where they publish
Papers
60 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | CSL | Rational Lawvere Logic (Invited Paper). | Giorgio Bacci, Radu Mardare, Prakash Panangaden, Gordon D. Plotkin |
| 2025 | FOSSACS | Two-sorted algebraic decompositions of Brookes's shared-state denotational semantics. | Yotam Dvir, Ohad Kammar, Ori Lahav, Gordon D. Plotkin |
| 2021 | CALCO | Tensor of Quantitative Equational Theories. | Giorgio Bacci, Radu Mardare, Prakash Panangaden, Gordon D. Plotkin |
| 2021 | LICS | Smart Choices and the Selection Monad. | Martn Abadi, Gordon D. Plotkin |
| 2021 | LICS | Fixed-Points for Quantitative Equational Logics. | Radu Mardare, Prakash Panangaden, Gordon D. Plotkin |
| 2020 | CSL | Reverse Derivative Categories. | J. Robin B. Cockett, Geoff S. H. Cruttwell, Jonathan Gallagher, Jean-Simon Pacaud Lemay, Benjamin MacAdam, Gordon D. Plotkin, Dorette Pronk |
| 2020 | MFPS | A Complete Equational Axiomatisation of Partial Differentiation. | Gordon D. Plotkin |
| 2018 | LICS | An Algebraic Theory of Markov Processes. | Giorgio Bacci, Radu Mardare, Prakash Panangaden, Gordon D. Plotkin |
| 2017 | LICS | On the axiomatizability of quantitative algebras. | Radu Mardare, Prakash Panangaden, Gordon D. Plotkin |
| 2017 | POPL | Dijkstra monads for free. | Danel Ahman, Catalin Hritcu, Kenji Maillard, Guido Martnez, Gordon D. Plotkin, Jonathan Protzenko, Aseem Rastogi, Nikhil Swamy |
| 2016 | EGPGV | 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 |
| 2016 | FOSSACS | Dependent Types and Fibred Computational Effects. | Danel Ahman, Neil Ghani, Gordon D. Plotkin |
| 2016 | LICS | Quantitative Algebraic Reasoning. | Radu Mardare, Prakash Panangaden, Gordon D. Plotkin |
| 2016 | POPL | Scaling network verification using symmetry and surgery. | Gordon D. Plotkin, Nikolaj S. Bjrner, Nuno P. Lopes, Andrey Rybalchenko, George Varghese |
| 2015 | FOSSACS | Foundations of Differential Dataflow. | Martn Abadi, Frank McSherry, Gordon D. Plotkin |
| 2013 | ESOP | The Compiler Forest. | Mihai Budiu, Joel Galenson, Gordon D. Plotkin |
| 2012 | CONCUR | Concurrency and the Algebraic Theory of Effects - (Abstract). | Gordon D. Plotkin |
| 2012 | POPL | Algebraic foundations for effect-dependent optimisations. | Ohad Kammar, Gordon D. Plotkin |
| 2010 | LICS | Robin Milner, a Craftsman of Tools for the Mind. | Gordon D. Plotkin |
| 2009 | CALCO | Approximating Labelled Markov Processes Again! | Philippe Chaput, Vincent Danos, Prakash Panangaden, Gordon D. Plotkin |
| 2009 | CALCO | Adequacy for Infinitary Algebraic Effects (Abstract). | Gordon D. Plotkin |
| 2009 | ESOP | Handlers of Algebraic Effects. | Gordon D. Plotkin, Matija Pretnar |
| 2009 | ICALP | Approximating Markov Processes by Averaging. | Philippe Chaput, Vincent Danos, Prakash Panangaden, Gordon D. Plotkin |
| 2009 | POPL | A model of cooperative threads. | Martn Abadi, Gordon D. Plotkin |
| 2008 | LICS | A Logic for Algebraic Effects. | Gordon D. Plotkin, Matija Pretnar |
| 2005 | CALCO | Adequacy for Algebraic Effects with State. | Gordon D. Plotkin |
| 2004 | MFCS | Event Structures for Resolvable Conflict. | Rob J. van Glabbeek, Gordon D. Plotkin |
| 2002 | FOSSACS | Notions of Computation Determine Monads. | Gordon D. Plotkin, John Power |
| 2001 | FOSSACS | Adequacy for Algebraic Effects. | Gordon D. Plotkin, John Power |
| 2000 | ICALP | Lax Logical Relations. | Gordon D. Plotkin, John Power, Donald Sannella, Robert D. Tennent |
| 2000 | LICS | Complete Axioms for Categorical Fixed-Point Operators. | Alex K. Simpson, Gordon D. Plotkin |
| 1999 | LICS | Full Completeness of the Multiplicative Linear Logic of Chu Spaces. | Harish Devarajan, Dominic J. D. Hughes, Gordon D. Plotkin, Vaughan R. Pratt |
| 1999 | LICS | Abstract Syntax and Variable Binding. | Marcelo P. Fiore, Gordon D. Plotkin, Daniele Turi |
| 1997 | CSL | From Action Calculi to Linear Logic. | Andrew G. Barber, Philippa Gardner, Masahito Hasegawa, Gordon D. Plotkin |
| 1997 | LICS | Complete Cuboidal Sets in Axiomatic Domain Theory. | Marcelo P. Fiore, Gordon D. Plotkin, A. John Power |
| 1997 | LICS | Towards a Mathematical Operational Semantics. | Daniele Turi, Gordon D. Plotkin |
| 1996 | CSL | An Extension of Models of Axiomatic Domain Theory to Models of Synthetic Domain Theory. | Marcelo P. Fiore, Gordon D. Plotkin |
| 1995 | LICS | Configuration Structures | Rob J. van Glabbeek, Gordon D. Plotkin |
| 1994 | CONCUR | Countable Non-Determinism and Uncountable Limits. | Pietro Di Gianantonio, Furio Honsell, Silvia Liani, Gordon D. Plotkin |
| 1994 | ICALP | Bistructures, Bidomains and Linear Logic. | Gordon D. Plotkin, Glynn Winskel |
| 1994 | LICS | An Axiomatization of Computationally Adequate Domain Theoretic Models of FPC | Marcelo P. Fiore, Gordon D. Plotkin |
| 1994 | LICS | Subtyping and Parametricity | Gordon D. Plotkin, Martn Abadi, Luca Cardelli |
| 1993 | LICS | Type Theory and Recursion (Extended Abstract) | Gordon D. Plotkin |
| 1991 | CRYPTO | A Calculus for Access Control in Distributed Systems. | Martn Abadi, Michael Burrows, Butler W. Lampson, Gordon D. Plotkin |
| 1991 | POPL | A Logical View of Composition and Refinement. | Martn Abadi, Gordon D. Plotkin |
| 1990 | LICS | A Per Model of Polymorphism and Recursive Types | Martn Abadi, Gordon D. Plotkin |
| 1989 | LICS | Faithful Ideal Models for Recursive Polymorphic Types | Martn Abadi, Benjamin C. Pierce, Gordon D. Plotkin |
| 1989 | LICS | A Probabilistic Powerdomain of Evaluations | C. Jones, Gordon D. Plotkin |
| 1989 | POPL | Dynamic Typing in a Statically-Typed Language. | Martn Abadi, Luca Cardelli, Benjamin C. Pierce, Gordon D. Plotkin |
| 1987 | LICS | A Framework for Defining Logics | Robert Harper, Furio Honsell, Gordon D. Plotkin |
| 1986 | TARK | A Framework for Intuitionistic Modal Logics. | Gordon D. Plotkin, Colin Stirling |
| 1985 | POPL | Abstract Types Have Existential Type. | John C. Mitchell, Gordon D. Plotkin |
| 1984 | POPL | An Ideal Model for Recursive Polymorphic Types. | David B. MacQueen, Gordon D. Plotkin, Ravi Sethi |
| 1982 | ICALP | A Powerdomain for Countable Non-Determinism (Extended Abstract). | Gordon D. Plotkin |
| 1981 | ICALP | A Cook's Tour of Countable Nondeterminism. | Krzysztof R. Apt, Gordon D. Plotkin |
| 1981 | ICDCS | A First Attempt at Translating CSP into CCS. | Matthew Hennessy, Wei Li, Gordon D. Plotkin |
| 1980 | MFCS | A Term Model for CCS. | Matthew Hennessy, Gordon D. Plotkin |
| 1979 | MFCS | Full Abstraction for a Simple Parallel Programming Language. | Matthew Hennessy, Gordon D. Plotkin |
| 1977 | FOCS | The Category-Theoretic Solution of Recursive Domain Equations (Extended Abstract) | Michael B. Smyth, Gordon D. Plotkin |
| 1977 | IJCAI | Analysis of an Extended Concept-Learning Task. | Richard M. Young, Gordon D. Plotkin, R. F. Linz |