- Haskell-Cafe - Haskell.org

Re: [Haskell] IVars
by Conal Elliott 10 Dec '07

10 Dec '07

(moving to haskell-cafe) > readIVar' :: IVar a -> a > readIVar' = unsafePerformIO . readIVar > so, we do not need readIVar'. it could be a nice addition to the libraries, maybe as "unsafeReadIVar" or "unsafeReadMVar". The same argument applies any to pure function, doesn't it? For instance, a non-IO version of succ is unnecessary. My question is why make readIVar a blocking IO action rather than a blocking pure value, considering that it always returns the same value? - Conal On Dec 8, 2007 11:12 AM, Marc A. Ziegert <coeus(a)gmx.de> wrote: > many many answers, many guesses... > let's compare these semantics: > > readIVar :: IVar a -> IO a > readIVar' :: IVar a -> a > readIVar' = unsafePerformIO . readIVar > > so, we do not need readIVar'. it could be a nice addition to the > libraries, maybe as "unsafeReadIVar" or "unsafeReadMVar". > but the other way: > > readIVar v = return $ readIVar' v > > does not work. with this definition, readIVar itself does not block > anymore. it's like hGetContents. > and... > > readIVar v = return $! readIVar' v > > evaluates too much: > it wont work if the stored value evaluates to 1) undefined or 2) _|_. > it may even cause a 3) deadlock: > > do > writeIVar v (readIVar' w) > x<-readIVar v > writeIVar w "cat" > return x :: IO String > > readIVar should only return the 'reference'(internal pointer) to the read > object without evaluating it. in other words: > readIVar should wait to receive but not look into the received "box"; it > may contain a nasty undead werecat of some type. (Schrödinger's Law.) > > - marc > > > > > > Am Freitag, 7. Dezember 2007 schrieb Paul Johnson: > > Conal Elliott wrote: > > > Oh. Simple enough. Thanks. > > > > > > Another question: why the IO in readIVar :: IVar a -> IO a, instead > > > of just readIVar :: IVar a -> a? After all, won't readIVar iv yield > > > the same result (eventually) every time it's called? > > Because it won't necessarily yield the same result the next time you run > > it. This is the same reason the stuff in System.Environment returns > > values in IO. > > > > Paul. > > _______________________________________________ > > Haskell mailing list > > Haskell(a)haskell.org > > http://www.haskell.org/mailman/listinfo/haskell > > > > >

4 6

ANNOUNCE: xmonad 0.5: a tiling window manager
by Don Stewart 10 Dec '07

10 Dec '07

The xmonad dev team is pleased to announce the 0.5 release of xmonad! http://xmonad.org xmonad is a tiling window manager for X. Windows are arranged automatically to tile the screen without gaps or overlap, maximising screen use. Window manager features are accessible from the keyboard: a mouse is optional. xmonad is extensible in Haskell, allowing for powerful customisation. Custom layout algorithms, key bindings and other extensions may be written by the user in config files. Layouts are applied dynamically, and different layouts may be used on each workspace. Xinerama is fully supported, allowing windows to be tiled on several physical screens. Features: * Very stable, fast, small and simple. * Automatic window tiling and management * First class keyboard support: a mouse is unnecessary * Full support for tiling windows on multi-head displays * Full support for floating windows * XRandR support to rotate, add or remove monitors * Per-workspace layout algorithms * Per-screens custom status bars * Easy, powerful customisation and reconfiguration in Haskell * Large extension library * Extensive documentation and support for hacking Get it! More information, screenshots, documentation, tutorials and community resources are available from the xmonad home page: http://xmonad.org The 0.5 release, and its dependencies, are available from hackage.haskell.org, here: http://hackage.haskell.org/cgi-bin/hackage-scripts/package/xmonad **The headlines** xmonad 0.5 is a major new release of xmonad, allowing, for the first time, dynamic extension in Haskell without requiring recompilation. Extension and configuration of xmonad is now faster, simpler, and more flexible. All configuration is done via the ~/.xmonad/xmonad.hs file. Example config files and screenshots are available on the wiki: http://haskell.org/haskellwiki/Xmonad/Config_archive This marks the final break from its dwm origins. As a result, xmonad is now also much easier to package, distribute and extend, as recompilation of xmonad is not required to extend it. New features: * xmonad is now a library, as is the collection of xmonad extensions * xmonad is configured by editing ~/.xmonad/xmonad.hs * simpler layout hooks type and interface * small EDSL for writing window management rules * support for ghc 6.8.x * xmonad now requires Cabal 1.2 or newer * small bug fixes Extensions: xmonad comes with a huge library of extensions (now more than 5 times the size of xmonad), contributed by viewers like you. Extensions enable pretty much arbitrary window manager behaviour to be implemented by users, in Haskell, in the config files. Examples include: * ion-like window tabs * status bar support * X property and hints support * altnerative layout algorithms For more information on using and writing extensions see the webpage. The library of extensions is available from hackage: http://hackage.haskell.org/cgi-bin/hackage-scripts/package/xmonad-contrib Brought to you by the xmonad team: Spencer Janssen Don Stewart Jason Creighton Andrea Rossato David Roundy Brent Yorgey with code contributions from: Brandon Allbery Chris Mears Shachaf Ben-Kiki Eric Mertens Alec Berryman Neil Mitchell Gwern Branwen Devin Mullins Joachim Breitner Daniel Neri Alexandre Buisse Stefan O'Rear Nick Burlett Simon Peyton Jones Peter De Wachter Hans Philipp Annen Aaron Denney Karsten Schoelzel Nelson Elhage Michael Sloan Shae Erisson Ivan Tarasov Joachim Fasting Alex Tarkovsky Michael Fellinger Christian Thiemann David Glasser Joe Thornber Kai Grossjohann Matsuyama Tomohiro Dave Harrison Daniel Wagner Juraj Hercek Ferenc Wagner Sam Hughes Jamie Webb Miikka Koskinen Klaus Weidner David Lazar nornagon Lucas Mai timthelion Robert Marlow Valery V. Vorotyntsev Dougal Stanton Joel Suovaniemi Mats Jansborg Dmitry Kurochkin Clemens Fruhwirth As well as the support of many others on the #xmonad and #haskell IRC channels, and the wider Haskell and window manager communities. Thanks to everyone for their support!

1 0

Parsing integers [was: Re: [Haskell-cafe] help]
by Tim Chevalier 10 Dec '07

10 Dec '07

On 12/9/07, Ryan Bloor <ryanbloor(a)hotmail.com> wrote: > > hi > > I have a function parseInt... which needs an error guard for when the input > is not an Int. > > parseInt :: Parser > parseInt [] = [] > parseInt xs = let (digits, rest) = span isDigit (removeSpace xs) > in [(EInt (read digits), removeSpace rest)] > > Also... I have a function that does this... parseBinaryOp "+" "(5 + 2) if" > gives...[(Int 5, Int 2, "if")] > so, op is '+' or "&&". I am unsure of how to begin... > > parseBinaryOp :: String -> String -> [(Expr, Expr, String)] > parseBinaryOp op str > Check out: http://www.haskell.org/haskellwiki/Homework_help If this isn't homework, try posting again and phrasing your question in the form of a question; saying "I am unsure of how to begin" doesn't help us help you think about the problem. Cheers, Tim -- Tim Chevalier * catamorphism.org * Often in error, never in doubt "[Teaching children to read] will make America what we want it to be, a literate country and a hopefuller country." -- George W. Bush

2 2

Point and link
by Andrew Coppin 09 Dec '07

09 Dec '07

Hi guys. Here's a fairly basic question. I have several ideas for programs that I'd like to write. They all involve placing "units" of some kind, and then drawing "connections" between those units. How feasible is it to program such a thing in Haskell? Where would you start? (Gtk2hs is the only graphics API I'm familiar with using at present.)

8 13

Fwd: Parsing integers [was: Re: [Haskell-cafe] help]
by Tim Chevalier 09 Dec '07

09 Dec '07

[reply forwarded to list] ---------- Forwarded message ---------- From: Ryan Bloor <ryanbloor(a)hotmail.com> hi sorry for vagueness. I am writing a basic Parser from scratch. So far I have functions; # removeSpaces # match - which checks if a string is a substring of another # orParser which combines two parser's abilities # Basic pasrers like... parseInt, parseTrue, parseFalse, parseBool using the orParser on True and False. What I want to do now is have a parseBinaryOp that recognises: parseBinaryOp "+" "(5 + 2) if" >>>gives>> [(EInt 5, EInt 2, "if")] So I think that I have to split the initial string into four parts. "+" becomes op '(' becomes tokenF ')' becomes tokenB "5" becomes e1 "2" becomes e2 parseBinaryOp :: String -> String -> [(Expr, Expr, String)] parseBinaryOp op str = let (tokenF,e1,op,e2,tokenB) = I am not sure how to go about separating the string for how I need it using my other functiuons. Ryan ________________________________ > Date: Sun, 9 Dec 2007 13:07:23 -0800 > From: catamorphism(a)gmail.com > To: ryanbloor(a)hotmail.com > Subject: Parsing integers [was: Re: [Haskell-cafe] help] > CC: haskell-cafe(a)haskell.org > > On 12/9/07, Ryan Bloor <ryanbloor(a)hotmail.com> wrote: > > > > hi > > > > I have a function parseInt... which needs an error guard for when the input > > is not an Int. > > > > parseInt :: Parser > > parseInt [] = [] > > parseInt xs = let (digits, rest) = span isDigit (removeSpace xs) > > in [(EInt (read digits), removeSpace rest)] > > > > Also... I have a function that does this... parseBinaryOp "+" "(5 + 2) if" > > gives...[(Int 5, Int 2, "if")] > > so, op is '+' or "&&". I am unsure of how to begin... > > > > parseBinaryOp :: String -> String -> [(Expr, Expr, String)] > > parseBinaryOp op str > > > > Check out: > http://www.haskell.org/haskellwiki/Homework_help > > If this isn't homework, try posting again and phrasing your question > in the form of a question; saying "I am unsure of how to begin" > doesn't help us help you think about the problem. > > Cheers, > Tim > > -- > Tim Chevalier * catamorphism.org * Often in error, never in doubt > "[Teaching children to read] will make America what we want it to be, > a literate country and a hopefuller country." -- George W. Bush ________________________________ Are you the Quizmaster? Play BrainBattle with a friend now!

1 0

help
by Ryan Bloor 09 Dec '07

09 Dec '07

hi I have a function parseInt... which needs an error guard for when the input is not an Int. parseInt :: ParserparseInt [] = []parseInt xs = let (digits, rest) = span isDigit (removeSpace xs) in [(EInt (read digits), removeSpace rest)] Also... I have a function that does this... parseBinaryOp "+" "(5 + 2) if" gives...[(Int 5, Int 2, "if")]so, op is '+' or "&&". I am unsure of how to begin... parseBinaryOp :: String -> String -> [(Expr, Expr, String)]parseBinaryOp op str Thankyou Ryan _________________________________________________________________ Get free emoticon packs and customisation from Windows Live. http://www.pimpmylive.co.uk

1 0

ARM back end?
by Greg Fitzgerald 09 Dec '07

09 Dec '07

Anybody know of an ARM back end for any of the Haskell compilers? Thanks, Greg

8 7

ST Monad - what's wrong?
by Nicu Ionita 09 Dec '07

09 Dec '07

Hi, I'm trying to use the ST monad in order to turn an almost pure function into a pure one: reading a precalculated list of primes into a prime set. But the following code brings an error: > primes :: Set Integer > primes = runST $ getPrimes "primes10h7.txt" > getPrimes :: String -> (forall s. ST s (Set Integer)) > getPrimes file = > do cont <- unsafeIOToST (readFile file) > let set = fromList $ map read $ lines cont > return set And here is the error: Couldn't match expected type `forall s. ST s a' against inferred type `ST s (Set Integer)' In the second argument of `($)', namely `getPrimes "primes10h7.txt"' In the expression: runST $ (getPrimes "primes10h7.txt") In the definition of `primes': primes = runST $ (getPrimes "primes10h7.txt") Compiled with GHC 6.6.1 with extensions activated. Nicu

4 4

AW: ST Monad - what's wrong?
by Nicu Ionita 09 Dec '07

09 Dec '07

Ok, solved, the use of ($) was the problem. I changed it > primes :: Set Integer > primes = runST (getPrimes "primes10h7.txt") and it compiles (and works too). Nicu > -----Ursprüngliche Nachricht----- > Von: Nicu Ionita [mailto:nionita@lycos.de] > Gesendet: Sonntag, 9. Dezember 2007 12:12 > An: 'haskell-cafe(a)haskell.org' > Betreff: ST Monad - what's wrong? > > > Hi, > > I'm trying to use the ST monad in order to turn an almost > pure function into a pure one: reading a precalculated list > of primes into a prime set. But the following code brings an error: > > > primes :: Set Integer > > primes = runST $ getPrimes "primes10h7.txt" > > > getPrimes :: String -> (forall s. ST s (Set Integer)) > getPrimes file = > > do cont <- unsafeIOToST (readFile file) > > let set = fromList $ map read $ lines cont > > return set > > And here is the error: > > Couldn't match expected type `forall s. ST s a' > against inferred type `ST s (Set Integer)' > In the second argument of `($)', namely > `getPrimes "primes10h7.txt"' > In the expression: runST $ (getPrimes "primes10h7.txt") > In the definition of `primes': > primes = runST $ (getPrimes "primes10h7.txt") > > Compiled with GHC 6.6.1 with extensions activated. > > Nicu >

1 0

Re: [Haskell-cafe] do... error
by Felipe Lessa 09 Dec '07

09 Dec '07

On Dec 9, 2007 1:01 AM, Ryan Bloor <ryanbloor(a)hotmail.com> wrote: > But what is the right way to indent...? It is so annoying, why does it > matter so much! :( You may read http://en.wikibooks.org/wiki/Haskell/Indentation which tries to explain in a very simple language. -- Felipe.

3 3