Results 11  20
of
70
Coalgebraic modal logic beyond Sets
 In MFPS XXIII
, 2007
"... Replace this file with prentcsmacro.sty for your meeting, or with entcsmacro.sty for your meeting. Both can be ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
Replace this file with prentcsmacro.sty for your meeting, or with entcsmacro.sty for your meeting. Both can be
Notes on enriched categories with colimits of some class
 Theory Appl. Categ
"... The paper is in essence a survey of categories having φweighted colimits for all the weights φ in some class Φ. We introduce the class Φ + of Φflat weights which are those ψ for which ψcolimits commute in the base V with limits having weights in Φ; and the class Φ − of Φatomic weights, which are ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
The paper is in essence a survey of categories having φweighted colimits for all the weights φ in some class Φ. We introduce the class Φ + of Φflat weights which are those ψ for which ψcolimits commute in the base V with limits having weights in Φ; and the class Φ − of Φatomic weights, which are those ψ for which ψlimits commute in the base V with colimits having weights in Φ. We show that both these classes are saturated (that is, what was called closed in the terminology of [AK88]). We prove that for the class P of all weights, the classes P + and P − both coincide with the class Q of absolute weights. For any class Φ and any category A, we have the free Φcocompletion Φ(A) of A; and we recognize Q(A) as the Cauchycompletion of A. We study the equivalence between (Q(A op)) op and Q(A), which we exhibit as the restriction of the Isbell adjunction between [A, V] op and [A op, V] when A is small; and we give a new Morita theorem for any class Φ containing Q. We end with the study of Φcontinuous weights and their relation to the Φflat weights. 1
On Sifted Colimits And Generalized Varieties
, 1999
"... Filtered colimits, i.e., colimits over schemes D such that Dcolimits in Set commute with finite limits, have a natural generalization to sifted colimits: these are colimits over schemes D such that Dcolimits in Set commute with finite products. An important example: reflexive coequalizers are sif ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
Filtered colimits, i.e., colimits over schemes D such that Dcolimits in Set commute with finite limits, have a natural generalization to sifted colimits: these are colimits over schemes D such that Dcolimits in Set commute with finite products. An important example: reflexive coequalizers are sifted colimits. Generalized varieties are defined as free completions of small categories under siftedcolimits (analogously to finitely accessible categories which are free filteredcolimit completions of small categories). Among complete categories, generalized varieties are precisely the varieties. Further examples: category of fields, category of linearly ordered sets, category of nonempty sets.
Towards Semantics of SelfAdaptive Software
, 2000
"... When people perform computations, they routinely monitor their results, and try to adapt and improve their algorithms when a need arises. The idea of selfadaptive software is to implement this common facility of human mind within the framework of the standard logical methods of software engineering ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
When people perform computations, they routinely monitor their results, and try to adapt and improve their algorithms when a need arises. The idea of selfadaptive software is to implement this common facility of human mind within the framework of the standard logical methods of software engineering. The ubiquitous practice of testing, debugging and improving programs at the design time should be automated, and established as a continuing run time routine. Technically, the task thus requires combining functionalities of automated software development tools and of runtime environments. Such combinations lead not just to challenging engineering problems, but also to novel theoretical questions. Formal methods are needed, and the standard techniques do not suffice. As a first contribution in this direction, we present a basic mathematical framework suitable for describing selfadaptive software at a high level of semantical abstraction. A static view leads to a structure akin...
On PropertyLike Structures
, 1997
"... A category may bear many monoidal structures, but (to within a unique isomorphism) only one structure of "category with finite products". To capture such distinctions, we consider on a 2category those 2monads for which algebra structure is essentially unique if it exists, giving a precis ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
A category may bear many monoidal structures, but (to within a unique isomorphism) only one structure of "category with finite products". To capture such distinctions, we consider on a 2category those 2monads for which algebra structure is essentially unique if it exists, giving a precise mathematical definition of "essentially unique" and investigating its consequences. We call such 2monads propertylike. We further consider the more restricted class of fully propertylike 2monads, consisting of those propertylike 2monads for which all 2cells between (even lax) algebra morphisms are algebra 2cells. The consideration of lax morphisms leads us to a new characterization of those monads, studied by Kock and Zoberlein, for which "structure is adjoint to unit", and which we now call laxidempotent 2monads: both these and their colaxidempotent duals are fully propertylike. We end by showing that (at least for finitary 2monads) the classes of propertylikes, fully propertylike...
Algebras, Coalgebras, Monads and Comonads
, 2001
"... Whilst the relationship between initial algebras and monads is wellunderstood, the relationship between nal coalgebras and comonads is less well explored. This paper shows that the problem is more subtle and that final coalgebras can just as easily form monads as comonads and dually, that initial a ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
Whilst the relationship between initial algebras and monads is wellunderstood, the relationship between nal coalgebras and comonads is less well explored. This paper shows that the problem is more subtle and that final coalgebras can just as easily form monads as comonads and dually, that initial algebras form both monads and comonads. In developing these theories we strive to provide them with an associated notion of syntax. In the case of initial algebras and monads this corresponds to the standard notion of algebraic theories consisting of signatures and equations: models of such algebraic theories are precisely the algebras of the representing monad. We attempt to emulate this result for the coalgebraic case by defining a notion cosignature and coequation and then proving the models of this syntax are precisely the coalgebras of the representing comonad.