Coinduction is a dual concept to induction; it has been discovered and studied recently. A simple way to understand its naturalness is noting that it refers to the largest fixed points, while induction refers to smallest fixed points. Originally the technical support of the coinduction was the lattices theory through the largest fixed points; now this support is in the language categories through the final F-coalgebras. The F-coalgebras is a dual concept of generalization to algebras for a functor F. In this paper we focus on a particular type of F-coalgebras: stream automata. Our aim will be to use the framework of stream automata to illustrate the coinductive character of real analysis through classical results as the fundamental theorem...
Induction is a well-established proof principle that is taught in most undergraduate programs in mat...
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...
AbstractWe present a theory of streams (infinite sequences), automata and languages, and formal powe...
textabstractStreams, (automata and) languages, and formal power series are viewed coalgebraically. I...
Coinduction is a mathematical tool that is used pervasively in computer science: to program and reas...
Based on the presence of a final coalgebra structure on the set of streams (infinite sequences of re...
The classical theory of deterministic automata is presented in terms of the notions of homomorphism ...
AbstractWe investigate the relation between the set-theoretical description of coinduction based on ...
AbstractIn this article we present a method to define algebraic structure (field operations) on a re...
Final coalgebras of a functor F are suited for an abstract description of infinite datatypes and dyn...
Induction is a well-established proof principle that is taught in most undergraduate programs in mat...
AbstractWe present a categorical logic formulation of induction and coinduction principles for reaso...
This paper extends the fibrational approach to induction and coinduction pioneered by Hermida and Ja...
AbstractBased on the presence of a final coalgebra structure on the set of streams (infinite sequenc...
Induction is a well-established proof principle that is taught in most undergraduate programs in mat...
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...
AbstractWe present a theory of streams (infinite sequences), automata and languages, and formal powe...
textabstractStreams, (automata and) languages, and formal power series are viewed coalgebraically. I...
Coinduction is a mathematical tool that is used pervasively in computer science: to program and reas...
Based on the presence of a final coalgebra structure on the set of streams (infinite sequences of re...
The classical theory of deterministic automata is presented in terms of the notions of homomorphism ...
AbstractWe investigate the relation between the set-theoretical description of coinduction based on ...
AbstractIn this article we present a method to define algebraic structure (field operations) on a re...
Final coalgebras of a functor F are suited for an abstract description of infinite datatypes and dyn...
Induction is a well-established proof principle that is taught in most undergraduate programs in mat...
AbstractWe present a categorical logic formulation of induction and coinduction principles for reaso...
This paper extends the fibrational approach to induction and coinduction pioneered by Hermida and Ja...
AbstractBased on the presence of a final coalgebra structure on the set of streams (infinite sequenc...
Induction is a well-established proof principle that is taught in most undergraduate programs in mat...
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...