AbstractIn seeking a unified study of computational effects, one must take account of the coalgebraic structure of state in order to give a general operational semantics agreeing with the standard one for state. Axiomatically, one needs a countable Lawvere theory L, a comodel C, typically the final one, and a model M, typically 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 present an extension of standard coalgebraic specification techniques for statebased systems whic...
AbstractVarious situations in computer science call for categories that support both cartesian close...
In the mid-nineties, Turi and Plotkin gave an elegant categorical treatment of denotational and oper...
AbstractIn seeking a unified study of computational effects, one must take account of the coalgebrai...
In seeking a unified study of computational effects, in particular in order to give a general operat...
AbstractWe investigate the notion of a comodel of a (countable) Lawvere theory, an evident dual to t...
AbstractComodels of Lawvere theories, i.e. models in Setop, model state spaces with algebraic access...
AbstractLawvere theories have been one of the two main category theoretic formulations of universal ...
AbstractStarting with Moggi's work on monads as refined to Lawvere theories, we give a general const...
AbstractWhat structure is required of a set so that computations in a given notion of computation ca...
AbstractIn this paper, we study extensions of mathematical operational semantics with algebraic effe...
AbstractIn this paper we address the issue of providing a structured coalgebra presentation of trans...
AbstractLogical definability is investigated for certain classes of coalgebras related to state-tran...
We develop a theory for the commutative combination of quantitative effects, their tensor, given as ...
We present an extension of standard coalgebraic specification techniques for statebased systems whic...
We present an extension of standard coalgebraic specification techniques for statebased systems whic...
AbstractVarious situations in computer science call for categories that support both cartesian close...
In the mid-nineties, Turi and Plotkin gave an elegant categorical treatment of denotational and oper...
AbstractIn seeking a unified study of computational effects, one must take account of the coalgebrai...
In seeking a unified study of computational effects, in particular in order to give a general operat...
AbstractWe investigate the notion of a comodel of a (countable) Lawvere theory, an evident dual to t...
AbstractComodels of Lawvere theories, i.e. models in Setop, model state spaces with algebraic access...
AbstractLawvere theories have been one of the two main category theoretic formulations of universal ...
AbstractStarting with Moggi's work on monads as refined to Lawvere theories, we give a general const...
AbstractWhat structure is required of a set so that computations in a given notion of computation ca...
AbstractIn this paper, we study extensions of mathematical operational semantics with algebraic effe...
AbstractIn this paper we address the issue of providing a structured coalgebra presentation of trans...
AbstractLogical definability is investigated for certain classes of coalgebras related to state-tran...
We develop a theory for the commutative combination of quantitative effects, their tensor, given as ...
We present an extension of standard coalgebraic specification techniques for statebased systems whic...
We present an extension of standard coalgebraic specification techniques for statebased systems whic...
AbstractVarious situations in computer science call for categories that support both cartesian close...
In the mid-nineties, Turi and Plotkin gave an elegant categorical treatment of denotational and oper...