Editing Talk:Corecursion (section)

== Duality? ==

I don't understand the definition ''corecursion is a type of operation that is dual to recursion'' because I don't know which duality it refers to.  I know lots of dualities (e.g. min/max in lattices, point/line in projective geometry.)  Is the particular duality referred to here something to do with reversing arrows in Category Theory?  If so, perhaps the article should say something about it, or at least make reference to a page that does. [[User:Tom Duff|Tom Duff]] 19:48, 15 January 2007 (UTC)

Also, what does [[bisimulation]] (one of the references) have to do with corecursion? [[User:Tom Duff|Tom Duff]] 19:51, 15 January 2007 (UTC)

I added a reference to David Turner's "Total Functional Programming" paper, which might help:  a significant part of it is the introduction and discussion of codata, corecursion, and coinduction as first-class duals to data, recursion, and induction.  --[[User:Piet Delport|Piet Delport]] 15:27, 26 January 2007 (UTC)