3 ms·
>(9) Haskell Eats Circular Definitions for Breakfast It's recursive, not circular, definition. A circular definition never ends while a recursive one does.
by Open-Juicer 16y ago
>(9) Haskell Eats Circular Definitions for Breakfast
It's recursive, not circular, definition. A circular definition never ends while a recursive one does.
- primodemus 16y agoI think sigpfe is talking about corecursive definitions, which can produce infinite data structures: http://en.wikipedia.org/wiki/Corecursion http://en.wikipedia.org/wiki/Corecursion