Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarGordon D. Plotkin
Person information
- affiliation: University of Edinburgh, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – today
- 2018
[j57]Thomas Eiter, Javier Esparza, Catuscia Palamidessi, Gordon D. Plotkin, Natarajan Shankar:
Alonzo Church Award 2018 - Call for Nominations. Bulletin of the EATCS 124 (2018)- [j56]Ricardo Honorato-Zimmer, Andrew J. Millar, Gordon D. Plotkin, Argyris Zardilis:
Chromar, a Rule-based Language of Parameterised Objects. Electr. Notes Theor. Comput. Sci. 335: 49-66 (2018) - [j55]Nathan Bowler, Paul Blain Levy, Gordon D. Plotkin:
Initial Algebras and Final Coalgebras Consisting of Nondeterministic Finite Trace Strategies. Electr. Notes Theor. Comput. Sci. 341: 23-44 (2018) - [j54]Radu Mardare, Prakash Panangaden, Gordon D. Plotkin:
Free complete Wasserstein algebras. Logical Methods in Computer Science 14(3) (2018) - [c74]Giorgio Bacci, Radu Mardare, Prakash Panangaden, Gordon D. Plotkin:
An Algebraic Theory of Markov Processes. LICS 2018: 679-688 - [i5]Radu Mardare, Prakash Panangaden, Gordon D. Plotkin:
Free complete Wasserstein algebras. CoRR abs/1802.07366 (2018) - [i4]Radu Mardare, Prakash Panangaden, Gordon D. Plotkin:
On the Axiomatizability of Quantitative Algebras. CoRR abs/1804.01682 (2018) - 2017
- [j53]Klaus Keimel, Gordon D. Plotkin:
Mixed powerdomains for probability and nondeterminism. Logical Methods in Computer Science 13(1) (2017) - [j52]Natarajan Shankar, Catuscia Palamidessi, Gordon D. Plotkin, Moshe Y. Vardi:
Alonzo Church Award 2017 - Call for Nominations. Bulletin of the EATCS 121 (2017) - [c73]Radu Mardare, Prakash Panangaden, Gordon D. Plotkin:
On the axiomatizability of quantitative algebras. LICS 2017: 1-12 - [c72]Danel Ahman, Catalin Hritcu, Kenji Maillard, Guido Martínez, Gordon D. Plotkin, Jonathan Protzenko, Aseem Rastogi, Nikhil Swamy:
Dijkstra monads for free. POPL 2017: 515-529 - 2016
- [c71]Mihai Budiu, Rebecca Isaacs, Derek Murray, Gordon D. Plotkin, Paul Barham, Samer Al-Kiswany, Yazan Boshmaf, Qingzhou Luo, Alexandr Andoni:
Interacting with Large Distributed Datasets Using Sketch. EGPGV 2016: 31-43 - [c70]Danel Ahman, Neil Ghani, Gordon D. Plotkin:
Dependent Types and Fibred Computational Effects. FoSSaCS 2016: 36-54 - [c69]Radu Mardare, Prakash Panangaden, Gordon D. Plotkin:
Quantitative Algebraic Reasoning. LICS 2016: 700-709 - [c68]Gordon D. Plotkin, Nikolaj Bjørner, Nuno P. Lopes, Andrey Rybalchenko, George Varghese:
Scaling network verification using symmetry and surgery. POPL 2016: 69-83 - [i3]Danel Ahman, Catalin Hritcu, Guido Martínez, Gordon D. Plotkin, Jonathan Protzenko, Aseem Rastogi, Nikhil Swamy:
Dijkstra Monads for Free. CoRR abs/1608.06499 (2016) - 2015
- [c67]Martín Abadi, Frank McSherry, Gordon D. Plotkin:
Foundations of Differential Dataflow. FoSSaCS 2015: 71-83 - 2014
- [j51]Roberto Bruni, Ugo Montanari, Gordon D. Plotkin, Daniele Terreni:
On Hierarchical Graphs: Reconciling Bigraphs, Gs-monoidal Theories and Gs-graphs. Fundam. Inform. 134(3-4): 287-317 (2014) - [j50]Philippe Chaput, Vincent Danos, Prakash Panangaden, Gordon D. Plotkin:
Approximating Markov Processes by Averaging. J. ACM 61(1): 5:1-5:45 (2014) - [j49]Andrej Bauer, Gordon D. Plotkin, Dana S. Scott:
Cartesian closed categories of separable Scott domains. Theor. Comput. Sci. 546: 17-29 (2014) - [c66]Martín Abadi, Jérémy Planul, Gordon D. Plotkin:
Layout Randomization and Nondeterminism. Horizons of the Mind 2014: 1-39 - 2013
- [j48]Gordon D. Plotkin, Matija Pretnar:
Handling Algebraic Effects. Logical Methods in Computer Science 9(4) (2013) - [j47]Stephen Brookes, Benjamin C. Pierce, Gordon D. Plotkin, Dana S. Scott:
Dedication. Electr. Notes Theor. Comput. Sci. 298: 3-5 (2013) - [j46]Martín Abadi, Jérémy Planul, Gordon D. Plotkin:
Layout Randomization and Nondeterminism. Electr. Notes Theor. Comput. Sci. 298: 29-50 (2013) - [j45]Nicolas Oury, Gordon D. Plotkin:
Multi-level modelling via stochastic multi-level multiset rewriting. Mathematical Structures in Computer Science 23(2): 471-503 (2013) - [c65]Gordon D. Plotkin:
Partial Recursive Functions and Finality. Computation, Logic, Games, and Quantum Foundations 2013: 311-326 - [c64]Gordon D. Plotkin:
A Calculus of Chemical Systems. In Search of Elegance in the Theory and Practice of Computation 2013: 445-465 - [c63]
- 2012
- [j44]Martín Abadi, Gordon D. Plotkin:
On Protection by Layout Randomization. ACM Trans. Inf. Syst. Secur. 15(2): 8:1-8:29 (2012) - [c62]
- [c61]Ohad Kammar, Gordon D. Plotkin:
Algebraic foundations for effect-dependent optimisations. POPL 2012: 349-360 - 2011
- [c60]Nicolas Oury, Gordon D. Plotkin:
Coloured stochastic multilevel multiset rewriting. CMSB 2011: 171-181 - 2010
- [j43]Martín Abadi, Gordon D. Plotkin:
A Model of Cooperative Threads. Logical Methods in Computer Science 6(4) (2010) - [j42]Gordon D. Plotkin, Colin Stirling, Mads Tofte:
Obituary: Robin Milner (1934-2010). Bulletin of the EATCS 101: 12-16 (2010) - [j41]Michael Pedersen, Gordon D. Plotkin:
A Language for Biochemical Systems: Design and Formal Specification. Trans. Computational Systems Biology 12: 77-145 (2010) - [c59]
- [c58]
- [p1]Rob J. van Glabbeek, Gordon D. Plotkin:
On CSP and the Algebraic Theory of Effects. Reflections on the Work of C. A. R. Hoare 2010: 333-369 - [i2]Rob J. van Glabbeek, Gordon D. Plotkin:
On CSP and the Algebraic Theory of Effects. CoRR abs/1007.5488 (2010)
2000 – 2009
- 2009
- [j40]Regina Tix, Klaus Keimel, Gordon D. Plotkin:
Semantic Domains for Combining Probability and Non-Determinism. Electr. Notes Theor. Comput. Sci. 222: 3-99 (2009) - [j39]Furio Honsell, Gordon D. Plotkin:
On the completeness of order-theoretic models of the lambda-calculus. Inf. Comput. 207(5): 583-594 (2009) - [j38]Klaus Keimel, Gordon D. Plotkin:
Predicate transformers for extended probability and non-determinism. Mathematical Structures in Computer Science 19(3): 501-539 (2009) - [j37]Rob J. van Glabbeek, Gordon D. Plotkin:
Configuration structures, event structures and Petri nets. Theor. Comput. Sci. 410(41): 4111-4159 (2009) - [c57]
- [c56]Philippe Chaput, Vincent Danos, Prakash Panangaden, Gordon D. Plotkin:
Approximating Labelled Markov Processes Again! CALCO 2009: 145-156 - [c55]
- [c54]Philippe Chaput, Vincent Danos, Prakash Panangaden, Gordon D. Plotkin:
Approximating Markov Processes by Averaging. ICALP (2) 2009: 127-138 - [c53]
- [i1]Rob J. van Glabbeek, Gordon D. Plotkin:
Configuration Structures, Event Structures and Petri Nets. CoRR abs/0912.4023 (2009) - 2008
- [j36]Gordon D. Plotkin, John Power:
Tensors of Comodels and Models for Operational Semantics. Electr. Notes Theor. Comput. Sci. 218: 295-311 (2008) - [c52]Masahito Hasegawa, Martin Hofmann, Gordon D. Plotkin:
Finite Dimensional Vector Spaces Are Complete for Traced Symmetric Monoidal Categories. Pillars of Computer Science 2008: 367-385 - [c51]
- [c50]
- 2007
- [j35]Martin Hyland, Paul Blain Levy, Gordon D. Plotkin, John Power:
Combining algebraic effects with continuations. Theor. Comput. Sci. 375(1-3): 20-40 (2007) - 2006
- [j34]Gordon D. Plotkin:
A domain-theoretic Banach-Alaoglu theorem. Mathematical Structures in Computer Science 16(2): 299-311 (2006) - [j33]Martin Hyland, Gordon D. Plotkin, John Power:
Combining effects: Sum and tensor. Theor. Comput. Sci. 357(1-3): 70-99 (2006) - [c49]Gordon D. Plotkin:
Some Varieties of Equational Logic. Essays Dedicated to Joseph A. Goguen 2006: 150-156 - [c48]
- [e5]Corrado Priami, Gordon D. Plotkin:
Transactions on Computational Systems Biology VI. Lecture Notes in Computer Science 4220, Springer 2006, ISBN 3-540-45779-8 [contents] - 2005
- [c47]
- 2004
- [j32]
- [j31]Gordon D. Plotkin, A. John Power:
Computational Effects and Operations: An Overview. Electr. Notes Theor. Comput. Sci. 73: 149-163 (2004) - [j30]Gordon D. Plotkin:
The origins of structural operational semantics. J. Log. Algebr. Program. 60-61: 3-15 (2004) - [j29]Gordon D. Plotkin:
A structural approach to operational semantics. J. Log. Algebr. Program. 60-61: 17-139 (2004) - [c46]Rob J. van Glabbeek, Gordon D. Plotkin:
Event Structures for Resolvable Conflict. MFCS 2004: 550-561 - 2003
- [j28]Gordon D. Plotkin, John Power:
Algebraic Operations and Generic Effects. Applied Categorical Structures 11(1): 69-94 (2003) - [c45]
- 2002
- [j27]
- [c44]
- [c43]Martin Hyland, Gordon D. Plotkin, John Power:
Combining Computational Effects: commutativity & sum. IFIP TCS 2002: 474-484 - 2001
- [j26]Gordon D. Plotkin:
Bialgebraic Semantics and Recursion (Extended Abstract). Electr. Notes Theor. Comput. Sci. 44(1): 285-288 (2001) - [j25]Gordon D. Plotkin, John Power:
Semantics for Algebraic Operations. Electr. Notes Theor. Comput. Sci. 45: 332-345 (2001) - [c42]
- 2000
- [c41]Gordon D. Plotkin, Colin Stirling, Mads Tofte:
A brief scientific biography of Robin Milner. Proof, Language, and Interaction 2000: 1-18 - [c40]Pierre-Louis Curien, Gordon D. Plotkin, Glynn Winskel:
Bistructures, bidomains, and linear logic. Proof, Language, and Interaction 2000: 21-54 - [c39]Gordon D. Plotkin, John Power, Donald Sannella, Robert D. Tennent:
Lax Logical Relations. ICALP 2000: 85-102 - [c38]Gordon D. Plotkin:
Some New Directions in the Syntax and Semantics of Formal Languages. IFIP TCS 2000: 596 - [c37]Alex K. Simpson, Gordon D. Plotkin:
Complete Axioms for Categorical Fixed-Point Operators. LICS 2000: 30-41 - [e4]Gordon D. Plotkin, Colin Stirling, Mads Tofte:
Proof, Language, and Interaction, Essays in Honour of Robin Milner. The MIT Press 2000, ISBN 978-0-262-16188-6 [contents]
1990 – 1999
- 1999
- [j24]Gordon D. Plotkin:
Full abstraction, totality and PCF. Mathematical Structures in Computer Science 9(1): 1-20 (1999) - [c36]Marcelo P. Fiore, Gordon D. Plotkin, Daniele Turi:
Abstract Syntax and Variable Binding. LICS 1999: 193-202 - [c35]Harish Devarajan, Dominic J. D. Hughes, Gordon D. Plotkin, Vaughan R. Pratt:
Full Completeness of the Multiplicative Linear Logic of Chu Spaces. LICS 1999: 234-243 - 1997
- [c34]Andrew G. Barber, Philippa Gardner, Masahito Hasegawa, Gordon D. Plotkin:
From Action Calculi to Linear Logic. CSL 1997: 78-97 - [c33]Marcelo P. Fiore, Gordon D. Plotkin, A. John Power:
Complete Cuboidal Sets in Axiomatic Domain Theory. LICS 1997: 268-278 - [c32]
- 1996
- [j23]
- [c31]Marcelo P. Fiore, Gordon D. Plotkin:
An Extension of Models of Axiomatic Domain Theory to Models of Synthetic Domain Theory. CSL 1996: 129-149 - [c30]Gordon D. Plotkin, Vaughan R. Pratt:
Teams can see pomsets. Partial Order Methods in Verification 1996: 117-128 - 1995
- [j22]Pietro Di Gianantonio, Furio Honsell, Gordon D. Plotkin:
Uncountable Limits and the lambda Calculus. Nord. J. Comput. 2(2): 126-145 (1995) - [c29]
- [e3]Mariangiola Dezani-Ciancaglini, Gordon D. Plotkin:
Typed Lambda Calculi and Applications, Second International Conference on Typed Lambda Calculi and Applications, TLCA '95, Edinburgh, UK, April 10-12, 1995, Proceedings. Lecture Notes in Computer Science 902, Springer 1995, ISBN 3-540-59048-X [contents] - 1994
- [j21]
- [c28]Pietro Di Gianantonio, Furio Honsell, Silvia Liani, Gordon D. Plotkin:
Countable Non-Determinism and Uncountable Limits. CONCUR 1994: 130-145 - [c27]
- [c26]Marcelo P. Fiore, Gordon D. Plotkin:
An Axiomatization of Computationally Adequate Domain Theoretic Models of FPC. LICS 1994: 92-102 - [c25]
- 1993
- [j20]John C. Reynolds, Gordon D. Plotkin:
On Functors Expressible in the Polymorphic Typed Lambda Calculus. Inf. Comput. 105(1): 1-29 (1993) - [j19]Robert Harper, Furio Honsell, Gordon D. Plotkin:
A Framework for Defining Logics. J. ACM 40(1): 143-184 (1993) - [j18]Martín Abadi, Gordon D. Plotkin:
A Logical View of Composition. Theor. Comput. Sci. 114(1): 3-30 (1993) - [j17]
- [j16]Gordon D. Plotkin:
Set-Theoretical and Other Elementary Models of the lambda-Calculus. Theor. Comput. Sci. 121(1&2): 351-409 (1993) - [j15]Martín Abadi, Michael Burrows, Butler W. Lampson, Gordon D. Plotkin:
A Calculus for Access Control in Distributed Systems. ACM Trans. Program. Lang. Syst. 15(4): 706-734 (1993) - [c24]
- [c23]
- 1991
- [j14]Martín Abadi, Benjamin C. Pierce, Gordon D. Plotkin:
Faithful Ideal Models for Recursive Polymorphic Types. Int. J. Found. Comput. Sci. 2(1): 1-21 (1991) - [j13]Martín Abadi, Luca Cardelli, Benjamin C. Pierce, Gordon D. Plotkin:
Dynamic Typing in a Statically Typed Language. ACM Trans. Program. Lang. Syst. 13(2): 237-268 (1991) - [c22]Martín Abadi, Michael Burrows, Butler W. Lampson, Gordon D. Plotkin:
A Calculus for Access Control in Distributed Systems. CRYPTO 1991: 1-23 - [c21]
- [c20]
- [e2]Jean-Louis Lassez, Gordon D. Plotkin:
Computational Logic - Essays in Honor of Alan Robinson. The MIT Press 1991, ISBN 0-262-12156-5 [contents] - 1990
- [c19]Martín Abadi, Gordon D. Plotkin:
A Per Model of Polymorphism and Recursive Types. LICS 1990: 355-365
1980 – 1989
- 1989
- [c18]
- [c17]Martín Abadi, Benjamin C. Pierce, Gordon D. Plotkin:
Faithful Ideal Models for Recursive Polymorphic Types. LICS 1989: 216-225 - [c16]Martín Abadi, Luca Cardelli, Benjamin C. Pierce, Gordon D. Plotkin:
Dynamic Typing in a Statically-Typed Language. POPL 1989: 213-227 - 1988
- [j12]
- [j11]John C. Mitchell, Gordon D. Plotkin:
Abstract Types Have Existential Type. ACM Trans. Program. Lang. Syst. 10(3): 470-502 (1988) - 1987
- [j10]Peter D. Mosses, Gordon D. Plotkin:
On Proving Limiting Completeness. SIAM J. Comput. 16(1): 179-194 (1987) - [c15]Robert Harper, Furio Honsell, Gordon D. Plotkin:
A Framework for Defining Logics. LICS 1987: 194-204 - 1986
- [j9]David B. MacQueen, Gordon D. Plotkin, Ravi Sethi:
An Ideal Model for Recursive Polymorphic Types. Information and Control 71(1/2): 95-130 (1986) - [j8]Krzysztof R. Apt, Gordon D. Plotkin:
Countable nondeterminism and random assignment. J. ACM 33(4): 724-767 (1986) - [c14]
- 1985
- [c13]
- 1984
- [c12]David B. MacQueen, Gordon D. Plotkin, Ravi Sethi:
An Ideal Model for Recursive Polymorphic Types. POPL 1984: 165-174 - [e1]Gilles Kahn, David B. MacQueen, Gordon D. Plotkin:
Semantics of Data Types, International Symposium, Sophia-Antipolis, France, June 27-29, 1984, Proceedings. Lecture Notes in Computer Science 173, Springer 1984, ISBN 3-540-13346-1 [contents] - 1982
- [j7]Michael B. Smyth, Gordon D. Plotkin:
The Category-Theoretic Solution of Recursive Domain Equations. SIAM J. Comput. 11(4): 761-783 (1982) - [c11]Gordon D. Plotkin:
A Powerdomain for Countable Non-Determinism (Extended Abstract). ICALP 1982: 418-428 - [c10]Gordon D. Plotkin:
An Operational Semantics for CSP. Formal Description of Programming Concepts 1982: 199-226 - 1981
- [j6]Mogens Nielsen, Gordon D. Plotkin, Glynn Winskel:
Petri Nets, Event Structures and Domains, Part I. Theor. Comput. Sci. 13: 85-108 (1981) - [c9]
- [c8]Matthew Hennessy, W. Li, Gordon D. Plotkin:
A First Attempt at Translating CSP into CCS. ICDCS 1981: 105-115 - 1980
- [c7]
- [c6]
1970 – 1979
- 1979
- [c5]Gordon D. Plotkin:
Dijkstras Predicate Transformers & Smyth's Power Domaine. Abstract Software Specifications 1979: 527-553 - [c4]Matthew Hennessy, Gordon D. Plotkin:
Full Abstraction for a Simple Parallel Programming Language. MFCS 1979: 108-120 - [c3]