Jump to content

Coinduction

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Toby Bartels (talk | contribs) at 22:18, 14 June 2007 (Double the size of this still-stub.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In computer science, coinduction is a technique for defining, and proving properties of, systems of concurrent interacting objects. Mathematically, it is dual to structural induction.

As a definition or specification, coinduction describes how an object may be broken down into simpler objects. As a proof technique, it may be used to show that an equation is satisfied by all possible implementations of such a specification.

References