Gordon D. Plotkin

According to our database1, Gordon D. Plotkin
  • authored at least 133 papers between 1974 and 2018.
  • has a "Dijkstra number"2 of three.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
Chromar, a Rule-based Language of Parameterised Objects.
Electr. Notes Theor. Comput. Sci., 2018

Alonzo Church Award 2018 - Call for Nominations.
Bulletin of the EATCS, 2018

On the Axiomatizability of Quantitative Algebras.
CoRR, 2018

Free complete Wasserstein algebras.
CoRR, 2018

An Algebraic Theory of Markov Processes.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

2017
Alonzo Church Award 2017 - Call for Nominations.
Bulletin of the EATCS, 2017

Mixed powerdomains for probability and nondeterminism.
Logical Methods in Computer Science, 2017

Dijkstra monads for free.
Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, 2017

On the axiomatizability of quantitative algebras.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

2016
Dijkstra Monads for Free.
CoRR, 2016

Scaling network verification using symmetry and surgery.
Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2016

Quantitative Algebraic Reasoning.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Dependent Types and Fibred Computational Effects.
Proceedings of the Foundations of Software Science and Computation Structures, 2016

2015
Foundations of Differential Dataflow.
Proceedings of the Foundations of Software Science and Computation Structures, 2015

2014
Cartesian closed categories of separable Scott domains.
Theor. Comput. Sci., 2014

Approximating Markov Processes by Averaging.
J. ACM, 2014

On Hierarchical Graphs: Reconciling Bigraphs, Gs-monoidal Theories and Gs-graphs.
Fundam. Inform., 2014

Layout Randomization and Nondeterminism.
Proceedings of the Horizons of the Mind. A Tribute to Prakash Panangaden, 2014

2013
Multi-level modelling via stochastic multi-level multiset rewriting.
Mathematical Structures in Computer Science, 2013

Dedication.
Electr. Notes Theor. Comput. Sci., 2013

Layout Randomization and Nondeterminism.
Electr. Notes Theor. Comput. Sci., 2013

Handling Algebraic Effects.
Logical Methods in Computer Science, 2013

The Compiler Forest.
Proceedings of the Programming Languages and Systems, 2013

A Calculus of Chemical Systems.
Proceedings of the In Search of Elegance in the Theory and Practice of Computation, 2013

Partial Recursive Functions and Finality.
Proceedings of the Computation, Logic, Games, and Quantum Foundations. The Many Facets of Samson Abramsky, 2013

2012
On Protection by Layout Randomization.
ACM Trans. Inf. Syst. Secur., 2012

Algebraic foundations for effect-dependent optimisations.
Proceedings of the 39th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2012

Concurrency and the Algebraic Theory of Effects - (Abstract).
Proceedings of the CONCUR 2012 - Concurrency Theory - 23rd International Conference, 2012

2011
Coloured stochastic multilevel multiset rewriting.
Proceedings of the Computational Methods in Systems Biology, 9th International Conference, 2011

2010
A Language for Biochemical Systems: Design and Formal Specification.
Trans. Computational Systems Biology, 2010

Obituary: Robin Milner (1934-2010).
Bulletin of the EATCS, 2010

A Model of Cooperative Threads
Logical Methods in Computer Science, 2010

On CSP and the Algebraic Theory of Effects
CoRR, 2010

Robin Milner, a Craftsman of Tools for the Mind.
Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, 2010

On Protection by Layout Randomization.
Proceedings of the 23rd IEEE Computer Security Foundations Symposium, 2010

On CSP and the Algebraic Theory of Effects.
Proceedings of the Reflections on the Work of C. A. R. Hoare., 2010

2009
Configuration structures, event structures and Petri nets.
Theor. Comput. Sci., 2009

Predicate transformers for extended probability and non-determinism.
Mathematical Structures in Computer Science, 2009

On the completeness of order-theoretic models of the lambda-calculus.
Inf. Comput., 2009

Semantic Domains for Combining Probability and Non-Determinism.
Electr. Notes Theor. Comput. Sci., 2009

Configuration Structures, Event Structures and Petri Nets
CoRR, 2009

A model of cooperative threads.
Proceedings of the 36th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2009

Approximating Markov Processes by Averaging.
Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

Handlers of Algebraic Effects.
Proceedings of the Programming Languages and Systems, 2009

Adequacy for Infinitary Algebraic Effects (Abstract).
Proceedings of the Algebra and Coalgebra in Computer Science, 2009

Approximating Labelled Markov Processes Again!
Proceedings of the Algebra and Coalgebra in Computer Science, 2009

2008
Tensors of Comodels and Models for Operational Semantics.
Electr. Notes Theor. Comput. Sci., 2008

A Logic for Algebraic Effects.
Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, 2008

A Language for Biochemical Systems.
Proceedings of the Computational Methods in Systems Biology, 6th International Conference, 2008

Finite Dimensional Vector Spaces Are Complete for Traced Symmetric Monoidal Categories.
Proceedings of the Pillars of Computer Science, 2008

2007
Combining algebraic effects with continuations.
Theor. Comput. Sci., 2007

2006
Combining effects: Sum and tensor.
Theor. Comput. Sci., 2006

A domain-theoretic Banach-Alaoglu theorem.
Mathematical Structures in Computer Science, 2006

Hennessy-Plotkin-Brookes Revisited.
Proceedings of the FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 2006

Some Varieties of Equational Logic.
Proceedings of the Algebra, Meaning, and Computation, 2006

2005
Adequacy for Algebraic Effects with State.
Proceedings of the Algebra and Coalgebra in Computer Science: First International Conference, 2005

2004
A structural approach to operational semantics.
J. Log. Algebr. Program., 2004

The origins of structural operational semantics.
J. Log. Algebr. Program., 2004

Computational Effects and Operations: An Overview.
Electr. Notes Theor. Comput. Sci., 2004

Foreword.
Ann. Pure Appl. Logic, 2004

Event Structures for Resolvable Conflict.
Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

2003
Algebraic Operations and Generic Effects.
Applied Categorical Structures, 2003

Logic for Computational Effects: Work in Progress.
Proceedings of the 6th International Workshop on Formal Methods, 2003

2002
Three Inadequate Models.
Formal Asp. Comput., 2002

Combining Computational Effects: commutativity & sum.
Proceedings of the Foundations of Information Technology in the Era of Networking and Mobile Computing, 2002

Notions of Computation Determine Monads.
Proceedings of the Foundations of Software Science and Computation Structures, 2002

2001
Semantics for Algebraic Operations.
Electr. Notes Theor. Comput. Sci., 2001

Bialgebraic Semantics and Recursion (Extended Abstract).
Electr. Notes Theor. Comput. Sci., 2001

Adequacy for Algebraic Effects.
Proceedings of the Foundations of Software Science and Computation Structures, 2001

2000
Complete Axioms for Categorical Fixed-Point Operators.
Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science, 2000

Some New Directions in the Syntax and Semantics of Formal Languages.
Proceedings of the Theoretical Computer Science, 2000

Lax Logical Relations.
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

A brief scientific biography of Robin Milner.
Proceedings of the Proof, Language, and Interaction, Essays in Honour of Robin Milner, 2000

Bistructures, bidomains, and linear logic.
Proceedings of the Proof, Language, and Interaction, Essays in Honour of Robin Milner, 2000

1999
Full abstraction, totality and PCF.
Mathematical Structures in Computer Science, 1999

Abstract Syntax and Variable Binding.
Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science, 1999

Full Completeness of the Multiplicative Linear Logic of Chu Spaces.
Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science, 1999

1997
Towards a Mathematical Operational Semantics.
Proceedings of the Proceedings, 12th Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, June 29, 1997

Complete Cuboidal Sets in Axiomatic Domain Theory.
Proceedings of the Proceedings, 12th Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, June 29, 1997

From Action Calculi to Linear Logic.
Proceedings of the Computer Science Logic, 11th International Workshop, 1997

1996
On a Question of H. Friedman.
Inf. Comput., 1996

Teams can see pomsets.
Proceedings of the Partial Order Methods in Verification, Proceedings of a DIMACS Workshop, 1996

An Extension of Models of Axiomatic Domain Theory to Models of Synthetic Domain Theory.
Proceedings of the Computer Science Logic, 10th International Workshop, 1996

1995
Uncountable Limits and the lambda Calculus.
Nord. J. Comput., 1995

Configuration Structures
Proceedings of the Proceedings, 1995

1994
A Semantics for Static Type Inference
Inf. Comput., 1994

Subtyping and Parametricity
Proceedings of the Ninth Annual Symposium on Logic in Computer Science (LICS '94), 1994

An Axiomatization of Computationally Adequate Domain Theoretic Models of FPC
Proceedings of the Ninth Annual Symposium on Logic in Computer Science (LICS '94), 1994

Bistructures, Bidomains and Linear Logic.
Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994

Countable Non-Determinism and Uncountable Limits.
Proceedings of the CONCUR '94, 1994

1993
On Functors Expressible in the Polymorphic Typed Lambda Calculus
Inf. Comput., July, 1993

A Calculus for Access Control in Distributed Systems.
ACM Trans. Program. Lang. Syst., 1993

Set-Theoretical and Other Elementary Models of the lambda-Calculus.
Theor. Comput. Sci., 1993

Concrete Domains.
Theor. Comput. Sci., 1993

A Logical View of Composition.
Theor. Comput. Sci., 1993

A Framework for Defining Logics.
J. ACM, 1993

A Logic for Parametric Polymorphism.
Proceedings of the Typed Lambda Calculi and Applications, 1993

Type Theory and Recursion (Extended Abstract)
Proceedings of the Eighth Annual Symposium on Logic in Computer Science (LICS '93), 1993

1991
Dynamic Typing in a Statically Typed Language.
ACM Trans. Program. Lang. Syst., 1991

Faithful Ideal Models for Recursive Polymorphic Types.
Int. J. Found. Comput. Sci., 1991

A Semantics for Type Checking.
Proceedings of the Theoretical Aspects of Computer Software, 1991

A Logical View of Composition and Refinement.
Proceedings of the Conference Record of the Eighteenth Annual ACM Symposium on Principles of Programming Languages, 1991

A Calculus for Access Control in Distributed Systems.
Proceedings of the Advances in Cryptology, 1991

1990
A Per Model of Polymorphism and Recursive Types
Proceedings of the Fifth Annual Symposium on Logic in Computer Science (LICS '90), 1990

1989
Dynamic Typing in a Statically-Typed Language.
Proceedings of the Conference Record of the Sixteenth Annual ACM Symposium on Principles of Programming Languages, 1989

A Probabilistic Powerdomain of Evaluations
Proceedings of the Fourth Annual Symposium on Logic in Computer Science (LICS '89), 1989

Faithful Ideal Models for Recursive Polymorphic Types
Proceedings of the Fourth Annual Symposium on Logic in Computer Science (LICS '89), 1989

1988
Abstract Types Have Existential Type.
ACM Trans. Program. Lang. Syst., 1988

Preface
Inf. Comput., 1988

1987
On Proving Limiting Completeness.
SIAM J. Comput., 1987

A Framework for Defining Logics
Proceedings of the Symposium on Logic in Computer Science (LICS '87), 1987

1986
Countable nondeterminism and random assignment.
J. ACM, 1986

An Ideal Model for Recursive Polymorphic Types
Information and Control, 1986

A Framework for Intuitionistic Modal Logics.
Proceedings of the 1st Conference on Theoretical Aspects of Reasoning about Knowledge, 1986

1985
Abstract Types Have Existential Type.
Proceedings of the Conference Record of the Twelfth Annual ACM Symposium on Principles of Programming Languages, 1985

1984
An Ideal Model for Recursive Polymorphic Types.
Proceedings of the Conference Record of the Eleventh Annual ACM Symposium on Principles of Programming Languages, 1984

1982
The Category-Theoretic Solution of Recursive Domain Equations.
SIAM J. Comput., 1982

A Powerdomain for Countable Non-Determinism (Extended Abstract).
Proceedings of the Automata, 1982

1981
Petri Nets, Event Structures and Domains, Part I.
Theor. Comput. Sci., 1981

A First Attempt at Translating CSP into CCS.
Proceedings of the 2nd International Conference on Distributed Computing Systems, 1981

A Cook's Tour of Countable Nondeterminism.
Proceedings of the Automata, 1981

1980
A Term Model for CCS.
Proceedings of the Mathematical Foundations of Computer Science 1980 (MFCS'80), 1980

An operational semantics for CSO.
Proceedings of the Logics of Programs and Their Applications, 1980

1979
Petri Nets, Event Structures and Domains.
Proceedings of the Semantics of Concurrent Computation, 1979

Full Abstraction for a Simple Parallel Programming Language.
Proceedings of the Mathematical Foundations of Computer Science 1979, 1979

Dijkstras Predicate Transformers & Smyth's Power Domaine.
Proceedings of the Abstract Software Specifications, 1979 Copenhagen Winter School, January 22, 1979

1978
T^omega as a Universal Domain.
J. Comput. Syst. Sci., 1978

1977
LCF Considered as a Programming Language.
Theor. Comput. Sci., 1977

Analysis of an Extended Concept-Learning Task.
Proceedings of the 5th International Joint Conference on Artificial Intelligence. Cambridge, 1977

The Category-Theoretic Solution of Recursive Domain Equations (Extended Abstract)
Proceedings of the 18th Annual Symposium on Foundations of Computer Science, Providence, Rhode Island, USA, 31 October, 1977

1976
A Powerdomain Construction.
SIAM J. Comput., 1976

1975
Call-by-Name, Call-by-Value and the lambda-Calculus.
Theor. Comput. Sci., 1975

1974
The lambda-Calculus is omega-Incomplete.
J. Symb. Log., 1974


  Loading...