- Beginners - Haskell.org

Ruby Quiz Solution #15 - won't work after compilation
by Alex Watt 14 Aug '08

14 Aug '08

If I call "main" in ghci, my program runs as it should, but if I try compiling it, and then running the result of that compilation, i.e.: $ ghc -o animal_game game.hs $ ./animal_game unexpected things occur, particularly "getChar" does not work correctly, and if I take a route that doesn't lead to getChar needing to be called, the program stops running at the end of 2nd run despite your response to the do-you-want-to-play-again-question. $ ./animal_game .... Do you want to play again? (y/n) y .... Do you want to play again? (y/n) y Thanks for playing! $ The source code is here: http://rafb.net/p/7fYlEV72.html I don't know how long that will stay up there, so let me know if it's gone and I'll repaste or find a better alternative. What would also be nice is any comments on the actual code; as a begginner, it's nice to get some feedback, and I might as well also ask the following question. Originally I wanted to the types to be as such: data Animal = Animal String data Question a b = Question String a b -- where a is a Question or an Animal, as is b The problem is I wanted methods that had types that were able to accept an argument of type Animal or Question, and for it to act appropriately on that type, I tried adding them to common type classes (a new one I created called 'Askable' which contained a method 'ask'), but I ran into a whole bunch of problems. Is there any easy way to do it?

4 5

Haskell in K-12 education?
by Benjamin L.Russell 13 Aug '08

13 Aug '08

Does anybody know of any uses of Haskell in teaching programming in K-12 education? Recently, I read an interesting essay entitled "Why Computer Science Doesn’t Matter" (see http://www.ccs.neu.edu/home/matthias/essays/not-matter.html) by Matthias Felleisen and Shriram Krishnamurthi, on how using multimedia examples in teaching programming in K-12 education could potentially elevate programming to a Fourth R ("'rogramming"), in addition to the current Three Rs ("reading," "’riting," and "’ritmetic"). They suggest tying together programming and mathematics, using the idea that "modern arithmetic and algebra doesn’t have to be about numbers," but that "[i]t may involve images, strings, symbols, Cartesian points, and other forms of “objects.”" Their discussion reminded me of _The Haskell School of Expression_ (see http://www.haskell.org/soe/) by Paul Hudak, which also uses multimedia examples to motivate programming, but at a more advanced (college) level. Currently, DrScheme (see http://www.drscheme.org/) (based on Scheme) and Squeak (see http://www.squeak.org/) (based on a dialect of Smalltalk) are two programming environments that are often used in K-12 schooling to teach programming, but I see no reason that Haskell could not fulfill this role as well. Does anybody know of any books/tools for using Haskell as a tool to teach programming in K-12 education? -- Benjamin L. Russell

1 0

SOEGraphics
by Simon Parry 13 Aug '08

13 Aug '08

Hello, apologies if this is the wrong forum. I'm having trouble getting going with the SOEGraphics library (I'm trying to work my way through The Haskell School of Expression book). I'm running GHC 6.8.3 using emacs on a windows XP machine. I'm getting a 'Could not find module `GraphicsUtils'' load error when I import SOEGraphics but I can see the file in the correct folder (which is included in my .emacs file)? Any suggestions? thanks Simon Parry

2 1

Problem building packages
by emmanuel.delaborde 11 Aug '08

11 Aug '08

Hello, I am trying to build HAppS-Util with cabal-install it fails with the following message: could not execute: /Library/Frameworks/GHC.framework/Versions/608/usr/ lib/ghc-6.8.3/ghc-asm What can I do to circumvent this ? Thanks E ----------------------------------------------------------------------------------------------- This e-mail (and any attachments) is confidential and may contain personal views which are not the views of Cimex Media Ltd and any affiliated companies, unless specifically stated. It is intended for the use of the individual or group to whom it is addressed. If you have received it in error, please delete it from your system, do not use, copy or disclose the information in any way nor act in reliance on it and please notify postmaster(a)cimex.com A company registered in England Wales. Company Number 03765711 Registered Office : The Olde Bakehouse, 156 Watling Street East, Towcester, Northants NN12 6DB This email was scanned by Postini, the leading provider in Managed Email Security.

1 0

Factorials using foldx
by Paul Johnston 08 Aug '08

08 Aug '08

Hi (First question so be gentle)! Just started to look at Haskell and I was wondering about various versions of calculating factorials. If I have facr 0 = 1 facr n = foldr (*) 1 [1..n] facl 0 = 1 facl n = foldl (*) 1 [1..n] Is there any difference in efficiency, I remember reading it is better to count down than to count up but left to right or right to left :-) Cheers Paul Paul Johnston Humanities Development Team Room 2.12 Bridgeford Street Building Manchester University Tel 0161 275 1396 Mail Paul.Johnston(a)manchester.ac.uk Web http://web-1.humanities.manchester.ac.uk/prjs/mcasspj/ How to shoot yourself in the foot Unix % ls foot.c foot.h foot.o toe.d toe.o %rm* .o rm:.o no such file or directory

5 4

Representing a subset relationship
by Levi Stephen 04 Aug '08

04 Aug '08

Hi, I was wondering what the best way to represent a 'subset' type relationship would be. The use case I'm looking at is where the subset would be a user selection, so a filter would not be appropriate. For example, say I have something like: type Order = [OrderItem] type OrderItem = OrderItem { qty :: Int, product: Product } Now I'd like the user to be able to select a number of items (e.g., priority shipping, gift wrapping) One possible way I can see is to add extra fields to the OrderItem record, but this seems like it would not be easy to extend. It doesn't seem like using [Product] would be appropriate as if the Product is updated it will need to be updated in both the OrderItem list and in the subset. Another approach would be to use a ProductIdType in place of Product, then look up the actual Product as needed. Are there other (and better) ways to do this? Thanks, Levi

2 1

Pattern Matching
by Alex Watt 03 Aug '08

03 Aug '08

Hi there, The best way I can explain what I'd like to do is show an example, so here goes: same :: a -> a -> Bool same x x = True same _ _ = False Is there any way to do this in Haskell? The actual reason I'd like to do this is something slightly more complicated. I want to match against a list of elements, like so: foo [x,x,x] = ... Thanks for any help. - Alex

4 3

data type design question
by Markus Barenhoff 31 Jul '08

31 Jul '08

Hi, I have written a parsec parser for reading a marshallaled dataformat. The returned data structure is based on the following data type: > data T = TString String > | TInt Integer > | TList [TorrentT] > | TDict [(TorrentT, TorrentT)] I think TString and TInt are clear. The elements of a TList always have the same "type" (same constructor). The TDict is a dictionary where the key is always a TString but the value can be of any of the other "types", even in the same dictionary. F.e the key "foo" may map to a TInt while the key "bar" maps to another TDict. I'am not happy with this declaration, but I'am not sure how to express this better. One haskell data type for each of the four and then using type classes? Maybe something like this? : > type TString = String > type TInt = Integer > type TList = TC t => [t] > type TDict = (TC t) => [(TString, t)] > class TC where ... > instance TC TString > instance TC TInt > instance TC TList > instance TC TDict Thnx for some inseperation! Markus -- Markus Barenhoff - Münster - Germany - Europe - Earth e-mail: alios(a)alios.org - jabber: alios(a)jabber.ccc.de - icq: 27998346

6 9

[Haskell-begin] Looking for cunning ways to update a tree
by Quergle Quergle 29 Jul '08

29 Jul '08

Hello all, This is a really helpful list: I've learned half a dozen new things just by reading this month's traffic. Anyway...I have the following bit of code that updates a tree structure given a route to a leaf: data Tree a = Leaf a | Node (Tree a) (Tree a) deriving (Show, Eq) data PathSelector = GoLeft | GoRight deriving (Show, Eq) type Path = [PathSelector] selectChild (Node left _) GoLeft = left selectChild (Node _ right ) GoRight = right updateNode (Node _ right) GoLeft newLeft = Node newLeft right updateNode (Node left _) GoRight newRight = Node left newRight updateLeaf new (Leaf previous) = Leaf new updateTree :: Tree a -> Path -> a -> Tree a updateTree tree path newValue = case path of [] -> updateLeaf newValue tree (p:ps) -> updateNode tree p (updateTree' (selectChild tree p) ps newValue) I wanted to rewrite updateTree without using explicit recursion. Unfortunately, the best I could come up with is: upDownRecurse :: (a -> b -> a) -> (a -> c) -> (a -> b -> c -> c) -> a -> [b] -> c upDownRecurse down bottoming up = upDownRecurse' where upDownRecurse' acc [] = bottoming acc upDownRecurse' acc (x:xs) = up acc x (upDownRecurse' (down acc x) xs) updateTree' :: Tree a -> Path -> a -> Tree a updateTree' tree path newValue = upDownRecurse selectChild (updateLeaf newValue) updateNode tree path So what's the sexier way of doing this? Cheers, -- Matt

3 5

[Haskell-begin] Maximum of a List?
by Steve Klabnik 29 Jul '08

29 Jul '08

Hello everyone- I'm working on some project Euler problems today, and I'm stuck on one. It's not the problem itself that's the problem, it's that finding the maximum of a list makes me run out of heap space! http://projecteuler.net/index.php?section=problems&id=14 my code: import Data.List f :: Int -> Int -> Int f acc x | x == 1 = acc | even x = f (acc + 1) (x `div` 2) | otherwise = f (acc + 1) (3 * x + 1) answer = (foldl' max 0) $ map (f 1) [1 .. 999999] I tried using 'foldl' max ' instead of 'maximum' because I thought that foldl' was supposed to work better than foldl or something...I could be confused on that point. Anyway, here's what I get... / _ \ /\ /\/ __(_) / /_\// /_/ / / | | GHC Interactive, version 6.4, for Haskell 98. / /_\\/ __ / /___| | http://www.haskell.org/ghc/ \____/\/ /_/\____/|_| Type :? for help. Loading package base-1.0 ... linking ... done. Prelude> :l ..\test.hs Compiling Main ( ..\test.hs, interpreted ) Ok, modules loaded: Main. *Main> answer GHC's heap exhausted: current limit is 268435456 bytes; Use the `-M<size>' option to increase the total heap size. I also tried writing a simple 'max' function that I thought was tail recursive, and that that would help. Same error. I'm finding it hard to believe that finding a maximum of a list of a million small integers would cause this kind of overflow...is it really that big of a problem? Any help would be appreciated. I have a feeling I'll run into this problem again in the future.

5 15