- Beginners - Haskell.org

Happy generated parser fails to compile.
by Rohit Garg 27 Sep '10

27 Sep '10

Hi, Following is a simple parser definition I am trying to write for simple numerical expressions. A sequence of numerical expressions actually. Happy reports that there are 3 un-used terminals. AFAIK, they should be let, in and '='. Is that correct? Although, happy generates a .hs file without any other message. GHC gives a type mismatch error. I don't suppose it could be a lexer error, could it? a) Could this be a bug in Happy (very unlikely, IMO) it is generating code that has type mismatches. b) If there is a bug in my parser definition, shouldn't Happy beep on it? Any suggestions to fix it will be highly appreciated. Thanks, =================== { module Main where import Tokens_posn } %name calc %tokentype { Token } %token let { Let _ } in { In _ } ';' { Newstatement _ } int { Int _ $$ } var { Var _ $$ } '=' { Sym _ '=' } '+' { Sym _ '+' } '-' { Sym _ '-' } '*' { Sym _ '*' } '/' { Sym _ '/' } '(' { Sym _ '(' } ')' { Sym _ ')' } %% Exprs :: { [ Expr ] } Exprs : Exprs Expr ';' { $2 : $1 } | Expr ';' { [$1] } Expr : Expr '+' Term { PlusE $1 $3 } | Expr '-' Term { MinusE $1 $3 } | Term { $1 } Term : Term '*' Factor { TimesE $1 $3 } | Term '/' Factor { DivE $1 $3 } | Factor { $1 } Factor : '-' Atom { NegE $2 } | Atom { $1 } Atom : int { IntE $1 } | var { VarE $1 } | '(' Expr ')' { $2 } { data Expr = LetE String Expr Expr | PlusE Expr Expr | MinusE Expr Expr | TimesE Expr Expr | DivE Expr Expr | NegE Expr | IntE Int | VarE String deriving Show flist :: [Int] -> Int -> [Int] flist x a = a : x main:: IO () main = interact (show.runCalc) runCalc :: String -> Expr runCalc = calc . alexScanTokens happyError :: [Token] -> a happyError tks = error ("Parse error at " ++ lcn ++ "\n") where lcn = case tks of [] -> "end of file" tk:_ -> "line " ++ show l ++ ", column " ++ show c where AlexPn _ l c = token_posn tk } -- Rohit Garg http://rpg-314.blogspot.com/

3 3

Empty 'do' constructor
by Sok H. Chang 27 Sep '10

27 Sep '10

I use Haskell Platform 2010.2.0.0 on WinXP, and jEdit. I write my first code, and got error... main = do cs <- readFile "C:\\SPR.txt" putStrLn $ myManupulation cs myManupulation cs = (unlines cs) ! 3 The error message is "Empty 'do' construct" What's this mean? and how can I fix it? Thank you a lot! -- Sok Ha, CHANG Open Mind Clinic/Academy, 1551-1, Sa-Dong, SangRok-Gu, AnSan-City, KyongGi-Do Tel: 031-407-6114 HP: openmind.ac / www.openmind.ac

4 4

Types and the difference between GHCi interactive and a file
by Russ Abbott 26 Sep '10

26 Sep '10

The following runs without a problem. Prelude> let null' xs = xs == [] null' :: (Eq a) => [a] -> Bool Prelude> let main' = do print (null' []) main' :: IO () Prelude> main' True it :: () But if I put essentially the same code in a file and try to load the file I get an error. File: Null null' xs = xs == [] main = do print (null' []) Prelude> :load "Null.hs" [1 of 1] Compiling Main ( Null.hs, interpreted ) Null.hs:3:17: Ambiguous type variable `a' in the constraint: `Eq a' arising from a use of `null'' at Null.hs:3:17-24 Probable fix: add a type signature that fixes these type variable(s) Failed, modules loaded: none. Why is that? I had thought that the ambiguity was referring to the type of [] in the print statement, i.e., that GHC can't figure out the type of []. If I modify the print statement to be print ( null' ([] :: [Int]) ) everything is ok. But if that's the case, why is this not a problem at the interactive level? Here is a related question. In the following what does it mean to say that x is of type [a] where "a" is a type variable? Prelude> let x = [] x :: [a] For example, Prelude> x == (tail [1 :: Int]) True it :: Bool Prelude> x == (tail [1 :: Float]) True it :: Bool Prelude> (tail [1 :: Int]) == (tail [1 :: Float]) <interactive>:1:28: Couldn't match expected type `Int' against inferred type `Float' In the expression: 1 :: Float In the first argument of `tail', namely `[1 :: Float]' In the second argument of `(==)', namely `(tail [1 :: Float])' Can a value like the value of x really be of an incompletely specified type? I couldn't do that in the file. When I tried the following in the file, print (null' ([] :: (Eq a) => a)) I got this error message on loading the file. Null.hs:3:24: Couldn't match expected type `a1' against inferred type `[a]' `a1' is a rigid type variable bound by an expression type signature at Null.hs:3:34 In the first argument of `null'', namely `([] :: (Eq a) => a)' In the first argument of `print', namely `(null' ([] :: (Eq a) => a))' In the expression: print (null' ([] :: (Eq a) => a)) Thanks. -- Russ

2 2

E-mail
by Angela Sheard 24 Sep '10

24 Sep '10

I'd like to post to the mailing list. My e-mail is: angelasheard(a)gmail.com Thanks! :D

2 1

generating arbitrary parameter lists
by Amy de Buitléir 24 Sep '10

24 Sep '10

Whenever I want to use quickCheck to test some function with multiple input parameters, I end up writing boilerplate code that looks like the example below. I have a feeling I'm missing out on some good Haskell tricks. In particular, writing a function like arbXYZ for every combination of parameter types that I need to test is a bit repetitive. Is there a better way? Thank you in advance, Amy ----- code example ----- functionIWantToTest :: Double -> Int -> Bool -> Double functionIWantToTest x y z = 27 -- pretend we're doing something useful arbXYZ :: Gen (Double, Int, Bool) arbXYZ = do x <- choose (0.0, 1.0) y <- choose (1, 10) z <- arbitrary return (x, y, z) conditionIWantToCheck :: (Double, Int, Bool) -> Bool conditionIWantToCheck (x, y, z) = True -- pretend we're checking something prop_i_want_to_check :: Property prop_i_want_to_check = forAll arbXYZ conditionIWantToCheck

2 2

Implementing a toy network proxy
by Patrick LeBoutillier 24 Sep '10

24 Sep '10

Hi , I'm trying to write a toy generic network proxy that will accept connections on a port, and for each connection connect to a remote server and forward the traffic. Here's what I have do far: import Network import System.IO import Control.Exception import Control.Concurrent copy :: Handle -> Handle -> IO () copy a b = undefined redir :: Handle -> Handle -> IO () redir h1 h2 = forkIO (copy h1 h2) >> forkIO (copy h2 h1) >> return () acceptLoop :: Socket -> HostName -> PortID -> IO () acceptLoop sock rhost rport = loop where loop = do (local, host, port) <- accept sock remote <- connectTo rhost rport redir local remote loop >> return () main = do let local_port = 8000 let remote_host = "whatever" let remote_port = 80 server <- listenOn (PortNumber local_port) acceptLoop server remote_host (PortNumber remote_port) Basically I'm stuck at how to implement the copy function. I want it to block until some data is available on a, read it and then write it to b. I think I need to use hGetBufNonBlocking, but I don't know how to get a "Ptr a". I am on the right track with this? Patrick -- ===================== Patrick LeBoutillier Rosemère, Québec, Canada

2 3

Current status of GUM
by Monica Sakuray Pais 23 Sep '10

23 Sep '10

Hello, I would like to know about the current status of GUM: - What is the latest version available? - Does it run on distributed memory multiprocessors - clusters? What type of architectures? thanks. Monica

3 2

Fw: [Haskell-beginners] Installing package hsc3 – Haskell supercollider
by Deb Midya 23 Sep '10

23 Sep '10

Hi Haskell Users, Thanks in advance. At DOS prompt, I have typed: \ghc>cabal install hsc3 The following message appears: Warning: The package list for 'hackage.haskell.org' does not exist. Run 'cabal update' to download it. cabal: There is no package named hsc3. Perhaps you need to run 'cabal update' first? At DOS prompt, I typed: \ghc> cabal update The following message appears: Downloading the latest package list from hackage.haskell.org cabal: failed Is there any solution for it please? What will be the procedure, if I download first and then install (Is there any set of commands here?) Once again, thank you very much for the time you have given. Regards, Deb --- On Fri, 17/9/10, Deb Midya <debmidya(a)yahoo.com> wrote: From: Deb Midya <debmidya(a)yahoo.com> Subject: [Haskell-beginners] Installing package hsc3 – Haskell supercollider To: beginners(a)haskell.org Received: Friday, 17 September, 2010, 2:14 PM Hi Haskell Users, Thanks in advance. I am using Haskell on Windows XP. I have downloaded HaskellPlatform-2010.2.0.0-setup.exe and installed it. I have checked that GHCi version is 6.12.3. May I request you to assist me for the following please: To install Haskell supercollider package, I have downloaded hsc3-0.7.tar.gz. How can I install this package now? Is there any document (how to use) on this package? To assist me for this, I have also checked that whether cabal is working or not. To do that: At dos prompt: \ghc>cabal –help \ghc> cabal install –help It shows me flags for help and installation. Once again, thank you very much for the time you have given. Regards, Deb -----Inline Attachment Follows----- _______________________________________________ Beginners mailing list Beginners(a)haskell.org http://www.haskell.org/mailman/listinfo/beginners

4 5

haskell scheduling
by Nowshad 21 Sep '10

21 Sep '10

Hi Hope that You are doing fine. I am stuck at this problem if you have any idea kindly help me out. I want to output the schedule for a given task and method for one hyper period....like (o, just (T4 3 1 3 1), (1, Just (T2 5 1 51) etc Regards Nowshad data Task = T4 Phase Period Execution Deadline | T2 Period Execution deriving (Show ,Eq) type Phase = TimeUnit type Period = TimeUnit type Execution = TimeUnit type Deadline = TimeUnit type TimeUnit = Int data Method = RM | DM | EDF deriving (Show , Eq) periodicSchedule :: Method -> [Task] -> [(TimeUnit, Maybe Task)]

3 2

help using Data.Map lookup - how to get values after the "Just" constructor
by Martin Tomko 21 Sep '10

21 Sep '10

Dear All, as a newbie, I am only just discovering some intricacies of haskell. I have a Data.Map map, and am trying the lookup function to get the value for a given key (it is a list in my case, btw). I am struggling to get access to the value, as it is constructed using Just. I know that the question is therefore more general then the application on Map, so I would be glad to get a wider picture. I Checked in Real World Haskell, btu did nto find and answer. In Haskell the craft of... I found the following (p263): mapValue :: (a->b)-> Maybe a -> Maybe b mapValue g (Just a) = Just (g a) mapValue g Nothing = Nothing Which is fine, but it makes the Just constructor travel through the whole code, which is annoying. Is there a way out? Or would that be a dirty hack? I do not quite understand the following discussion of maybe (p263-4), but it seems like the code suggested is able to return a value at the end... Thanks Martin

3 10