Results 1  10
of
5,530
The Continuum as a Final Coalgebra
, 1999
"... We define the continuum up to order isomorphism, and hence up to homeomorphism via the order topology, in terms of the final coalgebra of either the functor N X, product with the set of natural numbers, or the functor 1 + N X. This makes an attractive analogy with the definition of N itself as the i ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
We define the continuum up to order isomorphism, and hence up to homeomorphism via the order topology, in terms of the final coalgebra of either the functor N X, product with the set of natural numbers, or the functor 1 + N X. This makes an attractive analogy with the definition of N itself
FINAL COALGEBRAS IN ACCESSIBLE CATEGORIES
, 905
"... Abstract. We give conditions on a finitary endofunctor of a finitely accessible category to admit a final coalgebra. Our conditions always apply to the case of a finitary endofunctor of a locally finitely presentable (l.f.p.) category and they bring an explicit construction of the final coalgebra in ..."
Abstract
 Add to MetaCart
Abstract. We give conditions on a finitary endofunctor of a finitely accessible category to admit a final coalgebra. Our conditions always apply to the case of a finitary endofunctor of a locally finitely presentable (l.f.p.) category and they bring an explicit construction of the final coalgebra
Logical Construction of Final Coalgebras
, 2003
"... We prove that every finitary polynomial endofunctor of a category C has a final coalgebra, provided that C is locally Cartesian closed, it has finite coproducts and is an extensive category, it has a natural number object. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We prove that every finitary polynomial endofunctor of a category C has a final coalgebra, provided that C is locally Cartesian closed, it has finite coproducts and is an extensive category, it has a natural number object.
Continuous functions on final coalgebras
, 2007
"... In a previous paper we have given a representation of continuous functions on streams, both discretevalued functions, and functions between streams. the topology on streams is the ‘Baire ’ topology induced by taking as a basic neighbourhood the set of streams that share a given finite prefix. We ga ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
gave also a combinator on the representations of stream processing functions that reflects composition. Streams are the simplest example of a nontrivial final coalgebras, playing in the coalgebraic realm the same role as do the natural numbers in the algebraic realm. Here we extend our previous
Similarity Quotients as Final Coalgebras
"... Abstract. We give a general framework relating a branching time relation on nodes of a transition system to a final coalgebra for a suitable endofunctor. Examples of relations treated by our theory include bisimilarity (a well known example), similarity, upper and lower similarity for transition sys ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
Abstract. We give a general framework relating a branching time relation on nodes of a transition system to a final coalgebra for a suitable endofunctor. Examples of relations treated by our theory include bisimilarity (a well known example), similarity, upper and lower similarity for transition
On The Final Coalgebra Of Automatic Sequences
, 2011
"... Abstract. Streams are omnipresent in both mathematics and theoretical computer science. Automatic sequences form a particularly interesting class of streams that live in both worlds at the same time: they are defined in terms of finite automata, which are basic computational structures in computer s ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
that the set of automatic sequences carries a final coalgebra structure, consisting of the operations of head, even, and odd. This will allow us to show that automatic sequences are to (general) streams what rational languages are to (arbitrary) languages. 1
Guarded Induction on Final Coalgebras
, 1998
"... We make an initial step towards a categorical semantics of guarded induction. While ordinary induction is usually modelled in terms of the least fixpoints and the initial algebras, guarded induction is based on the unique fixpoints of certain operations, called guarded, on the final coalgebras. So f ..."
Abstract
 Add to MetaCart
We make an initial step towards a categorical semantics of guarded induction. While ordinary induction is usually modelled in terms of the least fixpoints and the initial algebras, guarded induction is based on the unique fixpoints of certain operations, called guarded, on the final coalgebras. So
A Small Final Coalgebra Theorem
 Theoretical Computer Science
, 1998
"... This paper presents an elementary and selfcontained proof of an existence theorem of final coalgebras for endofunctors on the category of sets and functions. ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
This paper presents an elementary and selfcontained proof of an existence theorem of final coalgebras for endofunctors on the category of sets and functions.
Initial Algebra, Final Coalgebra and Datatype
, 2011
"... Induction ” in which they provided a brief introduction to initial algebras and final coalgebras[1]. Induction is used both as a definition principle, and as a proof principle for algebraic structures. But there are also important dual “coalgebraic” ..."
Abstract
 Add to MetaCart
Induction ” in which they provided a brief introduction to initial algebras and final coalgebras[1]. Induction is used both as a definition principle, and as a proof principle for algebraic structures. But there are also important dual “coalgebraic”
A Thesis Proposal on Final Coalgebras
, 1998
"... I present an overview of final coalgebras together with a description of initial algebras, showing the analogies between the two. In particular, I show how initiality of algebras leads to the properties of definition by recursion and proof by induction. I then show how final coalgebras have the anal ..."
Abstract
 Add to MetaCart
I present an overview of final coalgebras together with a description of initial algebras, showing the analogies between the two. In particular, I show how initiality of algebras leads to the properties of definition by recursion and proof by induction. I then show how final coalgebras have
Results 1  10
of
5,530