3 ms·
Not quite. IIRC, corecursive programs (and the coinductive data-types they return) are straightforwardly nonterminating: they can loop infinitely. The differe
by eli_gottlieb 12y ago
Not quite. IIRC, corecursive programs (and the coinductive data-types they return) are straightforwardly nonterminating: they can loop infinitely. The difference is that each iteration is proven to terminate and to yield a well-specified result, and arbitrary theorems can be proven about the generator function yielding each iteration's result.
http://www.cse.chalmers.se/research/group/logic/TypesSS05/Extra/bertot_sl2.pdf http://www.cse.chalmers.se/research/group/logic/TypesSS05/Ex...