Year: 1999
Type: conference-paper
Abstract: Corecursive programs produce values of greatest fixpoint types, in contrast to recursive programs, which consume values of least fixpoint types. There are a number of widely used methods for proving properties of corecursive programs, including fixpoint induction, the take lemma, and coinduction. However, these methods are all rather low-level, in that they do not exploit the common structure that is often present in corecursive definitions. We argue for a more structured approach to proving properties of corecursive programs. In particular, we show that by writing corecursive programs using a simple operator that encapsulates a common pattern of corecursive definition, we can then use high-level algebraic properties of this operator to conduct proofs in a purely calculational style that avoids the use of inductive or coinductive methods. 1 INTRODUCTION Recursion is a central concept in computing, with applications ranging from the theoretical foundations of computation [22] to pract...
Authors: Jeremy Gibbons, Graham Hutton
Institutions: University of Oxford, University of Nottingham
Language: English
Subfield: Software
Field: Computer Science
Domain: Physical Sciences
Keywords: corecursion, coinduction, program verification
Open Access status: green
OpenAlex ID: W1531654553
