[Haskell-cafe] Inferred type is less polymorphic than expected, depends on order

[Jason Dagit]

On Mon, Oct 6, 2008 at 2:27 PM, Jason Dagit <dagit at codersbase.com> wrote:

>
> For what it's worth, in my real program where this came up, sy was created
> by a recursive call like this:
>

I guess it should have been more like this:

blah :: Sealed (p x)
foo :: Sealed (q b)
foo = do
  p <- blah
  q <- foo
  return (Sealed (f p q))

Sorry for any confusion!
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://www.haskell.org/pipermail/haskell-cafe/attachments/20081006/358d3320/attachment.htm