APAL
1999
13 years 4 months ago
1999
Coalgebra develops a general theory of transition systems, parametric in a functor T; the functor T specifies the possible one-step behaviors of the system. A fundamental question...
ENTCS
2002
13 years 4 months ago
2002
In [19] Rutten introduced the notion of weak bisimulations and weak bisimilarity for coalgebras of the functor F(X) = X +O. In the present paper I will introduce a notion of weak ...
ENTCS
2002
13 years 4 months ago
2002
We investigate the reasons for which the existence of certain right adjoints implies the existence of some final coalgebras, and vice-versa. In particular we prove and discuss the...
ACS
2005
13 years 4 months ago
2005
The quasicategory Q of all set functors (i.e. endofunctors of the category SET of all sets and mappings) and all natural transformations has a terminal object
ENTCS
2006
13 years 4 months ago
2006
We study properties of functors on categories of sets (classes) together with set (class) functions. In particular, we investigate the notion of inclusion preserving functor, and ...
ENTCS
2008
13 years 4 months ago
2008
Coequations, which are subsets of a cofree coalgebra, can be viewed as properties of systems. In case of a polynomial functor, a logic of coequations was formulated by J. Ad
ENTCS
2008
13 years 4 months ago
2008
Following earlier work, a modal logic for T-coalgebras is a functor L on a suitable variety. Syntax and proof system of the logic are given by presentations of the functor. This p...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
In this paper we present a simple database definition language: that of categories and functors. A database schema is a category and a state is a set-valued functor. We show that m...