Coinduction

Coinduction
"codata" redirects here. For the CODATA committee, see Committee on Data for Science and Technology.

In computer science, coinduction is a technique for defining and proving properties of systems of concurrent interacting objects.

Coinduction is the mathematical dual to structural induction. Coinductively defined types are known as codata and are typically infinite data structures, such as streams.

As a definition or specification, coinduction describes how an object may be "observed", "broken down" or "destructed" 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.

To generate and manipulate codata, one typically uses corecursive functions, in conjunction with lazy evaluation. Informally, rather than defining a function by pattern-matching on each of the inductive constructors, one defines each of the "destructors" or "observers" over the function result.

In programming, the co-logic paradigm (Co-LP for brevity) "is a natural generalization of logic programming and coinductive logic programming, which in turn generalizes other extensions of logic programming, such as infinite trees, lazy predicates, and concurrent communicating predicates. Co-LP has applications to rational trees, verifying infinitary properties, lazy evaluation, concurrent LP, model checking, bisimilarity proofs, etc."[1] Experimental implementations of Co-LP are available from U.T.Dallas [2] and in Logtalk (for examples see [3]) and SWI-Prolog.

See also

References

  1. ^ http://lambda-the-ultimate.org/node/2513
  2. ^ http://www.utdallas.edu/~gupta/
  3. ^ http://trac.logtalk.org/browser/trunk/examples/coinduction

Further reading

P ≟ NP  This theoretical computer science-related article is a stub. You can help Wikipedia by expanding it.