Adding coinduction into discrete mathematics

  • Authors:
  • Cong-Cong Xing

  • Affiliations:
  • Nicholls State University, Thibodaux, LA

  • Venue:
  • Journal of Computing Sciences in Colleges
  • Year:
  • 2014

Quantified Score

Hi-index 0.00

Visualization

Abstract

Coinduction is the dual notion of induction in the sense that union is the dual notion of intersection in set theory. Unfortunately, while induction has long been established as one of the most fundamental techniques in Computer Science, coinduction is rarely known to most of the Computer Science practitioners. This paper presents a short introduction to the coinduction paradigm in terms of coinductive data, coinductive functions, and coinductive proofs. With the increasingly growing interests in coinduction and its applications, it can be expected that coinduction will soon become one of the standard subjects, just as induction, in discrete mathematics.