- Beginners - Haskell.org

Using symbolic values in the case expression
by C K Kashyap 11 Nov '10

11 Nov '10

Hi, I'd like to do something like this - Instead of doing this - f x = case x of 1 -> "One" 2 -> "Two" I'd like to do this - v1 = 1 v2 = 2 f x = case of v1 -> "One" v2 -> "Two" Is that possible? -- Regards, Kashyap

4 5

a simple problem
by Anonymous W 11 Nov '10

11 Nov '10

Hi, I'm having trouble with this small exercise. A function maybeA takes a list of pairs. A pair has a variable 'a' and a value 'b'. If any first element of a pair equals to any first element of another pair, the function returns Nothing. If they aren't equal, the function returns a tuple containing the first variable, its value and the value of the second variable. maybeA :: [(a,b)] -> Maybe (a,b,b) For example: [(a1,b1),(a2,b2),(a3,b3)..] returns Nothing if a2 = a3 and returns Just (a2,b2,b3) if a2 /= a3 I'm currently have :maybeA [(a1,b1),(a2,b2)] |a1 == a2 = Nothing |a1 /= a2 = Just (x1,y1,y2) but it only takes 2 pairs. Any helps? Thanks

3 2

Can ghc compiler Optimize the several calls to Same function
by nicholas.ulysses 11 Nov '10

11 Nov '10

It's my code to do some recursive things, focus on function 'group'. ---- cow.hs year1 [y1,y2,y3,y4x] = y1 year2 [y1,y2,y3,y4x] = y2 year3 [y1,y2,y3,y4x] = y3 year4x [y1,y2,y3,y4x] = y4x cow_group_sum year = sum (group year) --look here-- group 1 = [1,0,0,0] group (year+1) = [(year4x (group year)), (year1 (group year)), (year2 (group year)), ((year4x (group year)) + (year3 (group year)))] main = print (cow_group_sum 50) ---- end Every time 'group' was called, the (group year) function was called 4 times . when call (group 30), it takes tens seconds to finish. I have tried 'ghc -O3', but it's still 'lazy' on this thing. Map-Reduce seems to be the answer to the question. But I want to make sure that ghc CAN or CANNOT do the Optimize for Dynamic Programming? ---------------- xingbo wu

3 2

case as guards in lambda functions
by Russ Abbott 10 Nov '10

10 Nov '10

I have often wanted to use a guard in a lambda function and had thought it wasn't possible. But apparently the case construct allows a viable approach. Here is a silly example. testCase = map (\xs -> case xs of [] -> "empty list" [y] | y < 5 -> "small singleton" | otherwise -> "large singleton" _ -> "multi-element list") > testCase [[], [2], [7], [1,2,3]] ["empty","small singleton","large singleton","multi-element list"] It seems particularly useful to be able to include both patterns and guards in case expressions. I haven't seen this usage anywhere. Is it considered bad form? * -- Russ *

3 2

IO loops with tail call
by Yasuyuki Ogawa 10 Nov '10

10 Nov '10

Hello! I wrote a simple echo program which end up with input "q": echo = do str <- getLine if (str == "q") then return () else putStrLn str >> echo then I thought it is not tail call because if expressions return a value. (is it right?) So I changed a code: echo "q" = return () echo xs = do putStrLn xs xs' <- getLine echo xs' but Monad connections are too complicated so that I'm not sure it is tail call. Am I wrong? Thank you! -------------------------------------- Get the new Internet Explorer 8 optimized for Yahoo! JAPAN http://pr.mail.yahoo.co.jp/ie8/

4 7

How to select items from one list depending on another
by C K Kashyap 10 Nov '10

10 Nov '10

Hi, I have this problem at hand - Given two lists list1 = [0,1,2,0,1,4] list2 = [1,2,3,4,5,6] I need to take items from the second list only when the corresponding item in list1 is non-zero. list3 = map snd $ filter takeValid $ zip list1 list2 where takeValid (a,b) = a /= 0 Is there a shorter way? -- Regards, Kashyap

7 8

Typeclass Hierarchies on Gtk2Hs
by John Smith 10 Nov '10

10 Nov '10

I'm learning Gtk2Hs, and there is an interesting pattern to the types. Each type of widget has its own typeclass, e.g. Button and ButtonClass, Window and WindowClass. Is this idiomatic Haskell? Are there other ways to achieve such a hierarchy? (OO languages support such inheritance without requiring an interface for every class.)

1 0

Showing control characters
by Russ Abbott 10 Nov '10

10 Nov '10

Is there some way to include control characters in a Show string so that they take effect when the element is Shown? For example, if I define a String "a\nb" and use putStrLn on it, the \n causes a return, but when I simply return the string from a function, the \n is shown as \n. Is there a way to get the \n to execute when it's embedded in a returned value? Thanks * -- Russ Abbott _____________________________________________* * Professor, Computer Science California State University, Los Angeles Google voice: 424-235-5752 (424-cell-rja) blog: http://russabbott.blogspot.com/ vita: http://sites.google.com/site/russabbott/ _____________________________________________*

2 2

Friend Modules?
by John Smith 10 Nov '10

10 Nov '10

I have a module which defines data structures and their functions for a program. I have another module which defines show methods for the structures. Both modules have a substantial amount of code, and I would prefer to keep them separate. However, the show methods require access to internal data structures, which would not normally be exported. Furthermore, many modules do not require the show functions. Is there any solution to this, other than an intermediate module which imports the data module, and only exports the required names?

2 1

Question about recursion
by Nadav Chernin 09 Nov '10

09 Nov '10

Hi, all I wrote function that delete elements from list by indexes: delIndexes::[Int]->[a]->[a] delIndexes [] list = list delIndexes _ [] = [] delIndexes indexes list = take x list ++ delIndexes ( map (\y->y-x-1) xs ) ( drop (x+1) list( where )x:xs)=sort indexes There is problem that in each step of recursion this function sort list of indexes ( in last line) How can I write this code that sorting will be executed only once (in first step)? Thank you, Nadav

2 1