| data Wonky f
|= Wonky
|| Manky (f (Wonky f))
|deriving Show
|
| The trouble is that when I ask either hugs -98 or ghci
| -fglasgow-exts to
|
| show (Wonky :: Wonky Copy)
|
| the poor compiler's brain explodes.
I fixed this a few weeks ago. GHC (5.03) now says:
Foo.hs:3:
On Wed, 27 Feb 2002, Juan M. Duran wrote:
I got a function with type :: IO [[Double]], and what I want is write this
output in a file, how can I do it... I mean, I cannot doit by just using
writeFile
(snip)
Does something like this help at all?
myfn :: IO [[Double]]
myfn = return
Hi
On Thu, 28 Feb 2002, Tom Pledger wrote:
C T McBride writes:
| data Fix f = Fix (f (Fix f))
|
| There's no equivalent first-order definition. This is where
| higher-kind parameters actually buy us extra stuff, and it's also the
| point at which the first-order constraint for show
I'm wondering if there are any libraries out there for creating parsers
that lazily build up their result. I know I could thread the remaining
input through a parser by hand, but it seems like someone should have
already done it.
I'd like to be able to turn a stream of XML into a lazy tree of
There's a combinator which Phil Wadler called guarantee which makes a
parser lazy -- guarantee p succeeds at once, with a result which will
be produced, when demanded, by p. Many parsing libraries include it under
one name or another...
John
___
