AbstractGiven a category C with finite products and a strong monad T on C, we investigate axioms under which an ObC-indexed family of operations of the form αx:(Tx)n → Tx provides a definitive semantics for algebraic operations added to the computational λ-calculus. We recall a definition for which we have elsewhere given adequacy results for both big and small step operational semantics, and we show that it is equivalent to a range of other possible natural definitions of algebraic operation. We outline examples and non-examples and we show that our definition is equivalent to one for call-by-name languages with effects, too
AbstractThe finite π-calculus has an explicit set-theoretic functor-category model that is known to ...
This paper is a contribution to the search for efficient and high-level mathematical tools to specif...
AbstractIn a series of papers, Mosses and Watt define action semantics, a metalanguage for high leve...
Given a category C with finite products and a strong monad T on C, we investigate axioms under which...
AbstractGiven a category C with finite products and a strong monad T on C, we investigate axioms und...
Given a category C with finite products and a strong monad T on C, we investigate axioms under which...
AbstractThis paper presents a functional programming language, based on Moggi’s monadic metalanguage...
AbstractIn this paper, we study extensions of mathematical operational semantics with algebraic effe...
AbstractA Freyd-category is a subtle generalisation of the notion of a category with finite products...
We model notions of computation using algebraic operations and equations. We show that these genera...
This dissertation examines some aspects of the relationship between λ calculus and universal algebr...
AbstractWe reformulate denotational semantics for nondeterminism, taking a nondeterministic operatio...
AbstractIn this paper, we present results that provide an abstract setting for the construction and ...
Moggi proposed a monadic account of computational effects. He also presented the computational lamd...
We overview a programme to provide a unified semantics for computational effects based upon the not...
AbstractThe finite π-calculus has an explicit set-theoretic functor-category model that is known to ...
This paper is a contribution to the search for efficient and high-level mathematical tools to specif...
AbstractIn a series of papers, Mosses and Watt define action semantics, a metalanguage for high leve...
Given a category C with finite products and a strong monad T on C, we investigate axioms under which...
AbstractGiven a category C with finite products and a strong monad T on C, we investigate axioms und...
Given a category C with finite products and a strong monad T on C, we investigate axioms under which...
AbstractThis paper presents a functional programming language, based on Moggi’s monadic metalanguage...
AbstractIn this paper, we study extensions of mathematical operational semantics with algebraic effe...
AbstractA Freyd-category is a subtle generalisation of the notion of a category with finite products...
We model notions of computation using algebraic operations and equations. We show that these genera...
This dissertation examines some aspects of the relationship between λ calculus and universal algebr...
AbstractWe reformulate denotational semantics for nondeterminism, taking a nondeterministic operatio...
AbstractIn this paper, we present results that provide an abstract setting for the construction and ...
Moggi proposed a monadic account of computational effects. He also presented the computational lamd...
We overview a programme to provide a unified semantics for computational effects based upon the not...
AbstractThe finite π-calculus has an explicit set-theoretic functor-category model that is known to ...
This paper is a contribution to the search for efficient and high-level mathematical tools to specif...
AbstractIn a series of papers, Mosses and Watt define action semantics, a metalanguage for high leve...