• Publications
  • Influence
A structural approach to operational semantics
  • G. Plotkin
  • Computer Science
    J. Log. Algebraic Methods Program.
  • 2004
LCF Considered as a Programming Language
  • G. Plotkin
  • Computer Science
    Theor. Comput. Sci.
  • 1 December 1977
Call-by-Name, Call-by-Value and the lambda-Calculus
  • G. Plotkin
  • Computer Science, Mathematics
    Theor. Comput. Sci.
  • 1 December 1975
A framework for defining logics
The Edinburgh Logical Framework provides a means to define (or present) logics through a general treatment of syntax, rules, and proofs by means of a typed λ-calculus with dependent types, whereby each judgment is identified with the type of its proofs.
Towards a mathematical operational semantics
  • D. Turi, G. Plotkin
  • Computer Science
    Proceedings of Twelfth Annual IEEE Symposium on…
  • 29 June 1997
We present a categorical theory of 'well-behaved' operational semantics which aims at complementing the established theory of domains and denotational semantics to form a coherent whole. It is shown
Petri Nets, Event Structures and Domains, Part I
A calculus for access control in distributed systems
This work provides a logical language for accesss control lists and theories for deciding whether requests should be granted, and studies some of the concepts, protocols, and algorithms for access control in distributed systems from a logical perspective.
A Note on Inductive Generalization
Dynamic typing in a statically-typed language
This paper is an exploration of the syntax, operational semantics, and denotational semantics of a simple language with the type Dynamic, and discusses an operational semantics for this language and obtains a soundness theorem.
The category-theoretic solution of recursive domain equations
  • M. Smyth, G. Plotkin
  • Mathematics, Computer Science
    18th Annual Symposium on Foundations of Computer…
  • 1 November 1982
The purpose of the present paper is to set up a categorical framework in which the known techniques for solving equations find a natural place, generalizing from least fixed-points of continuous functions over cpos to initial ones of continuous functors over $\omega $-categories.