The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Gordon D. Plotkin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  81. Finite Dimensional Vector Spaces Are Complete for Traced Symmetric Monoidal Categories. [Citation Graph (, )][DBLP]


  82. Bistructures, bidomains, and linear logic. [Citation Graph (, )][DBLP]


  83. A brief scientific biography of Robin Milner. [Citation Graph (, )][DBLP]


  84. Approximating Labelled Markov Processes Again! [Citation Graph (, )][DBLP]


  85. Adequacy for Infinitary Algebraic Effects (Abstract). [Citation Graph (, )][DBLP]


  86. A Language for Biochemical Systems. [Citation Graph (, )][DBLP]


  87. On Protection by Layout Randomization. [Citation Graph (, )][DBLP]


  88. Handlers of Algebraic Effects. [Citation Graph (, )][DBLP]


  89. Approximating Markov Processes by Averaging. [Citation Graph (, )][DBLP]


  90. Robin Milner, a Craftsman of Tools for the Mind. [Citation Graph (, )][DBLP]


  91. A Logic for Algebraic Effects. [Citation Graph (, )][DBLP]


  92. A model of cooperative threads. [Citation Graph (, )][DBLP]


  93. Configuration Structures, Event Structures and Petri Nets [Citation Graph (, )][DBLP]


  94. On CSP and the Algebraic Theory of Effects [Citation Graph (, )][DBLP]


  95. Tensors of Comodels and Models for Operational Semantics. [Citation Graph (, )][DBLP]


Search in 0.021secs, Finished in 0.023secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002