- Haskell-Cafe - Haskell.org

is there some book about haskell and data struct and alg?
by smellcode 31 May '08

31 May '08

is there some book about haskell and data struct and alg? i mean data struct and algorithm in haskell i am freshman i want to study haskell with data struct and alg -- Hu Jinpu (nickname: smellcode) Web developer email =~ /(^hujinpu)\@(gmail)\.(com)$/ or email.gsub!(/hujinpu/, 'smellcode') http://hujinpu.net

9 10

Re: [Haskell] Programme terminates silently
by Bertram Felgenhauer 31 May '08

31 May '08

(redirecting to haskell-cafe. the haskell mailing list is primarily for announcements) (sorry, Thomas, if you get this message twice) Thomas Bevan wrote: > I've written the programme below. > > The lircLoop should never terminate. Unfortunately it does. Worse, no error > messages are generated. > Not even the final line "Closing down" is printed. > > How is this possible? I couldn't find the Hmpf.Fork module you're using, so I couldn't test this. However, one possibility is that program receives a signal that is neither handled or ignored. This is the case for SIGPIPE [1]. You can strace your program to find out whether that's the case. System.Posix.Process provides facilities for installing your own signal handlers. HTH, Bertram [1] http://hackage.haskell.org/trac/ghc/ticket/1619

1 0

Re: [Haskell-cafe] Data.Tree.Zipper in the standard libraries
by Krasimir Angelov 31 May '08

31 May '08

An updated Zipper version is uploaded here: http://www.haskell.org/haskellwiki/User_talk:Kr.angelov It doesn't use State monad anymore and it returns Maybe. This seems to be the common preference, is it? Feel free to vote against. Should we change Data.Map also? There is another proposal for changes in findMin/findMax so it is better to make this two breaking changes together rather than in a later release. It also allows to pass whole new subtree in insert{Left/Right/Down}. On Sat, May 24, 2008 at 3:41 AM, <ajb(a)spamcop.net> wrote: > G'day all. > > Quoting Don Stewart <dons(a)galois.com>: > >> This is Haskell, we should use Maybe. > > This is Haskell, more abstract is good. > > I do agree, though, that Monad is arguably the wrong abstraction. Something > like this would arguably be better: > > class (Functor f) => Fail f where > return :: a -> f a > fail :: String -> f a > > (And yes, the String is arguably important; Maybe doesn't give you that.) > > Cheers, > Andrew Bromage > _______________________________________________ > Haskell-Cafe mailing list > Haskell-Cafe(a)haskell.org > http://www.haskell.org/mailman/listinfo/haskell-cafe >

3 3

Fwd: Re: [Haskell-cafe] [Newbie question] -- Looping stdin until condition is met
by Martin Blais 31 May '08

31 May '08

FYI. On Sat, 31 May 2008 02:11:13 +0200, "Daniel Fischer" <daniel.is.fischer(a)web.de> said: > Am Samstag, 31. Mai 2008 02:28 schrieb Martin Blais: > > Allright, this is a definitely a newbie question. > > > > I'm learning Haskell and going through the exercises in the > > beautiful Hutton book, and one of them requires for me to > > write a loop that queries a line from the user (stdin), > > looping until the user enters a valid integer (at least > > that's how I want to implement the interface to the > > exercise). I have tried tons of variants and modifications > > of code, and I can't find the way to implement this. Here is > > what my emacs buffer is at now:: > > > > import Text.Read > > import System.IO > > import qualified Control.Exception as C > > > > getNum :: IO Int > > getNum = do line <- (hGetLine stdin) > > x <- (C.catch (do return (read line :: Int)) (\e -> getNum)) > > return x > > All you need is a little strictness, > x <- (C.catch (return $! read line :: Int) (\e -> getNum)) > works. Another option is using evaluate instead of return. > The problem is that (read line :: Int) is not evaluated until it is > needed, > that is when it's going to be printed, but then it's too late to catch > the > exception. > > Some general remarks: > hGetLine stdin === getLine > do x <- action > return x > is the same as > action > > > > > main = do x <- getNum > > putStr ((show x) ++ "\n") > > print x > > > > Now, I've tried the Prelude's catch, the Control.Exception > > catch, I've tried moving it at the top of getnum, I've tried > > without catch, I've tried a ton of other shtuff, so much > > that I'm starting to think that Emacs is going to run out of > > electrons soon. I asked some half-newbie friends who are > > insanely enthousiastic about Haskell and they can't do it > > either (I'm starting to think that those enthousiastic > > friends are dating a beautiful girl with 3 PhDs, but she has > > a 2-inch thick green and gooey wart smack on her nose and > > they're so blindly in love that they can't admit that she > > does). I've asked some university profs and they sidetrack > > my question by saying I shouldn't do I/O so early. Can > > anyone here restore my faith in the Haskell section of > > humanity? > > > > 1. How do I catch the exception that is raised from "read"? > > By forcing the evaluation. > > > > 2. Where do I find the appropriate information I need in > > order to fix this? I'm probably just not searching in the > > right place. (Yes, I've seen the GHC docs, and it doesn't > > help, maybe I'm missing some background info.) > > Get used to lazy evaluation, the Hutton book should contain a chapter > about > that. > > > > > 3. Please do not tell me I should solve the problem > > differently. Here is the problem I'm trying to solve, and > > nothing else: > > > > "Write a program that reads a line from the user, > > looping the query until the line contains a valid > > integer." > > > > It shouldn't be too hard i think. The best answer would be a > > two-liner code example that'll make me feel even more stupid > > than I already do. > > > > Thanks in advance. > > >

1 0

I/O without monads, using an event loop
by Robin Green 30 May '08

30 May '08

I have been thinking about to what extent you could cleanly do I/O without explicit use of the I/O monad, and without uniqueness types (which are the main alternative to monads in pure functional programming, and are used in the Concurrent Clean programming language). Suppose you have a main event handler function, like this: eventMain :: (Event, SystemState AppState) -> (Command, SystemState AppState) This function could be called over and over in an event loop, until an EndProgram command was received, and the event loop would itself do all the actual I/O (the SystemStates are only in-memory representations of some part of the system state, plus the application's own state). Things like disk I/O could be done with commands which generate events when complete. Interprocess communication could be done in the same way. Then eventMain, and everything called by it, would be referentially-transparent, and yet non-monadic. You could of course build higher-level stuff on top of that. On the other hand, it's quite stateful, because anything you need to remember between events need to be recorded, either in the SystemState or externally (e.g. in a file). I suppose this is the most important disadvantage? Is there any published work or code using this approach, or something like it, in a pure functional language? I'm primarily interested in embedded system and desktop UIs, rather than say web-based systems, although both would be interesting. -- Robin

7 7

Lazy lists simulated by unboxed mutable arrays
by Henning Thielemann 30 May '08

30 May '08

I wonder whether the following idea has been investigated or implemented somewhere: We could simulate a list with strict elements, i.e. data StrictList a = Elem !a (StrictList a) | End by an unboxed array with a cursor to the next element to be evaluated and a function that generates the next element. Whenever an element with an index beyond the cursor is requested, sufficiently many new elements are written to the array and the cursor is advanced. This would still allow the nice tricks for recursive Fibonacci sequence definition. This will obviously save memory, but can we also expect that it is noticeably faster than (StrictList a) ?

6 18

test driving cabal install... cabal install and normal install (runghc Setup) don't mix... two package.conf files...
by Thomas Hartman 30 May '08

30 May '08

After a little drama with zlib, I managed to get cabal-install installed. I then attempted to do cabal install HAppS-Server since this is a module with a lot of dependencies, and in rapid development flux, so perenially painful for me to install. The result is that I managed to install everything up to HAppS-State, which I think is the last dependency, but then seemed to hang indefinitely in the middle of installing HAppS-Server at the end. OK, I thought, then perhaps I can do normal runghc Setup.hs after downloading and unzipping the tar from http://hackage.haskell.org/cgi-bin/hackage-scripts/package/HAppS-Server-0.9… However, this resulted in error thartman@thartman-laptop:~/haskellInstalls/smallInstalls/HAppS-Server-0.9.2.1>runghc Setup.hs configure ... Setup.hs: At least the following dependencies are missing: HAppS-Data >=0.9.2... Strange, because I had just installed that module via cabal-install, and I could load it in ghci with :m +HappS.Data. I then ran ghc-pkg and got this strange result that my packages were broken into two different files. Is this by design? ghc-pkg list /usr/local/lib/ghc-6.8.2/package.conf: Cabal-1.2.3.0, Cabal-1.3.11, Cabal-1.5.2, DeepArrow-0.2, .... /home/thartman/.ghc/i386-linux-6.8.2/package.conf: HAppS-Data-0.9.2.1, HAppS-IxSet-0.9.2.1, HAppS-State-0.9.2.1, I am curious if anybody else is able to install HAppS-Server using cabal install, and whether they can shed any light on the other isuses I raised. Thomas.

5 8

Re: [Haskell] Announce: hback - dual n-back memory game (0.0.2)
by Don Stewart 30 May '08

30 May '08

wojtowicz.norbert: > I'm pleased to publically announce a little project I've worked on. > Based on a recent research paper [0] that claims fluid intelligence > could be improved by training working memory, I wrote up a dual n-back > test memory game in Haskell and gtk2hs. This is still essentially an > alpha release: all comments are most welcome. > > Original post (includes gameplay instructions): > http://pithyless.com/blog/2008/05/18/hback-haskell-n-back-memory-game/ > > Updated version (overhaul of game with some feature updates): > http://pithyless.com/blog/2008/05/30/hback-0_0_2/ > > Cabal file can be found on hackage: > http://hackage.haskell.org/packages/archive/hback/0.0.2/hback-0.0.2.tar.gz > > [0] http://www.pnas.org/cgi/content/abstract/0801268105v1 Awesome! Is this the first real implementation of the game described in the paper? If so, that's a bit of a coup. Good work by the GTK team that has made these gui things in Haskell so easy. -- Don

1 0

Seen on HCAR: CoreErlang library
by Dimitry Golubovsky 30 May '08

30 May '08

Hi, I have just spotted the item 5.4.3 on the recently issued HCAR: CoreErlang is a Haskell library which consists of a parser and a pretty-printer for the intermediate language used by Erlang. There is no e-mail of the developer (Henrique Ferreiro Garcia) shown on the report, so I am posting this on the mailing list. What is the current status of this Core Erlang library? I might be interested to use some parts of it in the Haskell to Erlang converter that I am currently experimenting with. Please contact me at golubovsky at gmail dot com. Thank you. -- Dimitry Golubovsky Anywhere on the Web

1 0

Copying Arrays
by Tom Harper 30 May '08

30 May '08

I'm trying to implement some file I/O where I can read in a file to an array, but do so without having to know how much space I will need. (Before you suggest it, lists are too slow/space consuming.) I was thinking that one possible solution is to use a strategy used in dynamic arrays, where everytime you run out of space you double the capacity of the array. Trouble is, most arrays in Haskell would require you to traverse the entire array and copy each individual cell, which would make it worthless. Are there any low-level array types (MutableByteArray#, for example) that support a memcpy-like function where I could copy the entire array into the new one instead of copying it one value at a time? Is there another solution that I'm missing? -- Tom Harper MSc Computer Science '08 University of Oxford Mobile: +44 (0)7533 998 591 Skype: +1 949 273 4627 (harpertom)

12 23