default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGordon D. Plotkin
Person information
- affiliation: University of Edinburgh, UK
- award (2010): Programming Languages Achievement Award
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[i16]Yotam Dvir, Ohad Kammar, Ori Lahav, Gordon D. Plotkin:
Two-sorted algebraic decompositions of Brookes's shared-state denotational semantics. CoRR abs/2501.15104 (2025)- 2024
- [j52]Giorgio Bacci
, Radu Mardare, Prakash Panangaden, Gordon D. Plotkin:
Sum and Tensor of Quantitative Effects. Log. Methods Comput. Sci. 20(4) (2024) - [i15]Giorgio Bacci, Radu Mardare, Prakash Panangaden, Gordon D. Plotkin:
Polynomial Lawvere Logic. CoRR abs/2402.03543 (2024) - 2023
- [j51]Martín Abadi, Gordon D. Plotkin:
Smart Choices and the Selection Monad. Log. Methods Comput. Sci. 19(2) (2023) - [c88]Giorgio Bacci, Radu Mardare, Prakash Panangaden, Gordon D. Plotkin:
Propositional Logics for the Lawvere Quantale. MFPS 2023 - [i14]Dumitru Potop-Butucaru, Albert Cohen, Gordon D. Plotkin, Hugo Pompougnac:
Bidirectional Reactive Programming for Machine Learning. CoRR abs/2311.16977 (2023) - 2022
- [i13]Gordon D. Plotkin:
Recursion does not always help. CoRR abs/2206.08413 (2022) - [i12]Giorgio Bacci, Radu Mardare, Prakash Panangaden, Gordon D. Plotkin:
Sum and Tensor of Quantitative Effects. CoRR abs/2212.11784 (2022) - 2021
- [c87]Giorgio Bacci, Radu Mardare, Prakash Panangaden, Gordon D. Plotkin:
Tensor of Quantitative Equational Theories. CALCO 2021: 7:1-7:17 - [c86]Martín Abadi, Gordon D. Plotkin:
Smart Choices and the Selection Monad. LICS 2021: 1-14 - [c85]Radu Mardare, Prakash Panangaden, Gordon D. Plotkin:
Fixed-Points for Quantitative Equational Logics. LICS 2021: 1-13 - [i11]Radu Mardare, Prakash Panangaden, Gordon D. Plotkin:
Fixed-Points for Quantitative Equational Logics. CoRR abs/2106.15932 (2021) - 2020
- [j50]Martín Abadi, Gordon D. Plotkin:
A simple differentiable programming language. Proc. ACM Program. Lang. 4(POPL): 38:1-38:28 (2020) - [c84]J. Robin B. Cockett, Geoff S. H. Cruttwell, Jonathan Gallagher, Jean-Simon Pacaud Lemay, Benjamin MacAdam, Gordon D. Plotkin, Dorette Pronk:
Reverse Derivative Categories. CSL 2020: 18:1-18:16 - [c83]Gordon D. Plotkin:
A Complete Equational Axiomatisation of Partial Differentiation. MFPS 2020: 211-232 - [p2]Giorgio Bacci, Radu Mardare, Prakash Panangaden, Gordon D. Plotkin:
Quantitative Equational Reasoning. Foundations of Probabilistic Programming 2020: 333-360 - [i10]Gordon D. Plotkin:
A complete equational axiomatisation of partial differentiation. CoRR abs/2006.06415 (2020) - [i9]Martín Abadi, Gordon D. Plotkin:
Smart Choices and the Selection Monad. CoRR abs/2007.08926 (2020)
2010 – 2019
- 2019
- [j49]Ricardo Honorato-Zimmer, Andrew J. Millar, Gordon D. Plotkin, Argyris Zardilis:
Chromar, a language of parameterised agents. Theor. Comput. Sci. 765: 97-119 (2019) - [i8]J. Robin B. Cockett, Geoff S. H. Cruttwell, Jonathan Gallagher, Jean-Simon Pacaud Lemay, Benjamin MacAdam, Gordon D. Plotkin, Dorette Pronk:
Reverse derivative categories. CoRR abs/1910.07065 (2019) - [i7]Martín Abadi, Gordon D. Plotkin:
A Simple Differentiable Programming Language. CoRR abs/1911.04523 (2019) - [i6]Oleg Kiselyov, Sam Lindley, Gordon D. Plotkin, Nicolas Wu:
Programming and Reasoning with Algebraic Effects and Effect Handlers (NII Shonan Meeting 146). NII Shonan Meet. Rep. 2019 (2019) - 2018
- [j48]Thomas Eiter, Javier Esparza, Catuscia Palamidessi, Gordon D. Plotkin, Natarajan Shankar:
Alonzo Church Award 2018 - Call for Nominations. Bull. EATCS 124 (2018) - [j47]Radu Mardare, Prakash Panangaden, Gordon D. Plotkin:
Free complete Wasserstein algebras. Log. Methods Comput. Sci. 14(3) (2018) - [c82]Giorgio Bacci, Radu Mardare, Prakash Panangaden, Gordon D. Plotkin:
An Algebraic Theory of Markov Processes. LICS 2018: 679-688 - [c81]Nathan J. Bowler, Paul Blain Levy, Gordon D. Plotkin:
Initial Algebras and Final Coalgebras Consisting of Nondeterministic Finite Trace Strategies. MFPS 2018: 23-44 - [c80]Ricardo Honorato-Zimmer, Andrew J. Millar, Gordon D. Plotkin, Argyris Zardilis:
Chromar, a Rule-based Language of Parameterised Objects. SASB 2018: 49-66 - [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
- [j46]Klaus Keimel, Gordon D. Plotkin:
Mixed powerdomains for probability and nondeterminism. Log. Methods Comput. Sci. 13(1) (2017) - [j45]Natarajan Shankar, Catuscia Palamidessi, Gordon D. Plotkin, Moshe Y. Vardi:
Alonzo Church Award 2017 - Call for Nominations. Bull. EATCS 121 (2017) - [c79]Radu Mardare, Prakash Panangaden, Gordon D. Plotkin:
On the axiomatizability of quantitative algebras. LICS 2017: 1-12 - [c78]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
- [c77]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@EuroVis 2016: 31-43 - [c76]Danel Ahman, Neil Ghani, Gordon D. Plotkin:
Dependent Types and Fibred Computational Effects. FoSSaCS 2016: 36-54 - [c75]Radu Mardare, Prakash Panangaden, Gordon D. Plotkin:
Quantitative Algebraic Reasoning. LICS 2016: 700-709 - [c74]Gordon D. Plotkin, Nikolaj S. 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
- [c73]Martín Abadi, Frank McSherry, Gordon D. Plotkin:
Foundations of Differential Dataflow. FoSSaCS 2015: 71-83 - 2014
- [j44]Roberto Bruni, Ugo Montanari, Gordon D. Plotkin, Daniele Terreni:
On Hierarchical Graphs: Reconciling Bigraphs, Gs-monoidal Theories and Gs-graphs. Fundam. Informaticae 134(3-4): 287-317 (2014) - [j43]Philippe Chaput, Vincent Danos, Prakash Panangaden, Gordon D. Plotkin:
Approximating Markov Processes by Averaging. J. ACM 61(1): 5:1-5:45 (2014) - [j42]Andrej Bauer, Gordon D. Plotkin, Dana S. Scott:
Cartesian closed categories of separable Scott domains. Theor. Comput. Sci. 546: 17-29 (2014) - [c72]Martín Abadi, Jérémy Planul, Gordon D. Plotkin:
Layout Randomization and Nondeterminism. Horizons of the Mind 2014: 1-39 - 2013
- [j41]Gordon D. Plotkin, Matija Pretnar:
Handling Algebraic Effects. Log. Methods Comput. Sci. 9(4) (2013) - [j40]Nicolas Oury, Gordon D. Plotkin:
Multi-level modelling via stochastic multi-level multiset rewriting. Math. Struct. Comput. Sci. 23(2): 471-503 (2013) - [c71]Gordon D. Plotkin:
Partial Recursive Functions and Finality. Computation, Logic, Games, and Quantum Foundations 2013: 311-326 - [c70]Gordon D. Plotkin:
A Calculus of Chemical Systems. In Search of Elegance in the Theory and Practice of Computation 2013: 445-465 - [c69]Mihai Budiu, Joel Galenson, Gordon D. Plotkin:
The Compiler Forest. ESOP 2013: 21-40 - [c68]Stephen Brookes, Benjamin C. Pierce, Gordon D. Plotkin, Dana S. Scott:
Dedication. MFPS 2013: 3-5 - [c67]Martín Abadi, Jérémy Planul, Gordon D. Plotkin:
Layout Randomization and Nondeterminism. MFPS 2013: 29-50 - 2012
- [j39]Martín Abadi, Gordon D. Plotkin:
On Protection by Layout Randomization. ACM Trans. Inf. Syst. Secur. 15(2): 8:1-8:29 (2012) - [c66]Gordon D. Plotkin:
Concurrency and the Algebraic Theory of Effects - (Abstract). CONCUR 2012: 21-22 - [c65]Ohad Kammar, Gordon D. Plotkin:
Algebraic foundations for effect-dependent optimisations. POPL 2012: 349-360 - 2011
- [c64]Nicolas Oury, Gordon D. Plotkin:
Coloured stochastic multilevel multiset rewriting. CMSB 2011: 171-181 - 2010
- [j38]Martín Abadi, Gordon D. Plotkin:
A Model of Cooperative Threads. Log. Methods Comput. Sci. 6(4) (2010) - [j37]Gordon D. Plotkin, Colin Stirling, Mads Tofte:
Obituary: Robin Milner (1934-2010). Bull. EATCS 101: 12-16 (2010) - [j36]Michael Pedersen, Gordon D. Plotkin:
A Language for Biochemical Systems: Design and Formal Specification. Trans. Comp. Sys. Biology 12: 77-145 (2010) - [c63]Martín Abadi, Gordon D. Plotkin:
On Protection by Layout Randomization. CSF 2010: 337-351 - [c62]Gordon D. Plotkin:
Robin Milner, a Craftsman of Tools for the Mind. LICS 2010: 58-59 - [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
- [j35]Furio Honsell, Gordon D. Plotkin:
On the completeness of order-theoretic models of the lambda-calculus. Inf. Comput. 207(5): 583-594 (2009) - [j34]Klaus Keimel, Gordon D. Plotkin:
Predicate transformers for extended probability and non-determinism. Math. Struct. Comput. Sci. 19(3): 501-539 (2009) - [j33]Rob J. van Glabbeek, Gordon D. Plotkin:
Configuration structures, event structures and Petri nets. Theor. Comput. Sci. 410(41): 4111-4159 (2009) - [c61]Gordon D. Plotkin:
Adequacy for Infinitary Algebraic Effects (Abstract). CALCO 2009: 1-2 - [c60]Philippe Chaput, Vincent Danos, Prakash Panangaden, Gordon D. Plotkin:
Approximating Labelled Markov Processes Again! CALCO 2009: 145-156 - [c59]Gordon D. Plotkin, Matija Pretnar:
Handlers of Algebraic Effects. ESOP 2009: 80-94 - [c58]Philippe Chaput, Vincent Danos, Prakash Panangaden, Gordon D. Plotkin:
Approximating Markov Processes by Averaging. ICALP (2) 2009: 127-138 - [c57]Martín Abadi, Gordon D. Plotkin:
A model of cooperative threads. POPL 2009: 29-40 - [i1]Rob J. van Glabbeek, Gordon D. Plotkin:
Configuration Structures, Event Structures and Petri Nets. CoRR abs/0912.4023 (2009) - 2008
- [c56]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 - [c55]Michael Pedersen, Gordon D. Plotkin:
A Language for Biochemical Systems. CMSB 2008: 63-82 - [c54]Gordon D. Plotkin, Matija Pretnar:
A Logic for Algebraic Effects. LICS 2008: 118-129 - [c53]Gordon D. Plotkin, John Power:
Tensors of Comodels and Models for Operational Semantics. MFPS 2008: 295-311 - 2007
- [j32]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
- [j31]Gordon D. Plotkin:
A domain-theoretic Banach-Alaoglu theorem. Math. Struct. Comput. Sci. 16(2): 299-311 (2006) - [j30]Martin Hyland, Gordon D. Plotkin, John Power:
Combining effects: Sum and tensor. Theor. Comput. Sci. 357(1-3): 70-99 (2006) - [c52]Gordon D. Plotkin:
Some Varieties of Equational Logic. Essays Dedicated to Joseph A. Goguen 2006: 150-156 - [c51]Gordon D. Plotkin:
Hennessy-Plotkin-Brookes Revisited. FSTTCS 2006: 4 - [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
- [c50]Gordon D. Plotkin:
Adequacy for Algebraic Effects with State. CALCO 2005: 51-51 - 2004
- [j29]Gordon D. Plotkin:
Foreword. Ann. Pure Appl. Log. 130(1-3): 1- (2004) - [j28]Gordon D. Plotkin:
The origins of structural operational semantics. J. Log. Algebraic Methods Program. 60-61: 3-15 (2004) - [j27]Gordon D. Plotkin:
A structural approach to operational semantics. J. Log. Algebraic Methods Program. 60-61: 17-139 (2004) - [c49]Rob J. van Glabbeek, Gordon D. Plotkin:
Event Structures for Resolvable Conflict. MFCS 2004: 550-561 - 2003
- [j26]Gordon D. Plotkin, John Power:
Algebraic Operations and Generic Effects. Appl. Categorical Struct. 11(1): 69-94 (2003) - [c48]Gordon D. Plotkin, John Power:
Logic for Computational Effects: Work in Progress. IWFM 2003 - 2002
- [j25]Gordon D. Plotkin:
Three Inadequate Models. Formal Aspects Comput. 13(3-5): 364-385 (2002) - [c47]Gordon D. Plotkin, John Power:
Notions of Computation Determine Monads. FoSSaCS 2002: 342-356 - [c46]Martin Hyland, Gordon D. Plotkin, John Power:
Combining Computational Effects: commutativity & sum. IFIP TCS 2002: 474-484 - [c45]Gordon D. Plotkin, A. John Power:
Computational Effects and Operations: An Overview. Workshop on Domains 2002: 149-163 - 2001
- [c44]Gordon D. Plotkin, John Power:
Adequacy for Algebraic Effects. FoSSaCS 2001: 1-24 - [c43]Gordon D. Plotkin:
Bialgebraic Semantics and Recursion (Extended Abstract). CMCS 2001: 285-288 - [c42]Gordon D. Plotkin, John Power:
Semantics for Algebraic Operations. MFPS 2001: 332-345 - 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. Math. Struct. Comput. Sci. 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]Daniele Turi, Gordon D. Plotkin:
Towards a Mathematical Operational Semantics. LICS 1997: 280-291 - 1996
- [j23]Gordon D. Plotkin:
On a Question of H. Friedman. Inf. Comput. 126(1): 74-77 (1996) - [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]Rob J. van Glabbeek, Gordon D. Plotkin:
Configuration Structures. LICS 1995: 199-209 - [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]Gordon D. Plotkin:
A Semantics for Static Type Inference. Inf. Comput. 109(1/2): 256-299 (1994) - [c28]Pietro Di Gianantonio, Furio Honsell, Silvia Liani, Gordon D. Plotkin:
Countable Non-Determinism and Uncountable Limits. CONCUR 1994: 130-145 - [c27]Gordon D. Plotkin, Glynn Winskel:
Bistructures, Bidomains and Linear Logic. ICALP 1994: 352-363 - [c26]Marcelo P. Fiore, Gordon D. Plotkin:
An Axiomatization of Computationally Adequate Domain Theoretic Models of FPC. LICS 1994: 92-102 - [c25]Gordon D. Plotkin, Martín Abadi, Luca Cardelli:
Subtyping and Parametricity. LICS 1994: 310-319 - 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]Gilles Kahn, Gordon D. Plotkin:
Concrete Domains. Theor. Comput. Sci. 121(1&2): 187-277 (1993) - [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]Gordon D. Plotkin:
Type Theory and Recursion (Extended Abstract). LICS 1993: 374 - [c23]Gordon D. Plotkin, Martín Abadi:
A Logic for Parametric Polymorphism. TLCA 1993: 361-375 - 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]Martín Abadi, Gordon D. Plotkin:
A Logical View of Composition and Refinement. POPL 1991: 323-332 - [c20]Gordon D. Plotkin:
A Semantics for Type Checking. TACS 1991: 1-17 - [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]C. Jones, Gordon D. Plotkin:
A Probabilistic Powerdomain of Evaluations. LICS 1989: 186-195 - [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]Gordon D. Plotkin:
Preface. Inf. Comput. 76(2/3): 93 (1988) - [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. Inf. 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]Gordon D. Plotkin, Colin Stirling:
A Framework for Intuitionistic Modal Logics. TARK 1986: 399-406 - 1985
- [c13]John C. Mitchell, Gordon D. Plotkin:
Abstract Types Have Existential Type. POPL 1985: 37-51 - 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]Krzysztof R. Apt, Gordon D. Plotkin:
A Cook's Tour of Countable Nondeterminism. ICALP 1981: 479-494 - [c8]Matthew Hennessy, Wei Li, Gordon D. Plotkin:
A First Attempt at Translating CSP into CCS. ICDCS 1981: 105-115 - 1980
- [c7]Gordon D. Plotkin:
An operational semantics for CSO. Logic of Programs 1980: 250-252 - [c6]Matthew Hennessy, Gordon D. Plotkin:
A Term Model for CCS. MFCS 1980: 261-274
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]Mogens Nielsen, Gordon D. Plotkin, Glynn Winskel:
Petri Nets, Event Structures and Domains. Semantics of Concurrent Computation 1979: 266-284 - 1978
- [j5]Gordon D. Plotkin:
T^omega as a Universal Domain. J. Comput. Syst. Sci. 17(2): 209-236 (1978) - 1977
- [j4]Gordon D. Plotkin:
LCF Considered as a Programming Language. Theor. Comput. Sci. 5(3): 223-255 (1977) - [c2]Michael B. Smyth, Gordon D. Plotkin:
The Category-Theoretic Solution of Recursive Domain Equations (Extended Abstract). FOCS 1977: 13-17 - [c1]Richard M. Young, Gordon D. Plotkin, R. F. Linz:
Analysis of an Extended Concept-Learning Task. IJCAI 1977: 348 - 1976
- [j3]Gordon D. Plotkin:
A Powerdomain Construction. SIAM J. Comput. 5(3): 452-487 (1976) - 1975
- [j2]Gordon D. Plotkin:
Call-by-Name, Call-by-Value and the lambda-Calculus. Theor. Comput. Sci. 1(2): 125-159 (1975) - 1974
- [j1]Gordon D. Plotkin:
The lambda-Calculus is omega-Incomplete. J. Symb. Log. 39(2): 313-317 (1974)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-05-14 22:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
