- Beginners - Haskell.org

Bit confused...
by mike h 04 Feb '17

04 Feb '17

I have ---------- import qualified Data.Map as M type Link a = (a, Int) data MChain a = Map a [Link a] deriving (Show) ------------------- and want to make a Monoid of MChain. So I have ------------------- instance Monoid (MChain a) where mempty = M.empty mappend = undefined ------------------- this won’t compile and I need M.empty to be Map a [Link a] The error is Couldn't match expected type ‘MChain a1’ with actual type ‘M.Map k0 a0’ • In the expression: M.empty :: MChain a In an equation for ‘mempty’: mempty = M.empty :: MChain a In the instance declaration for ‘Monoid (MChain a)’ This part confuses me "Couldn't match expected type ‘MChain a1 with actual type ‘M.Map k0 a0’ " How should I proceed. Many thanks Mike

2 2

Question about example in 'using do notation with Writer' section of LYH
by Olumide 03 Feb '17

03 Feb '17

Hello List, Chapter 14 of LYH ( http://learnyouahaskell.com/for-a-few-monads-more#reader ) has the following bit of code: import Control.Monad.Writer logNumber :: Int -> Writer [String] Int logNumber x = Writer (x, ["Got number: " ++ show x]) multWithLog :: Writer [String] Int multWithLog = do a <- logNumber 3 b <- logNumber 5 return (a*b) I have a fair grasp of what's going bu the last line return(a*b) eludes me. Specifically its the a*b part that baffles me. I think 3 is bound to 'a' and 5 to 'b', then return(a*b) would put the value 15 in a context ... So what becomes of the string parts of the Writer monads created by logNumber 3 and logNumber 5 respectively. Regards, - Olumide

4 6

applicative instance
by sasa bogicevic 30 Jan '17

30 Jan '17

What is wrong with my applicative instance for custom List type ? http://lpaste.net/351723 data List a = Nil | Cons a (List a) deriving (Eq, Show) instance Applicative List where pure x = Cons x Nil Nil <*> _ = Nil _ <*> Nil = Nil (Cons x xy) <*> (Cons z dy) = Cons (x z) (xy <*> dy) Prelude> let functions = Cons (+1) (Cons (*2) Nil) Prelude> let values = Cons 1 (Cons 2 Nil) Prelude> functions <*> values Cons 2 (Cons 3 (Cons 2 (Cons 4 Nil))) -- I get Cons 2 (Cons 4 Nil) what is wrong with my Applicative instance ? { name: Bogicevic Sasa phone: +381606006200 }

4 7

Re: [Haskell-beginners] Ambiguous type variable prevents the constraint `(Ord t0)' from being solved.
by 鲍凯文 30 Jan '17

30 Jan '17

Hi, I refactored it as such: apply_listd [] d x = d x apply_listd ((a,b):t) d x = case compare x a of EQ -> a GT -> b _ -> d x applyd f d x = look f where k = 5 look (Leaf h l) | h == k = apply_listd l d x look (Branch p b l r) | (k `xor` p) .&. (b - 1) == 0 = look (if k .&. b == 0 then l else r) look _ = d x ...and it compiled so i'm not sure what happened there. Simpler though: adding the type signature applyd :: Ord a => Func a b -> (a -> b) -> a -> b also made it compile. I'm not sure why ghc thinks there's multiple instances to choose from (somebody please explain), but in any case adding type signatures will give you better error messages/help ghc. Hope that helps a bit. On Sun, Jan 29, 2017 at 4:00 AM, <beginners-request(a)haskell.org> wrote: > Send Beginners mailing list submissions to > beginners(a)haskell.org > > To subscribe or unsubscribe via the World Wide Web, visit > http://mail.haskell.org/cgi-bin/mailman/listinfo/beginners > or, via email, send a message with subject or body 'help' to > beginners-request(a)haskell.org > > You can reach the person managing the list at > beginners-owner(a)haskell.org > > When replying, please edit your Subject line so it is more specific > than "Re: Contents of Beginners digest..." > > > Today's Topics: > > 1. Ambiguous type variable prevents the constraint `(Ord t0)' > from being solved. (Ivan Kush) > > > ---------------------------------------------------------------------- > > Message: 1 > Date: Sat, 28 Jan 2017 23:09:09 +0300 > From: Ivan Kush <ivan.v.kush(a)yandex.ru> > To: beginners(a)haskell.org > Subject: [Haskell-beginners] Ambiguous type variable prevents the > constraint `(Ord t0)' from being solved. > Message-ID: <5152611485634149(a)web34j.yandex.ru> > Content-Type: text/plain; charset=utf-8 > > I get this error (full message at the end of the mail). How could I > correct my code? > > > =================== > Code: > =================== > > module Intro where > > import Data.Bits -- for xor, .&. > > data Func a b > = Empty > | Leaf Int [(a, b)] > | Branch Int Int (Func a b) (Func a b) > > applyd = > let apply_listd l d x = > case l of > [] -> d x > (a, b) : t -> > let c = compare x a > in if c == EQ then b > else if c == GT then apply_listd t d x > else d x > > in \f d x -> > let k = 5 -- hash x - todo > in let look t = > case t of > Leaf h l | h == k -> > apply_listd l d x > Branch p b l r | (k `xor` p) .&. (b - 1) == 0 -> -- > (Branch p b l r) | ((k xor p) .&. (b - 1)) == 0 -> > look (if k .&. b == 0 then l else r) > _ -> d x > in look f > > > > =================== > Error: > =================== > > Intro.hs:37:25: error: > * Ambiguous type variable `t0' arising from a use of `apply_listd' > prevents the constraint `(Ord t0)' from being solved. > Relevant bindings include > l :: [(t0, t)] (bound at Intro.hs:36:28) > t :: Func t0 t (bound at Intro.hs:34:21) > look :: Func t0 t -> t (bound at Intro.hs:34:16) > x :: t0 (bound at Intro.hs:32:15) > d :: t0 -> t (bound at Intro.hs:32:13) > f :: Func t0 t (bound at Intro.hs:32:11) > (Some bindings suppressed; use -fmax-relevant-binds=N or > -fno-max-relevant-binds) > Probable fix: use a type annotation to specify what `t0' should be. > These potential instances exist: > instance Ord Ordering -- Defined in `GHC.Classes' > instance Ord Integer > -- Defined in `integer-gmp-1.0.0.1:GHC.Integer.Type' > instance Ord a => Ord (Maybe a) -- Defined in `GHC.Base' > ...plus 22 others > ...plus five instances involving out-of-scope types > (use -fprint-potential-instances to see them all) > * In the expression: apply_listd l d x > In a case alternative: Leaf h l | h == k -> apply_listd l d x > In the expression: > case t of { > Leaf h l | h == k -> apply_listd l d x > Branch p b l r > | (k `xor` p) .&. (b - 1) == 0 > -> look (if k .&. b == 0 then l else r) > _ -> d x } > > > -- > Best wishes, > Ivan Kush > > > ------------------------------ > > Subject: Digest Footer > > _______________________________________________ > Beginners mailing list > Beginners(a)haskell.org > http://mail.haskell.org/cgi-bin/mailman/listinfo/beginners > > > ------------------------------ > > End of Beginners Digest, Vol 103, Issue 25 > ****************************************** >

1 0

Change in type that I don't understand
by Jan Erik Moström 27 Jan '17

27 Jan '17

Hi, Here is something that I don't understand, why does the named value have a different type than just the value itself? Prelude> let f x = x * x Prelude> :t f f :: Num a => a -> a Prelude> :t [f] [f] :: Num a => [a -> a] Prelude> let g = [f] Prelude> :t g g :: [Integer -> Integer] = jem

3 6

system and FilePath with space
by PICCA Frederic-Emmanuel 26 Jan '17

26 Jan '17

Hello I try to execute a command using system. my code is like this system (unwords ["python", p]) where p :: FilePath p = "/my super/script.py" has you can see this path contain a space. When I try to run it I get an error python: can't open file '/my': So the system command is wrong. I understand that I need to escape the space in the command, like this p = "/my\ super/script.py" now is there a function in haskell for this. a sort of sanitizer for FilePath when used by system. Thanks Frederic

3 4

Memory Profiling Graph Explanation!
by Gilberto Melfe 24 Jan '17

24 Jan '17

Hello all! I'm trying to understand the memory allocation charts produced by the Haskell GHC profiler. My doubt at this moment is this: the graph shown at [1], is what is called an Area Graph; but I can't find information on what sort of area graph it is, is it an overlapped area graph or a stacked area graph? or put another way, is the higher point (more or less horizontally centered) value read from the x (seconds) axis (from 0K) or from the top "line" for the lesser area plots (namely from around 4k) So, is the highest value an absolute value taken from the y axis, or that value minus the higher value for the 2nd greatest area plot in the graph? Thank You Very Much in advance for any help! Gilberto Melfe [1] https://downloads.haskell.org/~ghc/latest/docs/html/users_guide/profiling.h…

1 0

(no subject)
by PICCA Frederic-Emmanuel 24 Jan '17

24 Jan '17

Hello, Here a reduction of my problem values :: IO [IO (Maybe Int)] values = do let v = [Just 1, Just 2, Just 3, Nothing, Just 5, Nothing, Just 7] :: [Maybe Int] return $ map return v main :: IO () main = do vs <- values nvs <- mapM_ go vs print nvs where go :: IO (Maybe Int) -> IO Int go v' = do Just v <- v' return v when I run this script, I get a runtime error picca@diffabs6:~/tmp$ runhaskell test.hs test.hs: user error (Pattern match failure in do expression at test.hs:13:10-15) What I want is a go method which skip silently the (IO Nothing) values. so when used in the mapM_ it return only the values which are returned by the IO (Maybe Int) (stored in the values) Thanks for your help Frédéric Indeed

2 2

What is wrong with my types signatures.
by PICCA Frederic-Emmanuel 23 Jan '17

23 Jan '17

Hello here a snipset code class Shape sh => FrameND t sh where shapeND :: t -> MaybeT IO sh rowND :: t -> sh -> MaybeT IO (XrdMeshFrame sh) I have an instance of FrameND then I created a function which use this class framesND :: (Shape sh, FrameND a sh) => Pipe a (XrdMeshFrame sh) IO () framesND = do d <- await sh' <- lift $ runMaybeT $ shapeND d let n = size sh' forM_ [0..n-1] (\i' -> do f <- lift $ runMaybeT $ rowND d (fromIndex sh' i') when (isJust f) (yield (fromJust f))) But when I compile it; I get this error message src/Hkl/XRD.hs:613:55: Could not deduce (sh ~ Maybe a0) from the context (Shape sh, FrameND a sh) bound by the type signature for framesND :: (Shape sh, FrameND a sh) => Pipe a (XrdMeshFrame sh) IO () at src/Hkl/XRD.hs:606:13-70 `sh' is a rigid type variable bound by the type signature for framesND :: (Shape sh, FrameND a sh) => Pipe a (XrdMeshFrame sh) IO () at src/Hkl/XRD.hs:606:13 Expected type: Maybe (XrdMeshFrame sh) Actual type: Maybe (XrdMeshFrame (Maybe a0)) In the first argument of `fromJust', namely `f' In the first argument of `yield', namely `(fromJust f)' In the second argument of `when', namely `(yield (fromJust f))' So I do not undestand why the typse system guess Maybe a0 instead of sh in f If I read this f <- lift $ runMaybeT $ rowND d (fromIndex sh' i') runMaybeT return a (Maybe (XrdMeshFrame sh)) and then I lift it into the Pipe. So What is wrong ? thanks Frederic

2 2

how to skip pattern match error when applying a mapM_
by PICCA Frederic-Emmanuel 18 Jan '17

18 Jan '17

Sorry I forgot to put a subject ________________________________________ De : Beginners [beginners-bounces(a)haskell.org] de la part de PICCA Frederic-Emmanuel Envoyé : mardi 17 janvier 2017 11:15 À : The Haskell-Beginners Mailing List - Discussion of primarily beginner-level topics related to Haskell Objet : [Haskell-beginners] (no subject) Hello, Here a reduction of my problem values :: IO [IO (Maybe Int)] values = do let v = [Just 1, Just 2, Just 3, Nothing, Just 5, Nothing, Just 7] :: [Maybe Int] return $ map return v main :: IO () main = do vs <- values nvs <- mapM_ go vs print nvs where go :: IO (Maybe Int) -> IO Int go v' = do Just v <- v' return v when I run this script, I get a runtime error picca@diffabs6:~/tmp$ runhaskell test.hs test.hs: user error (Pattern match failure in do expression at test.hs:13:10-15) What I want is a go method which skip silently the (IO Nothing) values. so when used in the mapM_ it return only the values which are returned by the IO (Maybe Int) (stored in the values) Thanks for your help Frédéric Indeed _______________________________________________ Beginners mailing list Beginners(a)haskell.org http://mail.haskell.org/cgi-bin/mailman/listinfo/beginners

5 15