Conference item icon

Conference item

Proof Methods for Structured Corecursive Programs

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 the sense that they do not exploit the common structure that is often present in corecursive definitions. We argue for a more structured a...

Expand abstract

Actions


Authors


More by this author
Institution:
University of Oxford
Department:
Mathematical, Physical and Life Sciences Division - Department of Computer Science
Role:
Author
Publication date:
1999-01-01
URN:
uuid:bd0e450b-0d92-40e9-9e26-e9ffd202c7f0
Local pid:
cs:2352

Terms of use


Metrics


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP