Article contents
Practical coinduction
Published online by Cambridge University Press: 09 February 2016
Abstract
Induction is a well-established proof principle that is taught in most undergraduate programs in mathematics and computer science. In computer science, it is used primarily to reason about inductively defined datatypes such as finite lists, finite trees and the natural numbers. Coinduction is the dual principle that can be used to reason about coinductive datatypes such as infinite streams or trees, but it is not as widespread or as well understood. In this paper, we illustrate through several examples the use of coinduction in informal mathematical arguments. Our aim is to promote the principle as a useful tool for the working mathematician and to bring it to a level of familiarity on par with induction. We show that coinduction is not only about bisimilarity and equality of behaviors, but also applicable to a variety of functions and relations defined on coinductive datatypes.
- Type
- Paper
- Information
- Mathematical Structures in Computer Science , Volume 27 , Special Issue 7: Special Issue: Coalgebraic Logic , October 2017 , pp. 1132 - 1152
- Copyright
- Copyright © Cambridge University Press 2016
References
- 16
- Cited by