[Haskell-cafe] arbitrary rank polymorphism and ghc language pragmas

Hi All: I've been working through some details in these papers [1], [2] and noticed a language pragma configuration that I hope you can confirm. When using explicit foralls in a data constructor, it appears that GHC 7.4.2 requires Rank2Types in the Language pragma for what the papers consider ran

Re: [Haskell-cafe] arbitrary rank polymorphism and ghc language pragmas

Thanks Francesco. And I did verify that ExplicitForAll does in fact allow Rank 1 Types in functions like the following ... f :: (forall a. a -> a) -- Rick On Thu, 2012-07-05 at 16:28 +0100, Francesco Mazzoli wrote: > At Thu, 05 Jul 2012 11:18:00 -0400, > rickmurphy wrote: > &

[Haskell-cafe] sample terms and interpreting program output from Tc Monad

Hi All: I'm still working through the following paper [1] and I wondered whether you could help me confirm my understanding of some sample terms and program output from the Tc Monad. For those interested, the language is specified in Parser.lhs available in the protoype here [2]. I understand the