[Haskell-cafe] Re: Aren't type system extensions fun? [Further analysis]

Achim Schneider barsoap at web.de
Thu May 29 09:21:37 EDT 2008

Kim-Ee Yeoh <a.biurvOir4 at asuhan.com> wrote:

> Luke Palmer-2 wrote:
> > 
> > You have now introduced a first-class type function a la dependent
> > types, which I believe makes the type system turing complete.  This
> > does not help the decidability of inference :-)
> > 
> God does not care about our computational difficulties. He infers
> types emp^H^H^H ... uh, as He pleases.
This begs the question: Can God come up with a type He doesn't

The answer, it seems, is Mu.

(c) this sig last receiving data processing entity. Inspect headers for
past copyright information. All rights reserved. Unauthorised copying,
hiring, renting, public performance and/or broadcasting of this
signature prohibited. 

More information about the Haskell-Cafe mailing list