Results 1 
9 of
9
Recursive coalgebras from comonads
 Inform. and Comput
, 2006
"... The concept of recursive coalgebra of a functor was introduced in the 1970s by Osius in his work on categorical set theory to discuss the relationship between wellfounded induction and recursively specified functions. In this paper, we motivate the use of recursive coalgebras as a paradigm of struct ..."
Abstract

Cited by 15 (3 self)
 Add to MetaCart
(Show Context)
The concept of recursive coalgebra of a functor was introduced in the 1970s by Osius in his work on categorical set theory to discuss the relationship between wellfounded induction and recursively specified functions. In this paper, we motivate the use of recursive coalgebras as a paradigm of structured recursion in programming semantics, list some basic facts about recursive coalgebras and, centrally, give new conditions for the recursiveness of a coalgebra based on comonads, comonadcoalgebras and distributive laws of functors over comonads. We also present an alternative construction using countable products instead of cofree comonads.
Generalizing Substitution
, 2003
"... It is well known that, given an endofunctor H on a category C, the initial (A + H−)algebras (if existing), i.e., the algebras of (wellfounded) Hterms over different variable supplies A, give rise to a monad with substitution as the extension operation (the free monad induced by the functor H). Mo ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
It is well known that, given an endofunctor H on a category C, the initial (A + H−)algebras (if existing), i.e., the algebras of (wellfounded) Hterms over different variable supplies A, give rise to a monad with substitution as the extension operation (the free monad induced by the functor H). Moss [17] and Aczel, Adámek, Milius and Velebil [2] have shown that a similar monad, which even enjoys the additional special property of having iterations for all guarded substitution rules (complete iterativeness), arises from the inverses of the final (A + H−)coalgebras (if existing), i.e., the algebras of nonwellfounded Hterms. We show that, upon an appropriate generalization of the notion of substitution, the same can more generally be said about the initial T ′ (A, −)algebras resp. the inverses of the final T ′ (A, −)coalgebras for any endobifunctor T ′ on any category C such that the functors T ′ (−,X) uniformly carry a monad structure.
Coinductive Field of Exact Real Numbers and General Corecursion
, 2006
"... In this article we present a method to define algebraic structure (field operations) on a representation of real numbers by coinductive streams. The field operations will be given in two algorithms (homographic and quadratic algorithm) that operate on streams of Möbius maps. The algorithms can be se ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
(Show Context)
In this article we present a method to define algebraic structure (field operations) on a representation of real numbers by coinductive streams. The field operations will be given in two algorithms (homographic and quadratic algorithm) that operate on streams of Möbius maps. The algorithms can be seen as coalgebra maps on the coalgebra of streams and hence they will be formalised as general corecursive functions. We use the machinery of Coq proof assistant for coinductive types to present the formalisation.
Brzozowski’s and upto algorithms for must testing?
"... Abstract. Checking language equivalence (or inclusion) of finite automata is a classical problem in Computer Science, which has recently received a renewed interest and found novel and more effective solutions, such as approaches based on antichains or bisimulations upto. Several notions of equiv ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. Checking language equivalence (or inclusion) of finite automata is a classical problem in Computer Science, which has recently received a renewed interest and found novel and more effective solutions, such as approaches based on antichains or bisimulations upto. Several notions of equivalence (or preorder) have been proposed for the analysis of concurrent systems. Usually, the problem of checking these equivalences is reduced to checking bisimilarity. In this paper, we take a different approach and propose to adapt algorithms for language equivalence to check one prime equivalence in concurrency theory, must testing semantics. To achieve this transfer of technology from language to must semantics, we take a coalgebraic outlook at the problem. 1
www.elsevier.com/locate/entcs Recursive Coalgebras from Comonads ⋆ 1,2
"... We discuss Osius’s [22] concept of a recursive coalgebra of a functor from the perspective of programming semantics and give some new sufficient conditions for the recursiveness of a functorcoalgebra that are based on comonads, comonadcoalgebras and distributive laws. ..."
Abstract
 Add to MetaCart
(Show Context)
We discuss Osius’s [22] concept of a recursive coalgebra of a functor from the perspective of programming semantics and give some new sufficient conditions for the recursiveness of a functorcoalgebra that are based on comonads, comonadcoalgebras and distributive laws.
COINDUCTIVE FORMAL REASONING IN EXACT REAL
, 2007
"... Vol. 4 (3:6) 2008, pp. 1–40 ..."
(Show Context)