| 2009 |
|---|
| 94 | EE | Gordon D. Plotkin,
Matija Pretnar:
Handlers of Algebraic Effects.
ESOP 2009: 80-94 |
| 93 | EE | Martín Abadi,
Gordon D. Plotkin:
A model of cooperative threads.
POPL 2009: 29-40 |
| 92 | EE | Furio Honsell,
Gordon D. Plotkin:
On the completeness of order-theoretic models of the lambda-calculus.
Inf. Comput. 207(5): 583-594 (2009) |
| 2008 |
|---|
| 91 | EE | Michael Pedersen,
Gordon D. Plotkin:
A Language for Biochemical Systems.
CMSB 2008: 63-82 |
| 90 | EE | Gordon D. Plotkin,
Matija Pretnar:
A Logic for Algebraic Effects.
LICS 2008: 118-129 |
| 89 | EE | 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 |
| 88 | EE | Gordon D. Plotkin,
John Power:
Tensors of Comodels and Models for Operational Semantics.
Electr. Notes Theor. Comput. Sci. 218: 295-311 (2008) |
| 2007 |
|---|
| 87 | EE | 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 |
|---|
| 86 | | Corrado Priami,
Gordon D. Plotkin:
Transactions on Computational Systems Biology VI
Springer 2006 |
| 85 | EE | Gordon D. Plotkin:
Some Varieties of Equational Logic.
Essays Dedicated to Joseph A. Goguen 2006: 150-156 |
| 84 | EE | Gordon D. Plotkin:
Hennessy-Plotkin-Brookes Revisited.
FSTTCS 2006: 4 |
| 83 | EE | Gordon D. Plotkin:
A domain-theoretic Banach-Alaoglu theorem.
Mathematical Structures in Computer Science 16(2): 299-311 (2006) |
| 82 | EE | Martin Hyland,
Gordon D. Plotkin,
John Power:
Combining effects: Sum and tensor.
Theor. Comput. Sci. 357(1-3): 70-99 (2006) |
| 2005 |
|---|
| 81 | EE | Gordon D. Plotkin:
Adequacy for Algebraic Effects with State.
CALCO 2005: 51-51 |
| 80 | EE | Regina Tix,
Klaus Keimel,
Gordon D. Plotkin:
Semantic Domains for Combining Probability and Non-Determinism.
Electr. Notes Theor. Comput. Sci. 129: 1-104 (2005) |
| 2004 |
|---|
| 79 | EE | Rob J. van Glabbeek,
Gordon D. Plotkin:
Event Structures for Resolvable Conflict.
MFCS 2004: 550-561 |
| 78 | EE | Gordon D. Plotkin:
Foreword.
Ann. Pure Appl. Logic 130(1-3): 1- (2004) |
| 77 | EE | Gordon D. Plotkin,
A. John Power:
Computational Effects and Operations: An Overview.
Electr. Notes Theor. Comput. Sci. 73: 149-163 (2004) |
| 76 | | Gordon D. Plotkin:
A structural approach to operational semantics.
J. Log. Algebr. Program. 60-61: 17-139 (2004) |
| 75 | EE | Gordon D. Plotkin:
The origins of structural operational semantics.
J. Log. Algebr. Program. 60-61: 3-15 (2004) |
| 2003 |
|---|
| 74 | EE | Gordon D. Plotkin,
John Power:
Logic for Computational Effects: Work in Progress.
IWFM 2003 |
| 73 | EE | Gordon D. Plotkin,
John Power:
Algebraic Operations and Generic Effects.
Applied Categorical Structures 11(1): 69-94 (2003) |
| 2002 |
|---|
| 72 | EE | Gordon D. Plotkin,
John Power:
Notions of Computation Determine Monads.
FoSSaCS 2002: 342-356 |
| 71 | | Martin Hyland,
Gordon D. Plotkin,
John Power:
Combining Computational Effects: commutativity & sum.
IFIP TCS 2002: 474-484 |
| 70 | EE | Gordon D. Plotkin:
Three Inadequate Models.
Formal Asp. Comput. 13(3-5): 364-385 (2002) |
| 2001 |
|---|
| 69 | EE | Gordon D. Plotkin,
John Power:
Adequacy for Algebraic Effects.
FoSSaCS 2001: 1-24 |
| 68 | EE | Gordon D. Plotkin:
Bialgebraic Semantics and Recursion (Extended Abstract).
Electr. Notes Theor. Comput. Sci. 44(1): (2001) |
| 67 | EE | Gordon D. Plotkin,
John Power:
Semantics for Algebraic Operations.
Electr. Notes Theor. Comput. Sci. 45: (2001) |
| 2000 |
|---|
| 66 | | Gordon D. Plotkin,
Colin Stirling,
Mads Tofte:
Proof, Language, and Interaction, Essays in Honour of Robin Milner
The MIT Press 2000 |
| 65 | EE | Gordon D. Plotkin,
John Power,
Donald Sannella,
Robert D. Tennent:
Lax Logical Relations.
ICALP 2000: 85-102 |
| 64 | EE | Gordon D. Plotkin:
Some New Directions in the Syntax and Semantics of Formal Languages.
IFIP TCS 2000: 596 |
| 63 | EE | Alex K. Simpson,
Gordon D. Plotkin:
Complete Axioms for Categorical Fixed-Point Operators.
LICS 2000: 30-41 |
| 62 | | Gordon D. Plotkin,
Colin Stirling,
Mads Tofte:
A brief scientific biography of Robin Milner.
Proof, Language, and Interaction 2000: 1-18 |
| 61 | | Pierre-Louis Curien,
Gordon D. Plotkin,
Glynn Winskel:
Bistructures, bidomains, and linear logic.
Proof, Language, and Interaction 2000: 21-54 |
| 1999 |
|---|
| 60 | EE | Marcelo P. Fiore,
Gordon D. Plotkin,
Daniele Turi:
Abstract Syntax and Variable Binding.
LICS 1999: 193-202 |
| 59 | EE | 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-242 |
| 58 | | Gordon D. Plotkin:
Full abstraction, totality and PCF.
Mathematical Structures in Computer Science 9(1): 1-20 (1999) |
| 1997 |
|---|
| 57 | | Andrew Barber,
Philippa Gardner,
Masahito Hasegawa,
Gordon D. Plotkin:
From Action Calculi to Linear Logic.
CSL 1997: 78-97 |
| 56 | EE | Marcelo P. Fiore,
Gordon D. Plotkin,
A. John Power:
Complete Cuboidal Sets in Axiomatic Domain Theory.
LICS 1997: 268-279 |
| 55 | EE | Daniele Turi,
Gordon D. Plotkin:
Towards a Mathematical Operational Semantics.
LICS 1997: 280-291 |
| 1996 |
|---|
| 54 | | Marcelo P. Fiore,
Gordon D. Plotkin:
An Extension of Models of Axiomatic Domain Theory to Models of Synthetic Domain Theory.
CSL 1996: 129-149 |
| 53 | | Gordon D. Plotkin:
On a Question of H. Friedman.
Inf. Comput. 126(1): 74-77 (1996) |
| 1995 |
|---|
| 52 | | 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
Springer 1995 |
| 51 | | Rob J. van Glabbeek,
Gordon D. Plotkin:
Configuration Structures
LICS 1995: 199-209 |
| 50 | | Pietro Di Gianantonio,
Furio Honsell,
Gordon D. Plotkin:
Uncountable Limits and the lambda Calculus.
Nord. J. Comput. 2(2): 126-145 (1995) |
| 1994 |
|---|
| 49 | | Pietro Di Gianantonio,
Furio Honsell,
Silvia Liani,
Gordon D. Plotkin:
Countable Non-Determinism and Uncountable Limits.
CONCUR 1994: 130-145 |
| 48 | | Gordon D. Plotkin,
Glynn Winskel:
Bistructures, Bidomains and Linear Logic.
ICALP 1994: 352-363 |
| 47 | | Gordon D. Plotkin,
Martín Abadi,
Luca Cardelli:
Subtyping and Parametricity
LICS 1994: 310-319 |
| 46 | | Marcelo P. Fiore,
Gordon D. Plotkin:
An Axiomatization of Computationally Adequate Domain Theoretic Models of FPC
LICS 1994: 92-102 |
| 45 | | Gordon D. Plotkin:
A Semantics for Static Type Inference
Inf. Comput. 109(1/2): 256-299 (1994) |
| 1993 |
|---|
| 44 | | Gordon D. Plotkin:
Type Theory and Recursion (Extended Abstract)
LICS 1993: 374 |
| 43 | | Gordon D. Plotkin,
Martín Abadi:
A Logic for Parametric Polymorphism.
TLCA 1993: 361-375 |
| 42 | EE | 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) |
| 41 | | John C. Reynolds,
Gordon D. Plotkin:
On Functors Expressible in the Polymorphic Typed Lambda Calculus
Inf. Comput. 105(1): 1-29 (1993) |
| 40 | EE | Robert Harper,
Furio Honsell,
Gordon D. Plotkin:
A Framework for Defining Logics.
J. ACM 40(1): 143-184 (1993) |
| 39 | | Martín Abadi,
Gordon D. Plotkin:
A Logical View of Composition.
Theor. Comput. Sci. 114(1): 3-30 (1993) |
| 38 | | Gilles Kahn,
Gordon D. Plotkin:
Concrete Domains.
Theor. Comput. Sci. 121(1&2): 187-277 (1993) |
| 37 | | Gordon D. Plotkin:
Set-Theoretical and Other Elementary Models of the lambda-Calculus.
Theor. Comput. Sci. 121(1&2): 351-409 (1993) |
| 1991 |
|---|
| 36 | EE | Martín Abadi,
Michael Burrows,
Butler W. Lampson,
Gordon D. Plotkin:
A Calculus for Access Control in Distributed Systems.
CRYPTO 1991: 1-23 |
| 35 | | Martín Abadi,
Gordon D. Plotkin:
A Logical View of Composition and Refinement.
POPL 1991: 323-332 |
| 34 | | Gordon D. Plotkin:
A Semantics for Type Checking.
TACS 1991: 1-17 |
| 33 | EE | 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) |
| 32 | | 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) |
| 1990 |
|---|
| 31 | | Martín Abadi,
Gordon D. Plotkin:
A Per Model of Polymorphism and Recursive Types
LICS 1990: 355-365 |
| 1989 |
|---|
| 30 | | C. Jones,
Gordon D. Plotkin:
A Probabilistic Powerdomain of Evaluations
LICS 1989: 186-195 |
| 29 | | Martín Abadi,
Benjamin C. Pierce,
Gordon D. Plotkin:
Faithful Ideal Models for Recursive Polymorphic Types
LICS 1989: 216-225 |
| 28 | | Martín Abadi,
Luca Cardelli,
Benjamin C. Pierce,
Gordon D. Plotkin:
Dynamic Typing in a Statically-Typed Language.
POPL 1989: 213-227 |
| 1988 |
|---|
| 27 | EE | John C. Mitchell,
Gordon D. Plotkin:
Abstract Types Have Existential Type.
ACM Trans. Program. Lang. Syst. 10(3): 470-502 (1988) |
| 26 | | Gordon D. Plotkin:
Preface
Inf. Comput. 76(2/3): 93 (1988) |
| 1987 |
|---|
| 25 | | Robert Harper,
Furio Honsell,
Gordon D. Plotkin:
A Framework for Defining Logics
LICS 1987: 194-204 |
| 24 | | Peter D. Mosses,
Gordon D. Plotkin:
On Proving Limiting Completeness.
SIAM J. Comput. 16(1): 179-194 (1987) |
| 1986 |
|---|
| 23 | | Gordon D. Plotkin,
Colin Stirling:
A Framework for Intuitionistic Modal Logics.
TARK 1986: 399-406 |
| 22 | | David B. MacQueen,
Gordon D. Plotkin,
Ravi Sethi:
An Ideal Model for Recursive Polymorphic Types
Information and Control 71(1/2): 95-130 (1986) |
| 21 | EE | Krzysztof R. Apt,
Gordon D. Plotkin:
Countable nondeterminism and random assignment.
J. ACM 33(4): 724-767 (1986) |
| 1985 |
|---|
| 20 | | John C. Mitchell,
Gordon D. Plotkin:
Abstract Types Have Existential Type.
POPL 1985: 37-51 |
| 1984 |
|---|
| 19 | | Gilles Kahn,
David B. MacQueen,
Gordon D. Plotkin:
Semantics of Data Types, International Symposium, Sophia-Antipolis, France, June 27-29, 1984, Proceedings
Springer 1984 |
| 18 | | David B. MacQueen,
Gordon D. Plotkin,
Ravi Sethi:
An Ideal Model for Recursive Polymorphic Types.
POPL 1984: 165-174 |
| 1982 |
|---|
| 17 | | Gordon D. Plotkin:
A Powerdomain for Countable Non-Determinism (Extended Abstract).
ICALP 1982: 418-428 |
| 16 | | Michael B. Smyth,
Gordon D. Plotkin:
The Category-Theoretic Solution of Recursive Domain Equations.
SIAM J. Comput. 11(4): 761-783 (1982) |
| 1981 |
|---|
| 15 | | Krzysztof R. Apt,
Gordon D. Plotkin:
A Cook's Tour of Countable Nondeterminism.
ICALP 1981: 479-494 |
| 14 | | Matthew Hennessy,
W. Li,
Gordon D. Plotkin:
A First Attempt at Translating CSP into CCS.
ICDCS 1981: 105-115 |
| 13 | | Mogens Nielsen,
Gordon D. Plotkin,
Glynn Winskel:
Petri Nets, Event Structures and Domains, Part I.
Theor. Comput. Sci. 13: 85-108 (1981) |
| 1980 |
|---|
| 12 | | Gordon D. Plotkin:
An operational semantics for CSO.
Logic of Programs 1980: 250-252 |
| 11 | | Matthew Hennessy,
Gordon D. Plotkin:
A Term Model for CCS.
MFCS 1980: 261-274 |
| 1979 |
|---|
| 10 | | Gordon D. Plotkin:
Dijkstras Predicate Transformers & Smyth's Power Domaine.
Abstract Software Specifications 1979: 527-553 |
| 9 | | Matthew Hennessy,
Gordon D. Plotkin:
Full Abstraction for a Simple Parallel Programming Language.
MFCS 1979: 108-120 |
| 8 | | Mogens Nielsen,
Gordon D. Plotkin,
Glynn Winskel:
Petri Nets, Event Structures and Domains.
Semantics of Concurrent Computation 1979: 266-284 |
| 1978 |
|---|
| 7 | | Gordon D. Plotkin:
T^omega as a Universal Domain.
J. Comput. Syst. Sci. 17(2): 209-236 (1978) |
| 1977 |
|---|
| 6 | | Michael B. Smyth,
Gordon D. Plotkin:
The Category-Theoretic Solution of Recursive Domain Equations (Extended Abstract)
FOCS 1977: 13-17 |
| 5 | | Richard M. Young,
Gordon D. Plotkin,
R. F. Linz:
Analysis of an Extended Concept-Learning Task.
IJCAI 1977: 348 |
| 4 | | Gordon D. Plotkin:
LCF Considered as a Programming Language.
Theor. Comput. Sci. 5(3): 225-255 (1977) |
| 1976 |
|---|
| 3 | | Gordon D. Plotkin:
A Powerdomain Construction.
SIAM J. Comput. 5(3): 452-487 (1976) |
| 1975 |
|---|
| 2 | | Gordon D. Plotkin:
Call-by-Name, Call-by-Value and the lambda-Calculus.
Theor. Comput. Sci. 1(2): 125-159 (1975) |
| 1974 |
|---|
| 1 | | Gordon D. Plotkin:
The lambda-Calculus is omega-Incomplete.
J. Symb. Log. 39(2): 313-317 (1974) |
