- Haskell-Cafe - Haskell.org

ANN xmobar-0.9.2
by Andrea Rossato 11 Apr '09

11 Apr '09

Hi, I'm glad to announce xmobar-0.9.2. What's new: - Norbert Zeh tracked and fixed a longstanding bug that made xmobar leak X resources. This alone makes it worth this release and its public announcement, with the advice to users to upgrade.[*] - Norbert also overhauled the template parser to allow nested color definitions; - Norbert, once again, added the possibility to add color definitions in the monitors' templates. Many thanks to Norbert!! I've read that xmobar lists in the top 25 most downloaded Hackage packages. This is very cool: thanks to all the xmobar users. Hope you'll enjoy. Andrea [*] I tend to believe the same issue affects xmonad, even though it should be visible only after a huge number of restarts. Things get far worse when it comes to the xmonad-contrib library, especially if you use fancy decorations in your layouts: if you see colors you are probably leaking them.

1 0

Hac5 is almost upon us!
by Sean Leather 11 Apr '09

11 Apr '09

In six days, tens of crazy/obsessed, type-safe, functional programmers will be converging on Utrecht to commence execution of... ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ The 5th Haskell Hackathon April 17 - 19, 2009 Utrecht, The Netherlands ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ The local organizing team welcomes you all and looks forward to all of the new developments that come out of everyone's undying quest to write more and better code. As always, you can find lots of useful information on the wiki: http://haskell.org/haskellwiki/Hac5 == Sponsors == We have sponsors! The following companies were very gracious to provide us with support during these tough economic times. * Galois - http://galois.com/ * Microsoft Research - http://research.microsoft.com/ * Tupil - http://tupil.com/ The organizers are incredibly grateful to Galois, MSR, and Tupil for helping to encourage and promote more Haskell hacking. == More To Come == Hopefully, you have already registered, booked your room, and bought your ticket. If not, don't forget that you can keep in touch with the attendees via IRC on Freenode: #haskell-hac5 All registered attendees will soon be receiving an email with more details. Let us know if you have any questions. Happy Hacking! == Organizers == Andres Löh, Utrecht University (UU) José Pedro Magalhães, UU Sean Leather, UU Eelco Lempsink, UU + Tupil Chris Eidhof, UU + Tupil ... and more ...

1 0

Re: [Haskell-cafe] Referential Transparency and Monads
by Brandon S. Allbery KF8NH 11 Apr '09

11 Apr '09

On 2009 Apr 9, at 11:47, Mark Spezzano wrote: > How exactly do monads “solve” the problem of referential > transparency? I understand RT to be such that a function can be > replaced with a actual value. > > Since a monad could potentially encapsulate any other value—say, > data read from a keyboard—doesn’t that violate the assumption of RT > on monads? Monads provide a way to carry extra data or operations around with their values. IO passes an opaque "world state" around in the background, conceptually I/O operations modify the "world state" and it is in fact always valid to replace the monadified version with the unwrapped version --- ignoring IORefs, IO is just a simple state monad. The "world state" insures that operations in the IO monad are constrained to an ordered list. This gives us a referentially transparent *model* that behaves the way we need it to; the fact that actual I/O is not referentially transparent doesn't matter because the model insures that computations in IO behave properly. (Unless you use unsafePerformIO or unsafeInterleaveIO, which is why they're unsafe; you've violated the model, unexpected things can happen as a result.) -- brandon s. allbery [solaris,freebsd,perl,pugs,haskell] allbery(a)kf8nh.com system administrator [openafs,heimdal,too many hats] allbery(a)ece.cmu.edu electrical and computer engineering, carnegie mellon university KF8NH

11 28

Re: Referential Transparency and Monads
by Heinrich Apfelmus 10 Apr '09

10 Apr '09

Mark Spezzano wrote: > How exactly do monads “solve” the problem of referential transparency? I > understand RT to be such that a function can be replaced with a actual > value. > > Since a monad could potentially encapsulate any other value—say, data read > from a keyboard—doesn’t that violate the assumption of RT on monads? > > Or does RT ignore the encapsulated data and just view the “action” performed > by the monad as the “value” of the monad? The term "referential transparency" refers to functions and means that "equal arguments give equal results". For instance, there cannot be a function getChar :: () -> Char that reads input from the keyboard because referential transparency demands that the character returned must always be the same. Similarly, a function putChar :: Char -> () that prints a character on the screen cannot exist because we could replace every say putChar 'a' with () which does not output anything. Both values are equal, after all. However, functions getChar :: () -> IO Char putChar :: Char -> IO () are entirely feasible; the side effect has been pushed into the IO type constructor. In other words, getChar () :: IO Char is always the same IO action (reading a character from the keyboard) and putChar 'c' :: IO () is always the same IO action (printing 'c' on the screen). In other words, we have decomposed "function with side effect" = "pure function" + "side effect" -> + IO Regards, apfelmus -- http://apfelmus.nfshost.com

1 0

Trying to write 'safeFromInteger'
by Kannan Goundan 10 Apr '09

10 Apr '09

Here's my code (in file "Test.hs") safeFromInteger :: (Num a, Integral a, Bounded a) => Integer -> Maybe a safeFromInteger i = if i > (toInteger maxBound) then Nothing else Just (fromInteger i) Here's the error from GHCi 6.10.1: Test.hs:3:19: Ambiguous type variable `a' in the constraints: `Bounded a' arising from a use of `maxBound' at Test.hs:3:19-26 `Integral a' arising from a use of `toInteger' at Test.hs:3:9-26 Probable fix: add a type signature that fixes these type variable(s) It's almost like GHC thinks that the type variable "a" can't be part of the "Bounded" lass and the "Integeral" class. I plan to use "safeFromInteger" for converting from Word8, Word16, Word32, etc.

14 19

compilation related questions
by minh thu 10 Apr '09

10 Apr '09

Hi, There was a 'I want to write a compiler' thread recently. I wonder if there is such kind of pointers for compilation of strict functional languages (perhaps with lazy evaluation annotations) . Although GRIN is designed for lazy languages, would it be ok to use it for a strict one (and leverage its thunk representation for the lazy part of the language)? The 'whole program' optimization aspect is a plus. On a related note, I have another question. Say we have some data structure, for instance a list, some functions on this data structure (probably defined with some well known functions, such as map or fold), and a program using them. Is there any research trying to rewrite the program, and the data structure, to optimize them ? A contrived example is the length of a list : instead of traversing a list to know its length, the list can have an additional field which is incremented at each cons. Thanks, Thu

4 5

Ann: Yogurt-0.4
by Martijn van Steenbergen 10 Apr '09

10 Apr '09

Bonsoir café, It is my pleasure to announce version 0.4 of Yogurt, a functional MUD client. Version 0.4 makes Yogurt available as a standalone executable that is able to dynamically load and reload Yogurt scripts. Here is a small example of such a script: > module Minimal where > > import Network.Yogurt > > newmoon :: Session > newmoon = session > { hostName = "eclipse.cs.pdx.edu" > , portNumber = 7680 > , mudProgram = \reload -> do > mkCommand "reload" reload > } Valid scripts define at least one session which is used to connect to the MUD. mudProgram fields are provided with a reload action that when invoked reloads the script without interrupting the MUD connection. Of course, Yogurt also still offers hooks, timers, logging, variables and more. The executable is released as a separate package so that developers wishing to use just the "pure" machinery can do that without inheriting dependencies on the GHC API or readline library. To install the executable, run: $ cabal update $ cabal install Yogurt -freadline $ cabal install Yogurt-Standalone Yogurt's new home page can be found at: http://code.google.com/p/yogurt-mud/ And on hackage: http://hackage.haskell.org/cgi-bin/hackage-scripts/package/Yogurt http://hackage.haskell.org/cgi-bin/hackage-scripts/package/Yogurt-Standalone I would love to hear your feedback! Suggestions, complaints, comments, bug reports, experiences et cetera are all welcome. Kind regards, Martijn.

1 0

[Haskell-cafe] Paper: Translating donotation to SQL, Leijden, Meijer
by Günther Schmidt 10 Apr '09

10 Apr '09

Hi all, is the paper "Translating donotation to SQL, Leijden, Meijer (1999)" available anywhere? Günther

3 3

Re: [Haskell-cafe] Sequence differences
by michael rice 10 Apr '09

10 Apr '09

Clearly, I have some reading to do. Thanks, Michael --- On Fri, 4/10/09, Ketil Malde <ketil(a)malde.org> wrote: From: Ketil Malde <ketil(a)malde.org> Subject: Re: [Haskell-cafe] Sequence differences To: "michael rice" <nowgate(a)yahoo.com> Cc: "haskell Cafe mailing list" <haskell-cafe(a)haskell.org>, "Joe Fredette" <jfredett(a)gmail.com> Date: Friday, April 10, 2009, 3:52 PM michael rice <nowgate(a)yahoo.com> writes: > map :: (a -> b) -> [a] -> [b] <== I'm assuming this is correct This is the type of 'map', yes. Btw, ou can check types in GHCi with the :i command. > s f ls > > seems much like > > map f ls > > but instead looks like > > s :: (a -> a -> a) -> [a] -> [a] If you look at the definition: >> s f [] = [] >> s f [x] = [x] >> s f l = [ a f b | (a,b) <- zip (init l) (tail l)] You'll notice that the second clause, namely s f [x] = [x] produces the second parameter [x] (of type [a]) as its output, and thus the types must be the same as well. Also (assuming it is 'f a b' and not 'a f b' in the list comprehension), f is applied to two parameters, so it'll have to be of type (x -> y -> z), and since the two input parameters come from the originating list, x and y must be the same as a, and since we have seen the result list also has the same type, z must be the same as a, too. Thus f must have type (a -> a -> a). Unclear? Clear? Operating thetan? -k -- If I haven't seen further, it is by standing in the footprints of giants

1 0

Re: [Haskell-cafe] Re: Sequence differences
by michael rice 10 Apr '09

10 Apr '09

Yes, that is nice, and also useful for calculating moving averages. Thanks. Michael --- On Fri, 4/10/09, Chad Scherrer <chad.scherrer(a)pnl.gov> wrote: From: Chad Scherrer <chad.scherrer(a)pnl.gov> Subject: [Haskell-cafe] Re: Sequence differences To: haskell-cafe(a)haskell.org Date: Friday, April 10, 2009, 12:04 PM Joe Fredette <jfredett <at> gmail.com> writes: > We can write your original function in another, cleaner way though, too, > since zip will "zip" to the smaller of the two lengths, so you don't > need to worry about doing the init and the tail, so `s` is really: > > s _ [] = [] > s _ [x] = [x] > s f ls = [f a b | (a,b) <- zip ls (tail ls)] > > but there is a function which does precisely what the third case does, > called "zipWith" which takes a > binary function and two lists and -- well -- does what that list > comprehension does. In fact, it does > what your whole function does... In fact, it _is_ your function, > specialized a little, eg: > > yourZipWith f ls = zipWith f ls (tail ls) A nice generalization of this that can be really useful is movingWindow :: Int -> [a] -> [[a]] movingWindow 1 xs = map (:[]) xs movingWindow n xs = zipWith (:) xs . tail $ movingWindow (n-1) xs So for example, > movingWindow 3 [1..10] [[1,2,3],[2,3,4],[3,4,5],[4,5,6],[5,6,7],[6,7,8],[7,8,9],[8,9,10]] Then you can write diff :: (Num a) => [a] -> [a] diff = map (\[x,y] -> y - x) . movingWindow 2 Hopefully the intermediate lists are optimized away, but I haven't done any performance testing. Chad _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe(a)haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

1 0