[Haskell-cafe] Non-termination of type-checking

Nicolas Pouillard nicolas.pouillard at gmail.com
Fri Jan 29 05:36:03 EST 2010

On Thu, 28 Jan 2010 18:32:02 -0800, Ryan Ingram <ryani.spam at gmail.com> wrote:
> But your example uses a recursive type; the interesting bit about this
> example is that there is no recursive types or function, and yet we
> can encode this loop.

The point is that you get the Fix type by (infintely) unfolding the
type definitions.

Nicolas Pouillard

More information about the Haskell-Cafe mailing list