Gordon Plotkin

Gordon D. Plotkin
Born	9 September 1946 (1946-09-09) (age 65) Glasgow
Residence	Scotland
Nationality	British
Fields	logician, computer scientist, mathematician
Institutions	University of Edinburgh
Alma mater	Edinburgh
Doctoral advisor	Rod Burstall
Doctoral students	Luca Cardelli (1982) Marcelo Fiore (1994) Philippa Gardner (1992) Martin Hofmann (1995) John Longley (1995) Eugenio Moggi (1988) Mohammad Reza Mousavi (2005) Michael D. Pedersen (2010) David Pym (1990) Alex Simpson (1994) Lǐ Wèi Glynn Winskel (1980)

Gordon D. Plotkin, FRS, FRSE (born 9 September 1946, in Glasgow) is a Scottish computer scientist.

Gordon Plotkin is 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 of 1981 were very influential. He has contributed to many other areas of computer science.

Plotkin is now Professor of Theoretical Computer Science in the School of Informatics at The University of Edinburgh.

Biography

Plotkin received his PhD in 1972 from the University of Edinburgh,^[1] where he studied under Rod Burstall. He has remained at Edinburgh, and was, with Burstall and Milner, a co-founder of the Laboratory for Foundations of Computer Science (LFCS).

Works

• 1975: "Call-by-Name, Call-by Value and the Lambda Calculus".
• A Structural Approach to Operational Semantics by G.D. Plotkin (1981)
• Program Verification and Semantics: Further Work (2004)

Awards

He was elected a Fellow of the Royal Society in 1992, is a Fellow of the Royal Society of Edinburgh and a Member of the Academia Europæa. He is also a winner of the Royal Society Wolfson Research Merit Award.

See also

• Church-Rosser theorem
• Domain theory
• Golem (ILP)
• Informatics
• LFCS
• Operational semantics
• Programming language for Computable Functions
• Unbounded nondeterminism
• University of Edinburgh

References

1. ^ http://www.floc-conference.org/invited-talks.html

External links

• Official home page^{[dead link]}
• Personal home page
• Online publications
• Symposium for Gordon Plotkin

Persondata
Name	Plotkin, Gordon
Alternative names
Short description	Computer Scientist
Date of birth	9 September 1946
Place of birth	Glasgow
Date of death
Place of death

This biography article of a United Kingdom academic is a stub. You can help Wikipedia by expanding it.v ·

This article on a computer specialist of the United Kingdom is a stub. You can help Wikipedia by expanding it.v · Categories: 1946 births Living people British computer scientists Fellows of the Royal Society Members of Academia Europaea Royal Society Wolfson Research Merit Award holders Formal methods people Programming language researchers British Jews Jewish scientists Alumni of the University of Edinburgh Academics of the University of Edinburgh Fellows of the Royal Society of Edinburgh British academic biography stubs British computer specialist stubs Wikimedia Foundation. 2010. Игры ⚽ Поможем сделать НИР Hedared stave church Packet Assembler/Disassembler Look at other dictionaries: Plotkin — can refer to: People * Andrew Plotkin, interactive fiction author * Brian Plotkin, American soccer player * Chuck Plotkin, recording engineer and record producer * Eugene Plotkin, convicted of insider trading * Faith Plotkin, futurist, better… …   Wikipedia Power domains — In denotational semantics and domain theory, power domains are domains of nondeterministic and concurrent computations.The idea of power domains for functions is that a nondeterministic function may be described as a deterministic set valued… …   Wikipedia Operational semantics — In computer science, operational semantics is a way to give meaning to computer programs in a mathematically rigorous way. Operational semantics are classified into two categories: structural operational semantics (or small step semantics)… …   Wikipedia Unbounded nondeterminism — In computer science, unbounded nondeterminism or unbounded indeterminacy is a property of concurrency by which the amount of delay in servicing a request can become unbounded as a result of arbitration of contention for shared resources while… …   Wikipedia Actor model and process calculi — In computer science, the Actor model and process calculi are two closely related approaches to the modelling of concurrent digital computation. See Actor model and process calculi history.There are many similarities between the two approaches,… …   Wikipedia Denotational semantics — In computer science, denotational semantics (initially known as mathematical semantics or Scott–Strachey semantics) is an approach to formalizing the meanings of programming languages by constructing mathematical objects (called denotations)… …   Wikipedia Type system — Type systems Type safety Inferred vs. Manifest Dynamic vs. Static Strong vs. Weak Nominal vs. Structural Dependent typing Duck typing Latent typing Linear typing Uniqueness typing …   Wikipedia Denotational semantics of the Actor model — The denotational semantics of the Actor model is the subject of denotational domain theory for Actors. The historical development of this subject is recounted in [Hewitt 2008b]. Contents 1 Actor fixed point semantics 2 Compositionality in… …   Wikipedia Robin Milner — Arthur John Robin Gorell Milner FRS FRSE (* 13. Januar 1934 in Yealmpton bei Plymouth; † 20. März 2010 in Cambridge) war ein britischer Professor für Informatik und Turingpreisträger. Inhaltsverzeichnis 1 Biographie 2 Auszeichnungen (Auswahl) …   Deutsch Wikipedia List of University of Edinburgh people — is a list of notable graduates and former faculty of the University of Edinburgh in Scotland. The University is associated with nine Nobel Prize winners (Source: http://www.ed.ac.uk/studying/postgraduate/edinburgh/alumni.html)Politics and… …   Wikipedia 18+ © Academic, 2000-2024 Contact us: Technical Support, Advertising Dictionaries export, created on PHP, Joomla, Drupal, WordPress, MODx. Mark and share Search through all dictionaries Translate… Search Internet Share the article and excerpts Direct link … Do a right-click on the link above and select “Copy Link”