In seeking a unified study of computational effects, in particular in order to give a general operational semantics agreeing with the standard one for state, one must take account of the coalgebraic structure of state. Axiomatically, one needs a count-able Lawvere theory L, a comodel C, typically the final one, and a model M, typ-ically free; one then seeks a tensor C ⊗ M of the comodel with the model that allows operations to flow between the two. We describe such a tensor implicit in the abstract category theoretic literature, explain its significance for computational effects, and calculate it in leading classes of examples, primarily involving state
We use the concept of a distributive law of a monad over a copointed endofunctor to define and devel...
AbstractWe use the concept of a distributive law of a monad over a copointed endofunctor to define a...
AbstractWhat structure is required of a set so that computations in a given notion of computation ca...
AbstractIn seeking a unified study of computational effects, one must take account of the coalgebrai...
AbstractIn seeking a unified study of computational effects, one must take account of the coalgebrai...
In the mid-nineties, Turi and Plotkin gave an elegant categorical treatment of denotational and oper...
We overview a programme to provide a unified semantics for computational effects based upon the noti...
AbstractWe investigate the notion of a comodel of a (countable) Lawvere theory, an evident dual to t...
AbstractCountable Lawvere theories model computational effects such as exceptions, side-effects, int...
We develop a theory for the commutative combination of quantitative effects, their tensor, given as ...
We overview a programme to provide a unified semantics for computational effects based upon the not...
We develop a theory for the commutative combination of quantitative effects, their tensor, given as ...
Enriched Lawvere theories are a generalization of Lawvere theories that allow us to describe the ope...
The development of compositional distributional models of semantics reconciling the empirical aspect...
The development of compositional distribu-tional models of semantics reconciling the em-pirical aspe...
We use the concept of a distributive law of a monad over a copointed endofunctor to define and devel...
AbstractWe use the concept of a distributive law of a monad over a copointed endofunctor to define a...
AbstractWhat structure is required of a set so that computations in a given notion of computation ca...
AbstractIn seeking a unified study of computational effects, one must take account of the coalgebrai...
AbstractIn seeking a unified study of computational effects, one must take account of the coalgebrai...
In the mid-nineties, Turi and Plotkin gave an elegant categorical treatment of denotational and oper...
We overview a programme to provide a unified semantics for computational effects based upon the noti...
AbstractWe investigate the notion of a comodel of a (countable) Lawvere theory, an evident dual to t...
AbstractCountable Lawvere theories model computational effects such as exceptions, side-effects, int...
We develop a theory for the commutative combination of quantitative effects, their tensor, given as ...
We overview a programme to provide a unified semantics for computational effects based upon the not...
We develop a theory for the commutative combination of quantitative effects, their tensor, given as ...
Enriched Lawvere theories are a generalization of Lawvere theories that allow us to describe the ope...
The development of compositional distributional models of semantics reconciling the empirical aspect...
The development of compositional distribu-tional models of semantics reconciling the em-pirical aspe...
We use the concept of a distributive law of a monad over a copointed endofunctor to define and devel...
AbstractWe use the concept of a distributive law of a monad over a copointed endofunctor to define a...
AbstractWhat structure is required of a set so that computations in a given notion of computation ca...