#### Filter Results:

- Full text PDF available (45)

#### Publication Year

1989

2018

- This year (2)
- Last 5 years (9)
- Last 10 years (24)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Gordon D. Plotkin, John Power
- FoSSaCS
- 2002

We model notions of computation using algebraic operations and equations. We show that these generate several of the monads of primary interest that have been used to model computational effects,… (More)

- Gordon D. Plotkin, John Power
- Applied Categorical Structures
- 2003

Given a complete and cocomplete symmetric monoidal closed category V and a symmetric monoidal V-category C with cotensors and a strong V-monad T on C, we investigate axioms under which an ObCindexed… (More)

- Gordon D. Plotkin, John Power
- FoSSaCS
- 2001

Moggi proposed a monadic account of computational effects. He also presented the computational λ-calculus, λc, a core call-by-value functional programming language for effects; the effects are… (More)

- John Power, Edmund Robinson
- Mathematical Structures in Computer Science
- 1997

Mathematical Structures in Computer Science / Volume 7 / Issue 05 / October 1997, pp 453 468 DOI: 10.1017/S0960129597002375, Published online: 08 September 2000 Link to this article:… (More)

- Martin Hyland, Gordon D. Plotkin, John Power
- Theor. Comput. Sci.
- 2006

We seek a unified account of modularity for computational effects. We begin by reformulating Moggi’s monadic paradigm for modelling computational effects using the notion of enriched Lawvere theory,… (More)

- Peter W. O'Hearn, John Power, Makoto Takeyama, Robert D. Tennent
- Theor. Comput. Sci.
- 1999

In “syntactic control of interference” (POPL, 1978), J.C. Reynolds proposes three design principles intended to constrain the scope of imperative state e ects in Algol-like languages. The resulting… (More)

We deene the notion of enriched Lawvere theory, for enrichment over a monoidal biclosed category V that is locally nitely presentable as a closed category. We prove that the category of enriched… (More)

- John Power, Giuseppe Rosolini
- ICALP
- 1998

We give an account of part of modularity in denotational ~mantics. We define a computational effect to consist of a category with algebraic structure together with a construction using that algebraic… (More)

- Gordon D. Plotkin, John Power
- Electr. Notes Theor. Comput. Sci.
- 2004

We overview a programme to provide a unified semantics for computational effects based upon the notion of a countable enriched Lawvere theory. We define the notion of countable enriched Lawvere… (More)

- Marcelo P. Fiore, Gordon D. Plotkin, John Power
- LICS
- 1997

We study the enrichment of models of axiomatic domain theory. To this end, we introduce a new and broader notion of domain, viz. that of complete cuboidal set, that complies with the axiomatic… (More)