On descent for coalgebras and type transformations

author

  • Maurice Kianpi Laboratory of Algebra, Geometry and Applications, Department of Mathematics, Faculty of Science, University of Yaounde 1, P.O. Box 812, Yaounde, Republic of Cameroon.
Abstract:

We find a criterion for a morphism of coalgebras over a Barr-exact category to be effective descent and determine (effective) descent morphisms for coalgebras over toposes in some cases. Also, we study some exactness properties of endofunctors of arbitrary categories in connection with natural transformations between them as well as those of functors that these transformations induce between corresponding categories of coalgebras.  As a result, we find conditions under which the induced functors preserve natural number objects as well as a criterion for them to be exact. Also this enable us to give a criterion for split epis in a category of coalgebras to be effective descent.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

on descent for coalgebras and type transformations

we find a criterion for a morphism of coalgebras over a barr-exact category to be effective descent and determine (effective) descent morphisms for coalgebras over toposes in some cases. also, we study some exactness properties of endofunctors of arbitrary categories in connection with natural transformations between them as well as those of functors that these transformations induce between co...

full text

On Coalgebras and Type Transformations

We show that for an arbitrary Set-endofunctor T the generalized membership function given by a sub-cartesian transformation μ from T to the filter functor F can be alternatively defined by the collection of subcoalgebras of constant T -coalgebras. Sub-natural transformations ε between any two functors S and T are shown to be sub-cartesian if and only if they respect μ. The class of T -coalgebra...

full text

Coalgebras Of Bounded Type

Using results of Trnková, we first show that subcoalgebras are always closed under finite intersections. Assuming that the type functor F is bounded, we obtain a concrete representation of the terminal F-coalgebra. Several equivalent characterizations of boundedness are provided.

full text

Weak Bisimulation for Action-Type Coalgebras

We propose a coalgebraic definition of weak bisimulation for a class of coalgebras obtained from bifunctors in Set. Weak bisimilarity for a system is obtained as strong bisimilarity of a transformed system. The transformation consists of two steps: First, the behaviour on actions is expanded to behaviour on finite words. Second, the behaviour on finite words is taken modulo the hiding of invisi...

full text

Coalgebras in functional programming and type theory

This is a survey article on the use of coalgebras in functional programming and type theory. It presents the basic theory underlying the implementation of coinductive types, families and predicates. It gives an overview of the application of corecursive methods to the study of general recursion, formal power series, tabulations of functions on inductive data. It also sketches some advanced topi...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 5  issue 1

pages  103- 130

publication date 2016-07-01

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023