April 2009 - Beginners

Re: [Haskell-beginners] Installing Yi With GTK Frontend
by Kalman Noel 17 Apr '09

17 Apr '09

aditya siram schrieb: > I am having issues installing Yi with the GTK frontend. The gtk frontend has been replaced by the pango frontend. It depends on gtk2hs likewise. On installation, pass -fpango to Setup.hs to make sure that the frontend will get installed, or to be told what it doesn't find. Kalman

1 0

Partial Loading and Debugging with GHCI
by aditya siram 17 Apr '09

17 Apr '09

Hi all, I'm curious as to how one would go about debugging the following program: hello :: String hello = "Hello" world :: String world = "World" number :: Int number = 1 helloWorld :: String helloWorld = hello ++ " " ++ world -- This fails! bad :: String bad = hello ++ number Predictably once I load this program into ghci I get the following error: [1 of 1] Compiling Main ( TestCode.hs, interpreted ) TestCode.hs:14:15: Couldn't match expected type `[Char]' against inferred type `Int' In the second argument of `(++)', namely `number' In the expression: hello ++ number In the definition of `bad': bad = hello ++ number Failed, modules loaded: none. At this point what I want to do is to query the output type of the different functions like so: > :t hello but GHCI won't let me because the program hasn't been loaded. I would then have to comment out 'bad', reload the program and query output types to my hearts content. This is fine for a small program, but when I have functions are downriver from 'bad', it gets extremely cumbersome. Is there a way to load a file such that functions that compile stay loaded in the interpreter even if something else fails? Thanks ... -deech

4 3

Re: Thinking about monads (Brent Yorgey)
by Arthur Chan 16 Apr '09

16 Apr '09

You know, I was wondering... if Monads are a subset of Functors, and Applicative is a subset of Functors, and Monads are a subset of Applicative... shouldn't it be possible to tack on the definitions that automatically derive Functor and Applicative? Isn't it the case that there is really only one way to define Applicative for a Monad anyway? And isn't there only one way to define fmap for a Monad that makes sense? On Tue, Apr 14, 2009 at 2:39 PM, <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://www.haskell.org/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. Re: Re: Thinking about monads (Brent Yorgey) > 2. Re: How would you run a monad within another monad? > (Arthur Chan) > 3. Re: How would you run a monad within another monad? > (Arthur Chan) > 4. Re: How would you run a monad within another monad? > (Arthur Chan) > 5. Re: How would you run a monad within another monad? > (Jason Dusek) > > > ---------------------------------------------------------------------- > > Message: 1 > Date: Tue, 14 Apr 2009 16:42:08 -0400 > From: Brent Yorgey <byorgey(a)seas.upenn.edu> > Subject: Re: [Haskell-beginners] Re: Thinking about monads > To: beginners(a)haskell.org > Message-ID: <20090414204207.GA16671(a)seas.upenn.edu> > Content-Type: text/plain; charset=us-ascii > > On Mon, Apr 13, 2009 at 03:11:42PM -0700, Michael Mossey wrote: > > > > I know Maybe is both a functor and a monad, and I was thinking: what's > the > > difference? They are both wrappers on types. Then I realized, the > > difference is: they have different class definitions. > > In fact, every monad should be a functor, but not every functor is a > monad. Being a monad is a much stronger condition than being a functor. > > > > > class Functor f where > > fmap :: (a->b) -> f a -> f b > > > > (Note how fussy this definition would be in C++. It would be a kind of > > template, but would probably look a lot more complex and would require > > lengthy declarations.) > > > > class Monad m where > > a >>= b :: m a -> (a -> m b) -> m b > > Don't forget return :: a -> m a ! That's the other key method in the > Monad > class. (There are also >> and 'fail' but those are unimportant---the > first is just a specialization of >>=, and fail is a hack). > > -Brent > > > ------------------------------ > > Message: 2 > Date: Tue, 14 Apr 2009 14:05:22 -0700 > From: Arthur Chan <baguasquirrel(a)gmail.com> > Subject: Re: [Haskell-beginners] How would you run a monad within > another monad? > To: Jason Dusek <jason.dusek(a)gmail.com> > Cc: beginners(a)haskell.org > Message-ID: > <74cabd9e0904141405i1fbadb85u8b87ffb05d61c493(a)mail.gmail.com> > Content-Type: text/plain; charset="utf-8" > > Here's my contrived example that threw the error. > > If you go into ghci, and do a `:t (foo' "blah" myDoohickey)`, you will get > the type signature "IO ()". > Doing the same for myOtherDoohickey returns "IO True" > > So you would think that you'd be able to uncomment the code that makes IO > an > instance of Toplevel. foo' is a function that allows IO to run monadic > values of type Doohickey. But it doesn't work. > > > --- > > import IO > import Control.Monad.Reader > > > class (Monad n) => Doohickey n where > putRecord :: String -> n () > > class (Monad m) => Toplevel m where > foo :: (Doohickey n) => FilePath -> n a -> m a > > newtype IOToplevelT a = IOToplevelT { runIOToplevelT :: ReaderT Handle IO a > } deriving (Monad, MonadReader Handle, MonadIO) > > instance Doohickey IOToplevelT where > putRecord = liftIO . putStrLn > > foo' s k = do > f <- liftIO $ openFile s AppendMode > runReaderT (runIOToplevelT k) f > > --instance Toplevel IO where > -- foo = foo' > > myDoohickey = do > putRecord "foo" > putRecord "bar" > > myOtherDoohickey = do > putRecord "hello" > putRecord "world" > return True > > > On Mon, Apr 13, 2009 at 7:55 PM, Jason Dusek <jason.dusek(a)gmail.com> > wrote: > > > Copypasting and loading your code doesn't throw an error. Please, > > pastebin an example that demonstrates the error. > > > > -- > > Jason Dusek > > >

3 2

RWH Ch. 27 TCP Server Example
by aditya siram 14 Apr '09

14 Apr '09

Hi all, I am trying to understand the TCP Syslog Server example [1] from RWH. Specifically my question is on this piece of code: -- | Process incoming messages procMessages :: MVar () -> Socket -> SockAddr -> IO () procMessages lock connsock clientaddr = do connhdl <- socketToHandle connsock ReadMode hSetBuffering connhdl LineBuffering messages <- hGetContents connhdl mapM_ (handle lock clientaddr) (lines messages) hClose connhdl handle lock clientaddr "syslogtcpserver.hs: client disconnected" How does control stay on "mapM_ (handle lock clientaddr) (lines messages)" ? It would seem that the server would handle one message and immediately close the handle and end - but it doesn't. I'm guessing this has something to do with laziness, but I don't see how to apply it. thanks .. -deech [1] http://book.realworldhaskell.org/read/sockets-and-syslog.html

2 1

How would you run a monad within another monad?
by Arthur Chan 14 Apr '09

14 Apr '09

Hey All, Suppose we have this generalized situation: I have some class that does IO with user data, but we want to hide the full IO interface, so we do something like this: class (Monad m) => Doohickey m where getCurrentTime :: m Time olderRecords :: m [String] addRecord :: String -> m () Suppose next that we want to run a monadic value of that type, with some context, inside another monad. For example, we have some file on disk with user data. We want the top level to open the file, and then run a monadic action with the above signature. The username provides the context. Give us a username, and we'll open a file, and then run a monadic value w/ the above signature on the file. e.g. class (Monad m) => TopLevel m where openFileAndRun :: (Doohickey n) => UserName -> n a -> m a In this example, we could have a function that takes an input string s, goes through the old records, and if it sees that s is not present, then it will add it to the records. Suppose then that we want to generalize the interface, so that it could apply equally to a local file, a db, the cloud, whatever. That's why we need the Toplevel monad. We want to separate "what we want to do with the user data" from "how we will store and modify the userdata". Toplevel actions therefore needs to be able to execute Doohickey actions. How would you guys do this? I'm trying to write the signatures but ghc borks on "Ambiguous type variable in the constraints" error. It appears to be caused by the usage of the Doohickey typeclass in the signature of Toplevel, when I actually try to write a monadic value of type Toplevel, that calls a monadic value of type Doohickey. Much thanks for any help! -Arthur

2 5

Thinking about monads
by Michael Mossey 14 Apr '09

14 Apr '09

I'm getting a better grasp on monads, I think. My original problem, I think, was that I was still thinking imperatively. So when I saw this: class Monad m where (>>=) :: m a -> (a -> m b) -> m b I didn't understand the "big deal". I thought, okay so you "do" something with the function (a -> m b) and you "arrive" at m b. Now I realize that chaining a sequence of Monads via that function, a -> m b, means that a is available to any function further down the line, because it is an argument to a series of nested functions. So, doSomething = thing >>= \x -> thing2 >>= \y -> return (x,y) >>= produces a series of nested functions in which all the arguments of earlier functions are available to later functions: x and y are available to "return" because they are arguments of functions further up in the chain. This resembles imperative code in which any variable, once set, is available further down. Any clarifications welcome. -Mike

3 5

Why does forkIO also create native threads?
by Lych 13 Apr '09

13 Apr '09

I wrote a simple ECHO server like this: ---------------------------------------------------- import Network import System.IO import Control.Concurrent service cs = do ln <- hGetContents cs hPutStr cs ln service cs acceptloop ls = do (cs, host, port) <- accept ls hSetBuffering cs LineBuffering forkIO (service cs) acceptloop ls main = do ls <- listenOn (PortNumber 10061) acceptloop ls ---------------------------------------------------- And tested it with a client that initiates as many parallel connections as possible. The number of connections can just reach to 1000+ on my machine, but I thought it should be more, since forkIO generates lightweight threads. I also examined the number of threads in this process with some tool and it proved there was one native thread per connection. When I replaced the 'forkIO' in the program with 'forkOS', I got an exactly similar result. Have I thought something wrong about forkIO?

2 1

question, chapter 10 Real World Haskell
by Michael Mossey 11 Apr '09

11 Apr '09

I'll looking at the parser example, page 242 in Chapter 10 of Real World Haskell, and they are defining a type of monadic parser with the help of an operator they call ==> You can find chapter 10 online. This ebook doesn't have page numbers, but you can find the example I'm looking at in the second called "A more interesting parser", about 40% of the way down: <http://book.realworldhaskell.org/read/code-case-study-parsing-a-binary-data…> The authors have defined their parser by chaining together functions with ==>. The first function is "getState". What confuses me is: they use getState to "get the state out of the Parser," but a Parser is by definition a function that takes the parse state as its lone argument. I don't understand why they can't drop getState entirely. Maybe it's a simply a way to avoid wrapping the entire function in Parser (...)? Some of this stuff looks "inefficient" to me, but I realize that in a lazy language with an optimizing compiler you can often write long chains of functions (many of which discard their results) and not impede efficiency. Thanks, Mike

3 6

rts package in an invalid state
by aditya siram 10 Apr '09

10 Apr '09

Hi all, I recently compiled and installed ghc 6.10.2 on a clean system. But a 'ghc-pkg check' shows an error with the rts package [1]. A google search advised me to install libffi5. I did this but keep getting the same error. Any ideas? Thanks ... deech [1] http://hpaste.org/fastcgi/hpaste.fcgi/view?id=3630#a3630

3 5

Cabal install fails to download packages
by Cal Paterson 10 Apr '09

10 Apr '09

Hello, I am new to haskell, and I'm trying to get cabal to download and install packages for me. However, it seems to fail to download packages. Having cabal act on already installed packages seems to work fine. Here is the end of the output: cal@romeo:~$ cabal install haddock ... selecting unix-2.3.0.0 (installed) selecting ghc-paths-0.1.0.5 (hackage) and discarding ghc-paths-0.1, 0.1.0.1, 0.1.0.2, 0.1.0.3 and 0.1.0.4 In order, the following would be installed: ghc-paths-0.1.0.5 (new package) haddock-2.4.2 (new package) Downloading ghc-paths-0.1.0.5... GET http://hackage.haskell.org/packages/archive/ghc-paths/0.1.0.5/ghc-paths-0.1… Sending: GET /packages/archive/ghc-paths/0.1.0.5/ghc-paths-0.1.0.5.tar.gz HTTP/1.1 User-Agent: cabal-install/0.6.2 Host: hackage.haskell.org proxy uri host: , port: Creating new connection to cabal: Error: some packages failed to install: ghc-paths-0.1.0.5 failed while downloading the package. haddock-2.4.2 depends on ghc-paths-0.1.0.5 which failed to install. I first guessed that cabal was tripping up over some environment variable, but it seems that $http_proxy is unset: cal@romeo:~$ set | grep -i http | xclip http_proxy= Can anyone provide some advice as to what is likely to be going wrong? Thanks, Cal

1 0