Results 1 
3 of
3
Enriched Lawvere Theories
"... We define the notion of enriched Lawvere theory, for enrichment over a monoidal biclosed category V that is locally finitely presentable as a closed category. We prove that the category of enriched Lawvere theories is equivalent to the category of finitary monads on V. Morever, the Vcategory of mod ..."
Abstract

Cited by 16 (0 self)
 Add to MetaCart
We define the notion of enriched Lawvere theory, for enrichment over a monoidal biclosed category V that is locally finitely presentable as a closed category. We prove that the category of enriched Lawvere theories is equivalent to the category of finitary monads on V. Morever, the Vcategory of models of a Lawvere Vtheory is equivalent to the Vcategory of algebras for the corresponding Vmonad. This all extends routinely to local presentability with respect to any regular cardinal. We finally consider the special case where V is Cat, and explain how the correspondence extends to pseudo maps of algebras.
Modelling environments in callbyvalue programming languages
, 2003
"... In categorical semantics, there have traditionally been two approaches to modelling environments, one by use of finite products in cartesian closed categories, the other by use of the base categories of indexed categories with structure. Each requires modifications in order to account for environmen ..."
Abstract

Cited by 14 (4 self)
 Add to MetaCart
In categorical semantics, there have traditionally been two approaches to modelling environments, one by use of finite products in cartesian closed categories, the other by use of the base categories of indexed categories with structure. Each requires modifications in order to account for environments in callbyvalue programming languages. There have been two more general definitions along both of these lines: the first generalising from cartesian to symmetric premonoidal categories, the second generalising from indexed categories with specified structure to κcategories. In this paper, we investigate environments in callbyvalue languages by analysing a finegrain variant of Moggi’s computational λcalculus, giving two equivalent sound and complete classes of models: one given by closed Freyd categories, which are based on symmetric premonoidal categories, the other given by closed κcategories.
Sketches
 JOURNAL OF PURE AND APPLIED ALGEBRA
, 1999
"... We generalise the notion of sketch. For any locally nitely presentable category, one can speak of algebraic structure on the category, or equivalently, a finitary monad on it. For any such finitary monad, we define the notions of sketch and strict model and prove that any sketch has a generic stri ..."
Abstract
 Add to MetaCart
We generalise the notion of sketch. For any locally nitely presentable category, one can speak of algebraic structure on the category, or equivalently, a finitary monad on it. For any such finitary monad, we define the notions of sketch and strict model and prove that any sketch has a generic strict model on it. This is all done with enrichment in any monoidal biclosed