Gordon Plotkin

Gordon Plotkin's AcademicInfluence.com Rankings

Gordon Plotkin

Computer Science

#131

World Rank

#138

Historical Rank

Database

#474

World Rank

#496

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Why Is Gordon Plotkin Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Gordon David Plotkin, 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 and his work on denotational semantics. In particular, his notes on A Structural Approach to Operational Semantics were very influential. He has contributed to many other areas of computer science.

(See a Problem?)

Gordon Plotkin's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

A structural approach to operational semantics (2004) (2523)
A framework for defining logics (1993) (1333)
LCF Considered as a Programming Language (1977) (1166)
Call-by-Name, Call-by-Value and the lambda-Calculus (1975) (1027)
Petri Nets, Event Structures and Domains, Part I (1981) (944)
A calculus for access control in distributed systems (1991) (729)
A Powerdomain Construction (1976) (706)
The category-theoretic solution of recursive domain equations (1977) (629)
A Note on Inductive Generalization (2008) (560)
Petri Nets, Event Structures and Domains (1979) (518)
Abstract types have existential type (1988) (436)
Abstract syntax and variable binding (1999) (419)
Towards a mathematical operational semantics (1997) (409)
A probabilistic powerdomain of evaluations (1989) (386)
Proof, language, and interaction: essays in honour of Robin Milner (2000) (376)
An ideal model for recursive polymorphic types (1984) (372)
The origins of structural operational semantics (2004) (367)
Dynamic typing in a statically-typed language (1989) (343)
Notions of Computation Determine Monads (2002) (318)
Full Abstraction for a Simple Parallel Programming Language (1979) (310)
Algebraic Operations and Generic Effects (2003) (283)
Abstract types have existential types (1985) (280)
A Logic for Parametric Polymorphism (1993) (233)
Automatic Methods of Inductive Inference (1972) (229)
Handlers of Algebraic Effects (2009) (203)
Countable nondeterminism and random assignment (1986) (200)
Combining effects: Sum and tensor (2006) (194)
Situation Theory and its Applications (1995) (179)
Tω as a Universal Domain (1978) (159)
Adequacy for Algebraic Effects (2001) (158)
Computational logic: essays in honor of Alan Robinson (1991) (158)
An Operational Semantics for CSP. (1982) (158)
Handling Algebraic Effects (2013) (146)
Complete axioms for categorical fixed-point operators (2000) (145)
A Further Note on Inductive Generalization (2008) (139)
Semantic Domains for Combining Probability and Non-Determinism (2005) (137)
A Framework for Intuitionistic Modal Logics (1988) (119)
Configuration structures (1995) (112)
Computational Effects and Operations: An Overview (2004) (110)
Dynamic typing in a statically typed language (1991) (104)
An axiomatisation of computationally adequate domain theoretic models of FPC (1994) (96)
Configuration structures, event structures and Petri nets (2009) (96)
A Term Model for CCS (1980) (94)
Algebraic foundations for effect-dependent optimisations (2012) (94)
A Logical View of Composition (1993) (93)
Concrete Domains (1993) (93)
A PER model of polymorphism and recursive types (1990) (92)
Semantics of Data Types (1984) (91)
Finite Dimensional Vector Spaces Are Complete for Traced Symmetric Monoidal Categories (2008) (90)
Transactions on Computational Systems Biology I (2005) (88)
On Protection by Layout Randomization (2010) (86)
Set-Theoretical and Other Elementary Models of the lambda-Calculus (1993) (74)
Scaling network verification using symmetry and surgery (2016) (73)
A framework for intuitionistic modal logics: extended abstract (1986) (72)
Semantics for Algebraic Operations (2001) (71)
Quantitative Algebraic Reasoning (2016) (69)
A Powerdomain for Countable Non-Determinism (Extended Abstract) (1982) (66)
Abstract Syntax and Variable Binding (Extended Abstract) (2003) (57)
Full completeness of the multiplicative linear logic of Chu spaces (1999) (57)
Mixed powerdomains for probability and nondeterminism (2016) (57)
Combining algebraic effects with continuations (2007) (55)
On Functors Expressible in the Polymorphic Typed Lambda Calculus (1993) (54)
Logical frameworks (1991) (53)
A Cook's Tour of Countable Nondeterminism (1981) (52)
A simple differentiable programming language (2019) (50)
A Language for Biochemical Systems: Design and Formal Specification (2010) (48)
Set-theoretical and Other Elementary Models of the -calculus Part 1: a Set-theoretical Deenition of Applica- Tion 1 Introduction (2007) (44)
A Logic for Algebraic Effects (2008) (44)
Type theory and recursion (1993) (42)
The lambda-Calculus is omega-Incomplete (1974) (42)
A model of cooperative threads (2009) (40)
Full abstraction, totality and PCF (1999) (39)
Combining Computational Effects: commutativity & sum (2002) (39)
Approximating Markov Processes by Averaging (2009) (39)
Lax Logical Relations (2000) (37)
Event Structures for Resolvable Conflict (2004) (35)
Uncountable Limits and the lambda Calculus (1995) (34)
Dijkstras Predicate Transformers & Smyth's Power Domaine (1979) (33)
A logical view of composition and refinement (1991) (33)
Tensors of Comodels and Models for Operational Semantics (2008) (32)
From Action Calculi to Linear Logic (1997) (31)
On the axiomatizability of quantitative algebras (2017) (31)
COMBINING COMPUTATIONAL EFFECTS : COMMUTATIVITY AND SUM (2001) (30)
Logical Full Abstraction and PCF (2000) (29)
An Extension of Models of Axiomatic Domain Theory to Models of Synthetic Domain Theory (1996) (29)
Complete cuboidal sets in axiomatic domain theory (1997) (29)
Reverse derivative categories (2019) (28)
A Language for Biochemical Systems (2008) (27)
A domain-theoretic Banach–Alaoglu theorem (2006) (26)
Type Theory and Recursion Extended Abstract (2003) (25)
Faithful ideal models for recursive polymorphic types (1989) (24)
On Hierarchical Graphs: Reconciling Bigraphs, Gs-monoidal Theories and Gs-graphs (2014) (24)
The λ-calculus is ω-incomplete (1974) (24)
A Semantics for Static Type Inference (1994) (23)
From Semantics to Computer Science: Essays in Honour of Gilles Kahn (2009) (23)
A Set-Theoretical Definition of Application (2003) (22)
Multi-level modelling via stochastic multi-level multiset rewriting† (2013) (20)
Analysis of an Extended Concept-Learning Task (1977) (20)
Some Varieties of Equational Logic (2006) (20)
Types for the Scott Numerals (1993) (19)
An Algebraic Theory of Markov Processes (2018) (19)
A First Attempt at Translating CSP into CCS (1981) (19)
Dependent Types and Fibred Computational Effects (2016) (18)
Predicate transformers for extended probability and non-determinism (2009) (18)
An Illative Theory of Relations (2003) (18)
Bistructures, bidomains, and linear logic (1994) (17)
On a Question of H. Friedman (1996) (17)
Pict: A Programming Language Based on the Pi-Calculus (2000) (17)
Subtyping and parametricity (1994) (16)
Interacting with Large Distributed Datasets Using Sketch (2016) (16)
Connguration Structures (1995) (16)
Practical steps to digital organism models, from laboratory model species to 'Crops in silico. (2019) (15)
Editors' note: bibliometrics and the curators of orthodoxy (2009) (13)
Bistructures, Bidomains and Linear Logic (1994) (13)
Semantics of Data Types: International Symposium Sophia-Antipolis, France, June 27-29, 1984. Proceedings (1984) (12)
A High-Level Language for Rule-Based Modelling (2015) (12)
Teams can see pomsets (1996) (12)
Layout Randomization and Nondeterminism (2013) (12)
A Complete Axiom System for Finite-State Probabilistic Processes (2000) (12)
Chromar, a language of parameterised agents (2017) (12)
Combining continuations with other effects (2004) (12)
Logic for Computational Effects: Work in Progress (2003) (12)
The researchers' bible (1985) (12)
Bialgebraic Semantics and Recursion (Extended Abstract) (2001) (11)
A Type-Theoretic Interpretation of Standard ML (2000) (10)
Coloured stochastic multilevel multiset rewriting (2011) (10)
Finite conjunctive nondeterminism (1987) (10)
Foundations of Differential Dataflow (2015) (9)
An operational semantics for CSO (1980) (9)
Tensor of Quantitative Equational Theories (2021) (9)
Situation Theory and its Applications, Volume 2 (1992) (9)
Free complete Wasserstein algebras (2018) (9)
Fixed-Points for Quantitative Equational Logics (2021) (8)
A Calculus of Communicating Systems with Label Passing—Ten Years After (2000) (8)
The Differentiable Curry (2019) (8)
Retraction notice to "Semantic Domains for Combining Probability and Non-Determinism" [Electron. Notes Theoret. Comput. Sci. 129 (2005) 1-104] (2009) (8)
On Proving Limiting Completeness (1987) (8)
Model Checking Algorithms for the µ-Calculus (2000) (7)
A Semantics for Type Checking (1991) (7)
A Calculus of Chemical Systems (2013) (7)
Papers presented at the second annual Workshop on Logical environments (1993) (7)
Chromar, a Rule-based Language of Parameterised Objects (2018) (6)
The Foundations of Esterel (2000) (6)
Proceedings of the Second International Conference on Typed Lambda Calculi and Applications (1995) (6)
Explorer Semantic Domains for Combining Probability and NonDeterminism (2009) (5)
The Compiler Forest (2013) (5)
Adequacy for Algebraic Effects with State (2005) (5)
Countable Non-Determinism and Uncountable Limits (1994) (5)
λ-Calculus, Multiplicities, and the π-Calculus (2000) (4)
Approximating Labelled Markov Processes Again! (2009) (4)
A Calculus for Access Control in Distributed (1993) (4)
Adequacy for infinitary algebraic effects (2009) (4)
Algebra, Meaning, and Computation (2006) (4)
Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (2012) (4)
Typed lambda calculi and applications : Second International Conference on Typed Lambda Calculi and Applications, TLCA '95, Edinburgh, United Kingdom, April 10-12, 1995 : proceedings (1995) (4)
Initial Algebras and Final Coalgebras Consisting of Nondeterministic Finite Trace Strategies (2018) (4)
Some Varieties of Equational Logic ( Extended Abstract ) (2006) (4)
Adequacy for Infinitary Algebraic Effects (Abstract) (2009) (4)
Teams can see pomsets (preliminary version) (1997) (3)
Combining the Typed λ-Calculus with CCS (2000) (3)
Programming Languages and Systems (2003) (3)
On the completeness of order-theoretic models of the lambda-calculus (2009) (3)
On the completeness of order-theoretic models of the λ-calculus (2007) (3)
On CSP and the Algebraic Theory of Effects (2010) (3)
Smart Choices and the Selection Monad (2020) (2)
Notes on the Chu construction and Recursion (2005) (2)
Hennessy-Plotkin-Brookes Revisited (2006) (2)
On a Question of Friedman (1995) (2)
Partial Recursive Functions and Finality (2013) (2)
Properties of Fixed Points in Axiomatic Domain Theory (1998) (2)
Chromar, a language of parameterised objects (2017) (2)
A compositional generalisation of logical relationsGordon Plotkin (1998) (2)
Automata, Languages and Programming (1985) (2)
Programming and Reasoning with Algebraic Effects and Effect Handlers (NII Shonan Meeting 146) (2019) (1)
Quantitative Equational Reasoning (2020) (1)
Finite Conjunctive Nondeterminism (Extended Abstract) (1987) (1)
The Tile Model (2000) (1)
Concurrency and the Algebraic Theory of Effects - (Abstract) (2012) (1)
Type Dynamic (2010) (1)
Explorer Interacting with Large Distributed Datasets using Sketch (2016) (1)
Proc. of the international symposium on Semantics of data types (1984) (1)
T^omega as a Universal Domain (1978) (1)
Logical Frameworks: Introduction (1991) (1)
Complete Cuboidal Sets in Axiomatic Domain Theory (Extended Abstract) (2003) (1)
Explorer Combining Effects : Sum and Tensor (2006) (1)
Algebraic Derivation of an Operational Semantics (2000) (1)
THE A-CALCULUS IS c-INCOMPLETE (1974) (1)
A complete equational axiomatisation of partial differentiation (2020) (1)
Enhancing the Tractability of Rely/Guarantee Specifications in the Development of Interfering Operations (2000) (1)
~q Operational Semantics for Csp (0)
Books received (2012) (0)
Some New Directions in the Syntax and Semantics of Formal Languages (2000) (0)
Dijkstra's Predicate Transfoi~iersandsmyth's Powerdomains (0)
Notes on Event structures and Chu (2005) (0)
Robin Milner: 13 January 1934–20 March 2010 (2010) (0)
Axioms for Definability and Full Completeness (2000) (0)
Alonzo Church Award 2018 - Call for Nominations (2018) (0)
Edinburgh Research Explorer Layout Randomization and Nondeterminism (2016) (0)
Horizons of the Mind. A Tribute to Prakash Panangaden (2014) (0)
On Proving Limited Completeness (1985) (0)
Program semantics and infinite regular terms (2009) (0)
A Fixedpoint Approach to (Co)Inductive and (Co)Datatype Definitions (2000) (0)
Three Inadequate Models (2002) (0)
Preface (1988) (0)
Controlling Eeects Thesis Committee (1996) (0)
Edinburgh Research Explorer A Model of Cooperative Threads (2017) (0)
Foreword (2004) (0)
Trios in Concert (2000) (0)
Situation Theory Applications Edited By (2010) (0)
Edinburgh Research Explorer Some Varieties of Equational Logic (Extended Abstract) (2006) (0)
Explorer Foundations of Differential Dataflow (2014) (0)
Conference Organization (2013) (0)
Recursion does not always help (2022) (0)
Constructively Formalizing Automata Theory (2000) (0)
Propositional Logics for the Lawvere Quantale (2023) (0)
Edinburgh Combining Algebraic Effects with Continuations (2018) (0)
Concurrent Objects as Mobile Processes (2000) (0)
Robin Milner, a Craftsman of Tools for the Mind (2010) (0)
From Semantics to Computer Science: Preface (2009) (0)
Notions of Computability for General DatatypesCase for Support to accompany EPS ( RP ) (2007) (0)
Formal Aspects of Computing Three Inadequate Models (0)
On the Star Height of Unary Regular Behaviours (2000) (0)
IGR Report on EPSRC Grant GR/L89532: Notions of computability for general datatypes (2001) (0)
Logical Frameworks: Preface (1991) (0)
Explorer Combining Algebraic Effects with Continuations (2007) (0)
Lazy Functions and Mobile Processes (2000) (0)
Constructive Category Theory (2000) (0)
Cartesian closed categories of separable Scott domains (2014) (0)
The tower of informatics models (2009) (0)
Obituary: Robin Milner (1934-2010) (2010) (0)
Edinburgh Research Explorer Free complete Wasserstein algebras (2018) (0)
TU as a Universal Domain (1977) (0)
From Banach to Milner: Metric Semantics for Second Order Communication and Concurrency (2000) (0)
Edinburgh Research Explorer Combining Effects: Sum and Tensor (2018) (0)
Sum and Tensor of Quantitative Effects (2022) (0)
A brief scientific biography of Robin Milner (2000) (0)

This paper list is powered by the following services:

Other Resources About Gordon Plotkin

What Schools Are Affiliated With Gordon Plotkin?

Gordon Plotkin is affiliated with the following schools:

University of Edinburgh

Gordon Plotkin's Academic­Influence.com Rankings