Gordon David Plotkin, FRS FRSE MAE (born 9 September 1946)[8] is a theoretical computer scientist in the School of Informatics at the University of Edinburgh. Plotkin is probably best known for his introduction of structural operational semantics (SOS) and his work on denotational semantics. In particular, his notes on A Structural Approach to Operational Semantics were very influential.[9][10] He has contributed to many other areas of computer science.[11][12][13][14][15][16][17]
^Gordon Plotkin at the Mathematics Genealogy Project
^Cite error: The named reference plotkinphd was invoked but never defined (see the help page).
^Cardelli, Luca (1982). An algebraic approach to hardware description and verification (PhD thesis). University of Edinburgh. hdl:1842/13308. EThOS uk.bl.ethos.253190.
^Gardner, Philippa (1992). Representing logics in type theory (PhD thesis). University of Edinburgh. hdl:1842/14888. EThOS uk.bl.ethos.651333.
^Gurr, Douglas John (1990). Semantic frameworks for complexity (PhD thesis). University of Edinburgh. hdl:1842/13968. OCLC 475827463. EThOS uk.bl.ethos.651894.
^Moggi, Eugenio (1999). The partial lambda calculus (PhD thesis). University of Edinburgh. hdl:1842/419.
^Wèi, Lǐ (1983). An operational approach to semantics and translation for programming languages (PhD thesis). hdl:1842/6636.
^ ab
Anon (2013). "Plotkin, Prof. Gordon David". Who's Who (online Oxford University Press ed.). Oxford: A & C Black. doi:10.1093/ww/9780199540884.013.U31011. (Subscription or UK public library membership required.)
^Crary, Karl; Harper, Robert (2007). "Syntactic Logical Relations for Polymorphic and Recursive Types". Electronic Notes in Theoretical Computer Science. 172: 259. doi:10.1016/j.entcs.2007.02.010.
^Curien, Pierre-Louis (April 2022), Semantics and syntax, between computer science and mathematics(PDF), p. 2
^Gordon Plotkin publications indexed by Google Scholar
^Gordon Plotkin author profile page at the ACM Digital Library
^Gordon Plotkin publications indexed by the Scopus bibliographic database. (subscription required)
^Gordon D. Plotkin at DBLP Bibliography Server
^Mitchell, J. C.; Plotkin, G. D. (1988). "Abstract types have existential type". ACM Transactions on Programming Languages and Systems. 10 (3): 470. doi:10.1145/44501.45065. S2CID 1222153.
^Abadi, M. N.; Burrows, M.; Lampson, B.; Plotkin, G. (1993). "A calculus for access control in distributed systems" (PDF). ACM Transactions on Programming Languages and Systems. 15 (4): 706. CiteSeerX 10.1.1.72.3756. doi:10.1145/155183.155225. hdl:1842/207. S2CID 13260508.
^"Symposium for Gordon Plotkin". www.lfcs.inf.ed.ac.uk.
Gordon David Plotkin, FRS FRSE MAE (born 9 September 1946) is a theoretical computer scientist in the School of Informatics at the University of Edinburgh...
producer Diana Plotkin, American political activist Faith Plotkin (born 1947), American writer Gabriel Plotkin, Melvin Capital CEO GordonPlotkin (born 1946)...
languages now known as function-level programming languages. In 1977, GordonPlotkin introduces Programming Computable Functions, an abstract typed functional...
particularly useful in bioinformatics and natural language processing. GordonPlotkin and Ehud Shapiro laid the initial theoretical foundation for inductive...
Computable Functions (PCF), small theoretical programming language by GordonPlotkin. Dana S. Scott. "A type-theoretical alternative to ISWIM, CUCH, OWHY"...
Kwiatkowska – for probabilistic model checking for the data-rich world 2018 GordonPlotkin – for contributions to semantic framework for programming languages...
from the University of Edinburgh in 1982 for research supervised by GordonPlotkin. Before joining the University of Oxford in 2014, and Microsoft Research...
Samson Abramsky John C. Baez Bob Coecke Joachim Lambek Valeria de Paiva GordonPlotkin Dana Scott David Spivak Categorical quantum mechanics ZX-calculus DisCoCat...
1990 for research on semantic frameworks using monads supervised by GordonPlotkin. Gurr began his career as an academic teaching maths and computing at...
and returns the non-deterministic choice of them. The Plotkin powertheory (after GordonPlotkin) has the following axioms: Idempotency: x ∪ x = x Commutativity:...
for quite some time, it wasn't until 1988 that John C. Mitchell and GordonPlotkin established the formal theory under the slogan: "Abstract [data] types...
Springer. ISBN 978-1-4020-0608-1. Robert Harper, Furio Honsell and GordonPlotkin. A Framework For Defining Logics. Journal of the Association for Computing...
publications indexed by Microsoft Academic Dana Scott interviewed by GordonPlotkin, as part of the Association for Computing Machinery series of interviews...
Computable Functions (PCF) is a typed functional language introduced by GordonPlotkin in 1977, based on previous unpublished material by Dana Scott. It can...
Minsky Tom M. Mitchell Allen Newell Andrew Ng Seymour Papert Paolo Petta GordonPlotkin Ruslan Salakhutdinov Arthur Samuel Roger Schank Anil Seth Aaron Sloman...
investigators in the area of programming languages". The inaugural winner GordonPlotkin received his prize in 2012 but delivered his public lecture in 2013...
defined using a structured operational semantics in the style invented by GordonPlotkin. As with most process algebras, PEPA is a parsimonious language. It...
University of Edinburgh. hdl:1842/8124. EThOS uk.bl.ethos.379389. Plotkin, Gordon (1972). Automatic methods of inductive inference (PhD thesis). University...
Alma mater University of Edinburgh University of Pisa Known for Monad Scientific career Institutions University of Genoa Doctoral advisor GordonPlotkin...
Language, and Interaction: Essays in Honour of Robin Milner, edited by GordonPlotkin, Colin Stirling and Mads Tofte. The MIT Press, 2000. ISBN 0-262-16188-5...
language processing. Building on earlier work on Inductive inference, GordonPlotkin was the first to formalise induction in a clausal setting around 1970...
Mirella Lapata Leonid Libkin Ursula Martin Johanna Moore Michael O'Boyle GordonPlotkin Don Sannella Mark Steedman Don Sannella Keith Stenning Amos Storkey...