AbstractIn 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
Traditionally, formal languages are defined as sets of words. More recently, the alternative coalgeb...
International audienceThis paper describes a formalization of discrete real closed fields in the Coq...
AbstractIn this paper we introduce the notion of an observational coalgebra structure and of a compl...
Real number computation in modern computers is mostly done via floating point arithmetic which can s...
AbstractWe implement exact real numbers in the logical framework Coq using streams, i.e., infinite s...
In this article we present a method for formally proving the correctness ofthe lazy algorithms for c...
This paper studies coinductive representations of real numbers bysigned digit streams and fast Cauch...
AbstractWe define the continuum up to order isomorphism (and hence homeomorphism) as the final coalg...
International audienceThis paper shows a construction in Coq of the set of real algebraic numbers, t...
International audienceIn this paper we describe some certified algorithms for exact real arithmetic b...
AbstractThis is a survey article on the use of coalgebras in functional programming and type theory....
AbstractWe investigate the relation between the set-theoretical description of coinduction based on ...
Based on a new coinductive characterization of continuous functions we extract certified programs fo...
Final coalgebras of a functor F are suited for an abstract description of infinite datatypes and dyn...
The abstract mathematical structures known as coalgebras are of increasing interest in computer scie...
Traditionally, formal languages are defined as sets of words. More recently, the alternative coalgeb...
International audienceThis paper describes a formalization of discrete real closed fields in the Coq...
AbstractIn this paper we introduce the notion of an observational coalgebra structure and of a compl...
Real number computation in modern computers is mostly done via floating point arithmetic which can s...
AbstractWe implement exact real numbers in the logical framework Coq using streams, i.e., infinite s...
In this article we present a method for formally proving the correctness ofthe lazy algorithms for c...
This paper studies coinductive representations of real numbers bysigned digit streams and fast Cauch...
AbstractWe define the continuum up to order isomorphism (and hence homeomorphism) as the final coalg...
International audienceThis paper shows a construction in Coq of the set of real algebraic numbers, t...
International audienceIn this paper we describe some certified algorithms for exact real arithmetic b...
AbstractThis is a survey article on the use of coalgebras in functional programming and type theory....
AbstractWe investigate the relation between the set-theoretical description of coinduction based on ...
Based on a new coinductive characterization of continuous functions we extract certified programs fo...
Final coalgebras of a functor F are suited for an abstract description of infinite datatypes and dyn...
The abstract mathematical structures known as coalgebras are of increasing interest in computer scie...
Traditionally, formal languages are defined as sets of words. More recently, the alternative coalgeb...
International audienceThis paper describes a formalization of discrete real closed fields in the Coq...
AbstractIn this paper we introduce the notion of an observational coalgebra structure and of a compl...