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

On Thu, 28 Jan 2010 18:32:02 -0800, Ryan Ingram 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 http://nicolaspouillard.fr