AbstractThis paper investigates the notion of dialgebra, which generalises the notions of algebra and coalgebra. We show that many (co)algebraic notions and results can be generalised to dialgebras, and investigate the essential differences between (co)algebras and arbitrary dialgebras
AbstractFollowing earlier work, a modal logic for T-coalgebras is a functor L on a suitable variety....
Abstract. A large number of computational processes can suitably be described as a combination of co...
AbstractCoalgebra develops a general theory of transition systems, parametric in a functor T; the fu...
AbstractThe aim of this report is to propose a line of research that studies the connections between...
The abstract mathematical structures known as coalgebras are of increasing interest in computer scie...
A large number of computational processes can suitably be described as a combination of construction...
AbstractIn the semantics of programming, finite data types such as finite lists, have traditionally ...
textabstractIn the semantics of programming, finite data types such as finite lists, have traditiona...
AbstractA syntax and semantics of types, terms and formulas for coalgebras of polynomial functors is...
AbstractWe define a modal logic whose models are coalgebras of a polynomial functor. Bisimilarity tu...
AbstractWhilst the relationship between initial algebras and monads is well-understood, the relation...
In this article, we provide three coalgebraic characterizations of the class of context-free langua...
AbstractIf F:Set→Set is a functor which is bounded and preserves weak generalized pullbacks then a c...
AbstractWe define the continuum up to order isomorphism (and hence homeomorphism) as the final coalg...
AbstractCoalgebra develops a general theory of transition systems, parametric in a functor T; the fu...
AbstractFollowing earlier work, a modal logic for T-coalgebras is a functor L on a suitable variety....
Abstract. A large number of computational processes can suitably be described as a combination of co...
AbstractCoalgebra develops a general theory of transition systems, parametric in a functor T; the fu...
AbstractThe aim of this report is to propose a line of research that studies the connections between...
The abstract mathematical structures known as coalgebras are of increasing interest in computer scie...
A large number of computational processes can suitably be described as a combination of construction...
AbstractIn the semantics of programming, finite data types such as finite lists, have traditionally ...
textabstractIn the semantics of programming, finite data types such as finite lists, have traditiona...
AbstractA syntax and semantics of types, terms and formulas for coalgebras of polynomial functors is...
AbstractWe define a modal logic whose models are coalgebras of a polynomial functor. Bisimilarity tu...
AbstractWhilst the relationship between initial algebras and monads is well-understood, the relation...
In this article, we provide three coalgebraic characterizations of the class of context-free langua...
AbstractIf F:Set→Set is a functor which is bounded and preserves weak generalized pullbacks then a c...
AbstractWe define the continuum up to order isomorphism (and hence homeomorphism) as the final coalg...
AbstractCoalgebra develops a general theory of transition systems, parametric in a functor T; the fu...
AbstractFollowing earlier work, a modal logic for T-coalgebras is a functor L on a suitable variety....
Abstract. A large number of computational processes can suitably be described as a combination of co...
AbstractCoalgebra develops a general theory of transition systems, parametric in a functor T; the fu...
DOI
Add to ORKG