December 2004 - Haskell-Cafe

local loops
by Per Larsson 14 Dec '04

14 Dec '04

I often use local loops in monadic code, e.g. main = do ... let loop = do ... if cond then loop else return () loop It seems that I can encode this idiom slightly more concise with the 'fix' operator (from Control.Monad.Fix), i.e. main = do ... fix (\loop -> do ... if ...) But is it really semantically equivalent? Is it as efficient? Per

1 0

Flattening tail recursion?
by GoldPython 13 Dec '04

13 Dec '04

I'm missing something, a functional idiom, whatever. I know there's "length" to count the elements in a list and it works fine, but the function below stack overflows on a large list. countLines [] = 0 countLines (_:ls) = 1 + countLines ls I would have thought that this was tail recursive and would be flattened into iteration by the compiler. Can anyone explain why? Is it because the call is embedded in an expression? And additionally, how can I predict when the flattening will occur? Thanks, Will

10 20

FiniteMapFiniteMap
by Dominic Steinitz 13 Dec '04

13 Dec '04

See also http://www.mail-archive.com/haskell-cafe@haskell.org/msg05809.html Dominic.

1 0

FiniteMapFiniteMap
by S. Alexander Jacobson 13 Dec '04

13 Dec '04

I would like to read a large finitemap off of a disk faster than the time it takes to read the entire list of pairs. My solution is to save it as a bunch of smaller lists of pairs covering various key intervals (or recency intervals). I then can readfile all of these lists back into a bunch of finitemaps. Because readfile is lazy my program can start very quickly without waiting to read the contents of all of these files. To make this solution work, I need some datastructure that looks like a finitemap but operates on a bunch of them organized either in parallel (key interval model) or series (time interval model). Is there some pre-existing data structure that does this or do I need to roll my own? Or is there a better way to (de-)serialize FiniteMaps? -Alex- ______________________________________________________________ S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com

2 3

AbstractDataType question
by Jason Bailey 13 Dec '04

13 Dec '04

So in the wiki on AbstractDataType ( http://haskell.org/hawiki/AbstractDataType ) it gives the following example: data Tree a = Nil | Node { left :: Tree a, value :: a, right :: Tree a } The part where I am confused is with the use of '{' and '}' my reference book is apparently out of date as it states that Haskell doesn't even use those characters :) Could someone point me to some documentation on whats being created here and how its used? thank you Jason

4 4

RE: [Haskell-cafe] Flattening tail recursion?
by Simon Peyton-Jones 13 Dec '04

13 Dec '04

I have not been following the details, but yes, the strictness analyser only runs when you say -O, and without strictness analysis you can get different space behaviour. Sometimes more, sometimes less. In this case, strictness analysis helps. Simon | -----Original Message----- | From: haskell-cafe-bounces(a)haskell.org [mailto:haskell-cafe-bounces@haskell.org] On Behalf Of Jules | Bean | Sent: 10 December 2004 21:38 | To: GoldPython | Cc: Henning Thielemann; haskell-cafe | Subject: Re: [Haskell-cafe] Flattening tail recursion? | | | On 10 Dec 2004, at 20:33, GoldPython wrote: | | > Just compiled this with -O and it ran with no stack overflow. | > Evidently, no `seq` needed for this one. Using ghc 6.2.2. | > | > countLines l = countLines' 0 l | > countLines' n [] = n | > countLines' n (_:ls) = countLines' (n + 1) ls | > | | That's presumably the answer. GHC's strictness analyser *can* cope with | this situation but only under -O... whereas most of us where testing | under ghci... | | Confirmation from one of the Simons? | | Jules | | _______________________________________________ | Haskell-Cafe mailing list | Haskell-Cafe(a)haskell.org | http://www.haskell.org/mailman/listinfo/haskell-cafe

1 0

ghc install
by Radu Grigore 11 Dec '04

11 Dec '04

Hi, I try to install ghc on 6.2 on a gentoo linux distribution (from sources). It fails with --- /usr/bin/ar: creating libHSbase.a xargs: /usr/bin/ar: terminated by signal 15 --- It looks like it's a lack of resources. The computer is a Celeron 1.3GHz with 160MB RAM & 400MB swap. Isn't that enough to compile ghc? -- regards, radu http://rgrig.idilis.ro/

2 1

Class Synonyms
by Jorge Adriano Aires 11 Dec '04

11 Dec '04

Hello! I got a multi-parameter type class: > class Foo a b | a -> b where > foo_method1 :: ... > foo_method2 :: ... > ... And some particular cases are important on their own, like the one where 'a' and 'b' are the same, I call elements with this property, Bar. So I defined: class Foo a a => Bar a where This is nice, now I can replace (F a a) for (Bar a) in the context of many functions. Less typing and it's more readable. Still, I have to define instances as: > instance Foo A A where > foo_method1 = bla1 > foo_method2 = bla2 > > instance Bar A where I'd like to achieve something better than this. I was looking for something like "class synonyms". So if I declared an instance Foo A A, I automagicaly had Bar A, because they'd be the same. Or even better, I could declare > instance Bar A where > foo_method1 = bla1 > foo_method2 = bla2 Is anything like this possible at all? Thanks, J.A.

2 4

Processing File Dependencies
by chris beddoe 11 Dec '04

11 Dec '04

2 1

Flattening tail recursion?
by Derek Elkins 11 Dec '04

11 Dec '04

> intermediate thunk has already been built. You need a separate "strict > foldl" function, usually called foldl', which was unaccountably > omitted from the prelude. There is one in Data.List.

1 0