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, co-logic programming (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 logic programming, model checking, bisimilarity proofs, etc." Experimental implementations of co-LP are available from The University of Texas at Dallas and in Logtalk (for examples see https://github.com/LogtalkDotOrg/logtalk3/tree/master/examples/coinduction) and SWI-Prolog.

See also

* F-coalgebra * Corecursion * Bisimulation * Anamorphism * Total functional programming

References

** Further reading **

;Textbooks
* Davide Sangiorgi (2012). ''Introduction to Bisimulation and Coinduction''. Cambridge University Press.
* Davide Sangiorgi and Jan Rutten (2011). ''Advanced Topics in Bisimulation and Coinduction''. Cambridge University Press.
;Introductory texts
* Andrew D. Gordon (1994). — mathematically oriented description
* Bart Jacobs and Jan Rutten (1997)

A Tutorial on (Co)Algebras and (Co)Induction

alternate link

— describes induction and coinduction simultaneously * Eduardo Giménez and Pierre Castéran (2007)

"A_Tutorial_on_[Co-

/nowiki>Inductive_Types_in_Coq".html" style="text-decoration: none;"class="mw-redirect" title="o-">"A Tutorial on[Co-

/nowiki>Inductive Types in Coq"">o-">"A Tutorial on[Co-

/nowiki>Inductive Types in Coq"

Coinduction

— short introduction ;History * [[Davide Sangiorgi]].

On the Origins of Bisimulation and Coinduction

, ACM Transactions on Programming Languages and Systems, Vol. 31, Nb 4, Mai 2009. ;Miscellaneous

Co-Logic Programming: Extending Logic Programming with Coinduction

— describes the co-logic programming paradigm Category:Theoretical computer science Category:Logic programming Category:Functional programming Category:Category theory Category:Mathematical induction {{comp-sci-theory-stub

See also

* F-coalgebra * Corecursion * Bisimulation * Anamorphism * Total functional programming

References

A Tutorial on (Co)Algebras and (Co)Induction

alternate link

— describes induction and coinduction simultaneously * Eduardo Giménez and Pierre Castéran (2007)

"A_Tutorial_on_

/nowiki>Inductive_Types_in_Coq".html" style="text-decoration: none;"class="mw-redirect" title="o-">"A Tutorial on

/nowiki>Inductive Types in Coq"">o-">"A Tutorial on

/nowiki>Inductive Types in Coq"

Coinduction

— short introduction ;History * [[Davide Sangiorgi]].

On the Origins of Bisimulation and Coinduction

, ACM Transactions on Programming Languages and Systems, Vol. 31, Nb 4, Mai 2009. ;Miscellaneous

Co-Logic Programming: Extending Logic Programming with Coinduction

— describes the co-logic programming paradigm Category:Theoretical computer science Category:Logic programming Category:Functional programming Category:Category theory Category:Mathematical induction {{comp-sci-theory-stub