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

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. Anyway, the original point of it was semantic. Let's first explore the meaning of "the most general type." Type functions give one answer, intersection types another. -- Kim-Ee (yeoh at cs dot wisc dot edu) -- View this message in context: http://www.nabble.com/Aren%27t-type-system-extensions-fun--tp17479349p175347... Sent from the Haskell - Haskell-Cafe mailing list archive at Nabble.com.