Abstract. Recursion is a well-known and powerful programming technique, with a wide variety of applications. The dual technique of corecursion is less well-known, but is increasingly proving to be just as useful. This article is a tutorial on the four main methods for proving properties of corecursive programs: fixpoint induction, the approximation (or take) lemma, coinduction, and fusion. 1
Coinduction is an important concept in functional programming. To formally prove properties of corec...
We introduce AmiCo, a tool that extends a proof assistant, Isabelle/HOL, with flexible function defi...
International audienceWe introduce AmiCo, a tool that extends a proof assistant, Isabelle/ HOL, with...
Recursion is a well-known and powerful programming technique, with a wide variety of applications. ...
Corecursive programs produce values of greatest fixpoint types, in contrast to recursive programs, w...
Programmers happily use induction to prove properties of recursive programs. To show properties of c...
All in-text references underlined in blue are linked to publications on ResearchGate, letting you ac...
This paper presents a formalized framework for defining corecursive functions safely in a total sett...
International audienceWe present two methods for defining corecursive functions that go beyond what ...
This paper presents a formalized framework for defining corecursive functions safely in a total sett...
International audienceThis paper presents a formalized framework for defining corecursive functions ...
This paper presents a formalized framework for defining corecursive functions safely in a total sett...
This paper presents a new approach to optimising corecursive pro-grams by factorisation. In particul...
This paper presents a new approach to optimising corecursive programs by factorisation. In particula...
Presented at the WPTE 2022 workshop (https://wpte2022.github.io), Haïfa, Israel, August 2022, whose ...
Coinduction is an important concept in functional programming. To formally prove properties of corec...
We introduce AmiCo, a tool that extends a proof assistant, Isabelle/HOL, with flexible function defi...
International audienceWe introduce AmiCo, a tool that extends a proof assistant, Isabelle/ HOL, with...
Recursion is a well-known and powerful programming technique, with a wide variety of applications. ...
Corecursive programs produce values of greatest fixpoint types, in contrast to recursive programs, w...
Programmers happily use induction to prove properties of recursive programs. To show properties of c...
All in-text references underlined in blue are linked to publications on ResearchGate, letting you ac...
This paper presents a formalized framework for defining corecursive functions safely in a total sett...
International audienceWe present two methods for defining corecursive functions that go beyond what ...
This paper presents a formalized framework for defining corecursive functions safely in a total sett...
International audienceThis paper presents a formalized framework for defining corecursive functions ...
This paper presents a formalized framework for defining corecursive functions safely in a total sett...
This paper presents a new approach to optimising corecursive pro-grams by factorisation. In particul...
This paper presents a new approach to optimising corecursive programs by factorisation. In particula...
Presented at the WPTE 2022 workshop (https://wpte2022.github.io), Haïfa, Israel, August 2022, whose ...
Coinduction is an important concept in functional programming. To formally prove properties of corec...
We introduce AmiCo, a tool that extends a proof assistant, Isabelle/HOL, with flexible function defi...
International audienceWe introduce AmiCo, a tool that extends a proof assistant, Isabelle/ HOL, with...