Results 1  10
of
39
Algebraic Operations and Generic Effects
 Applied Categorical Structures
, 2003
"... Given a complete and cocomplete symmetric monoidal closed category V and a symmetric monoidal Vcategory C with cotensors and a strong Vmonad T on C, we investigate axioms under which an ObCindexed family of operations of the form α_x : (Tx)^ν → (Tx)^ω provides ..."
Abstract

Cited by 34 (7 self)
 Add to MetaCart
(Show Context)
Given a complete and cocomplete symmetric monoidal closed category V and a symmetric monoidal Vcategory C with cotensors and a strong Vmonad T on C, we investigate axioms under which an ObCindexed family of operations of the form &alpha;_x : (Tx)^&nu; &rarr; (Tx)^&omega; provides semantics for algebraic operations on the computational &lambda;calculus. We recall a definition for which we have elsewhere given adequacy results, and we show that an enrichment of it is equivalent to a range of other possible natural definitions of algebraic operation. In particular, we define the notion of generic effect and show that to give a generic effect is equivalent to giving an algebraic operation. We further show how the usual monadic semantics of the computational &lambda;calculus extends uniformly to incorporate generic effects. We outline examples and nonexamples and we show that our definition also enriches one for callbyname languages with e#ects.
Properly injective spaces and function spaces
 TO APPEAR IN TOPOLOGY AND ITS APPLICATIONS
, 1997
"... Given an injective space D (a continuous lattice endowed with the Scott topology) and a subspace embedding j: X → Y, Dana Scott asked whether the higherorder function [X → D] → [Y → D] which takes a continuous map f: X → D to its greatest continuous extension ¯ f: Y → D along j is Scott continuous ..."
Abstract

Cited by 28 (12 self)
 Add to MetaCart
Given an injective space D (a continuous lattice endowed with the Scott topology) and a subspace embedding j: X → Y, Dana Scott asked whether the higherorder function [X → D] → [Y → D] which takes a continuous map f: X → D to its greatest continuous extension ¯ f: Y → D along j is Scott continuous. In this case the extension map is a subspace embedding. We show that the extension map is Scott continuous iff D is the trivial onepoint space or j is a proper map in the sense of Hofmann and Lawson. In order to avoid the ambiguous expression “proper subspace embedding”, we refer to proper maps as finitary maps. We show that the finitary sober subspaces of the injective spaces are exactly the stably locally compact spaces. Moreover, the injective spaces over finitary embeddings are the algebras of the upper power space monad on the category of sober spaces. These coincide with the retracts of upper power spaces of sober spaces. In the full subcategory of locally compact sober spaces, these are known to be the continuous meetsemilattices. In the full subcategory of stably locally compact spaces these are again the continuous lattices. The above characterization of the injective spaces over finitary embeddings is an instance of a general result on injective objects in posetenriched categories with the structure of a KZmonad established in this paper, which we also apply to various full subcategories closed under the upper power space construction and to the upper and lower power locale monads. The above results also hold for the injective spaces over dense subspace embeddings (continuous Scott domains). Moreover, we show that every sober space has a smallest finitary dense sober subspace (its support). The support always contains the subspace of maximal points, and in the stably locally compact case (which includes densely injective spaces) it is the subspace of maximal points iff that subspace is compact.
Adjoint Rewriting
, 1995
"... This thesis concerns rewriting in the typed calculus. Traditional categorical models of typed calculus use concepts such as functor, adjunction and algebra to model type constructors and their associated introduction and elimination rules, with the natural categorical equations inherent in these s ..."
Abstract

Cited by 25 (11 self)
 Add to MetaCart
This thesis concerns rewriting in the typed calculus. Traditional categorical models of typed calculus use concepts such as functor, adjunction and algebra to model type constructors and their associated introduction and elimination rules, with the natural categorical equations inherent in these structures providing an equational theory for terms. One then seeks a rewrite relation which, by transforming terms into canonical forms, provides a decision procedure for this equational theory. Unfortunately the rewrite relations which have been proposed, apart from for the most simple of calculi, either generate the full equational theory but contain no decision procedure, or contain a decision procedure but only for a subtheory of that required. Our proposal is to unify the semantics and reduction theory of the typed calculus by generalising the notion of model from categorical structures based on term equality to categorical structures based on term reduction. This is accomplished via...
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.
Homotopy limits and colimits and enriched homotopy theory
, 2006
"... Abstract. Homotopy limits and colimits are homotopical replacements for the usual limits and colimits of category theory, which can be approached either using classical explicit constructions or the modern abstract machinery of derived functors. Our first goal is to explain both and show their equiv ..."
Abstract

Cited by 16 (2 self)
 Add to MetaCart
(Show Context)
Abstract. Homotopy limits and colimits are homotopical replacements for the usual limits and colimits of category theory, which can be approached either using classical explicit constructions or the modern abstract machinery of derived functors. Our first goal is to explain both and show their equivalence. Our second goal is to generalize this result to enriched categories and homotopy weighted limits, showing that the classical explicit constructions still give the right answer in the abstract sense, thus partially bridging the gap between classical homotopy theory and modern abstract homotopy theory. To do this we introduce a notion of “enriched homotopical categories”, which are more general than enriched model categories, but are still a good place to do enriched homotopy theory. This demonstrates that the presence of enrichment often simplifies rather than complicates matters, and goes some way toward achieving a better understanding of “the role of homotopy in homotopy theory.” Contents
MONADS AND COMONADS ON MODULE CATEGORIES
"... known in module theory that any Abimodule B is an Aring if and only if the functor − ⊗A B: MA → MA is a monad (or triple). Similarly, an Abimodule C is an Acoring provided the functor − ⊗A C: MA → MA is a comonad (or cotriple). The related categories of modules (or algebras) of − ⊗A B and comodu ..."
Abstract

Cited by 12 (10 self)
 Add to MetaCart
(Show Context)
known in module theory that any Abimodule B is an Aring if and only if the functor − ⊗A B: MA → MA is a monad (or triple). Similarly, an Abimodule C is an Acoring provided the functor − ⊗A C: MA → MA is a comonad (or cotriple). The related categories of modules (or algebras) of − ⊗A B and comodules (or coalgebras) of − ⊗A C are well studied in the literature. On the other hand, the right adjoint endofunctors HomA(B, −) and HomA(C, −) are a comonad and a monad, respectively, but the corresponding (co)module categories did not find
Understanding the small object argument
 Applied Categorical Structures
, 2008
"... The small object argument is a transfinite construction which, starting from a set of maps in a category, generates a weak factorisation system on that ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
(Show Context)
The small object argument is a transfinite construction which, starting from a set of maps in a category, generates a weak factorisation system on that
Semantics for Algebraic Operations
 Proc. MFPS 17, Electronic Notes in Thoeret. Comp. Sci
, 2001
"... 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 ObC indexed family of operations of the form #x : (Tx) v # (Tx) w provides semantics for algebraic ope ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
(Show Context)
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 ObC indexed family of operations of the form #x : (Tx) v # (Tx) w provides semantics for algebraic operations, which may be used to extend the usual monadic semantics of the computational #calculus uniformly. We recall a definition for which we have elsewhere given adequacy results, and we show that an enrichment of it is equivalent to a range of other possible natural definitions of algebraic operation. We outline examples and nonexamples and we show that our definition also enriches one for callbyname languages with e#ects. 1
Cofibrantly generated natural weak factorisation systems
, 2007
"... There is an “algebraisation ” of the notion of weak factorisation system (w.f.s.) known as a natural weak factorisation system. In it, the two classes of maps of a w.f.s. are replaced by two categories of mapswithstructure, where the extra structure on a map now encodes a choice of liftings with r ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
(Show Context)
There is an “algebraisation ” of the notion of weak factorisation system (w.f.s.) known as a natural weak factorisation system. In it, the two classes of maps of a w.f.s. are replaced by two categories of mapswithstructure, where the extra structure on a map now encodes a choice of liftings with respect to the other class. This extra structure has pleasant consequences: for example, a natural w.f.s. on C induces a canonical natural w.f.s. structure on any functor category [A, C]. In this paper, we define cofibrantly generated natural weak factorisation systems by analogy with cofibrantly generated w.f.s.’s. We then construct them by a method which is reminiscent of Quillen’s small object argument but produces factorisations which are much smaller and easier to handle, and show that the resultant natural w.f.s. is, in a suitable sense, freely generated by its generating cofibrations. Finally, we show that the two categories of mapswithstructure for a natural w.f.s. are closed under all the constructions we would expect of them: (co)limits, pushouts / pullbacks, transfinite composition, and so on. 1
Combining algebraic effects with continuations
, 2007
"... We consider the natural combinations of algebraic computational effects such as sideeffects, exceptions, interactive input/output, and nondeterminism with continuations. Continuations are not an algebraic effect, but previously developed combinations of algebraic effects given by sum and tensor ext ..."
Abstract

Cited by 9 (4 self)
 Add to MetaCart
We consider the natural combinations of algebraic computational effects such as sideeffects, exceptions, interactive input/output, and nondeterminism with continuations. Continuations are not an algebraic effect, but previously developed combinations of algebraic effects given by sum and tensor extend, with effort, to include commonly used combinations of the various algebraic effects with continuations. Continuations also give rise to a third sort of combination, that given by applying the continuations monad transformer to an algebraic effect. We investigate the extent to which sum and tensor extend from algebraic effects to arbitrary monads, and the extent to which Felleisen et al.’s C operator extends from continuations to its combination with algebraic effects. To do all this, we use Dubuc’s characterisation of strong monads in terms of enriched large Lawvere theories.