Gordon Plotkin

Gordon Plotkin
FRS FRSE MAE
Plotkin in 2005
Born
Gordon David Plotkin

(1946-09-09) 9 September 1946 (age 78)[8]
Glasgow, Scotland
Alma materUniversity of Glasgow (BSc)
University of Edinburgh (PhD)
Known forProgramming Computable Functions
Unbounded nondeterminism
Operational semantics
Domain theory
Awards
Scientific career
FieldsLogic
Mathematics
Computer science
InstitutionsUniversity of Edinburgh
Laboratory for Foundations of Computer Science
School of Informatics
University of Glasgow
ThesisAutomatic methods of inductive inference (1972)
Doctoral advisor
Doctoral students
Websitehomepages.inf.ed.ac.uk/gdp
inf.ed.ac.uk/people/staff/Gordon_Plotkin.html

Gordon David Plotkin (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]

  1. ^ Gordon Plotkin at the Mathematics Genealogy Project
  2. ^ Cite error: The named reference plotkinphd was invoked but never defined (see the help page).
  3. ^ Cardelli, Luca (1982). An algebraic approach to hardware description and verification (PhD thesis). University of Edinburgh. hdl:1842/13308. EThOS uk.bl.ethos.253190.
  4. ^ Gardner, Philippa (1992). Representing logics in type theory (PhD thesis). University of Edinburgh. hdl:1842/14888. EThOS uk.bl.ethos.651333. Free access icon
  5. ^ Gurr, Douglas John (1990). Semantic frameworks for complexity (PhD thesis). University of Edinburgh. hdl:1842/13968. OCLC 475827463. EThOS uk.bl.ethos.651894. Free access icon
  6. ^ Moggi, Eugenio (1999). The partial lambda calculus (PhD thesis). University of Edinburgh. hdl:1842/419.
  7. ^ Wèi, Lǐ (1983). An operational approach to semantics and translation for programming languages (PhD thesis). hdl:1842/6636.
  8. ^ a b 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.)
  9. ^ 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.
  10. ^ Curien, Pierre-Louis (April 2022), Semantics and syntax, between computer science and mathematics (PDF), p. 2
  11. ^ Gordon Plotkin publications indexed by Google Scholar Edit this at Wikidata
  12. ^ Gordon Plotkin author profile page at the ACM Digital Library
  13. ^ Gordon Plotkin publications indexed by the Scopus bibliographic database. (subscription required)
  14. ^ Gordon D. Plotkin at DBLP Bibliography Server Edit this at Wikidata
  15. ^ 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.
  16. ^ 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.
  17. ^ "Symposium for Gordon Plotkin". www.lfcs.inf.ed.ac.uk.