- Haskell-Cafe - Haskell.org

Can type be changed along a >>= chain?
by michael rice 12 Oct '09

12 Oct '09

The first of these works, but not the second. It would seem that the type cannot change along a >>= chain, but I may be missing something in the code. Is the second example illegal? If so, is there a different way to change a String to an Int along the >>= chain? Michael =========== import Data.Char {- transform :: IO () transform = putStrLn "What is your word?" >> getLine >>= \str -> return ('Q':str) >>= \str -> return ('Z':str) >>= \str -> putStrLn $ "Transformed word is " ++ show str -} transform :: IO () transform = putStrLn "What is your digit string?" >> getLine >>= \str -> return ('9':str) >>= \str -> return (read str :: Int) >>= \i -> putStrLn $ "The number is " ++ show i

4 6

statistics package and randomness
by Michael Mossey 12 Oct '09

12 Oct '09

I'm trying to learn how to use randomness in Haskell and it seems very non-straightforward and complex. I could do a lot of things using 'split' from System.Random, but apparently it's broken. There is the statistics package here: http://hackage.haskell.org/package/statistics Is this a better solution? It uses the ST monad in the RandomVariate module. Can someone point me to a tutorial explaining ST, and/or a tutorial in the RandomVariate module? Pseudorandomness seems like one case where it would just be a hell of a lot simpler to have a global generator--never split the state. Is the ST monad some way to accomplish this? Thanks, Mike

3 3

"safe" way to use Rand?
by Michael Mossey 12 Oct '09

12 Oct '09

I'm looking at Control.Monad.Random which provides the Rand monad. I would like to know how to use this for generating multiple infinite series, while trusting that the implementation never uses "split" behind the scenes. (Note: I'm on Windows XP, and there appears to be a bug in getStdGen. It does NOT return an arbitrary generator, but rather the same one every time I run the program. However, newStdGen DOES return an arbitrary generator. So I'm using that, even though I know it accesses split behind the scenes. My thinking is that this only happens once so it is okay.) For example, is this code split-free? simple :: Rand StdGen [Int] simple = getRandomRs (0::Int, 10) main1 = do gen <- newStdGen let answer = (flip evalRand) gen $ do xs <- simple ys <- simple return $ (take 5 xs) ++ (take 3 ys) print answer Then, to elaborate on my specific problem, I need to create special types of infinite series. For example, I might need to create one that looks like this: 0 0 5 0 0 0 2 0 0 0 0 0 5 0 9 0 0 8 ... The pattern here is that there is some random number of zeros followed by a single non-zero value, followed again by a random number of zeros, etc. forever. This is one way to implement this. Does all look well here? makeSeries :: [Int] -> [a] -> a -> [a] makeSeries (i:is) (f:fs) zero = replicate i zero ++ [f] ++ makeSeries is fs zero lessSimple :: Rand StdGen [Int] lessSimple = do counts <- getRandomRs (1::Int , 5 ) values <- getRandomRs (1::Int , 9 ) return $ makeSeries counts values 0 main2 = do gen <- newStdGen let answer = evalRand lessSimple gen print . take 20 $ answer We could even have several of these series zipped together. Is this split-free? main3 = do gen <- newStdGen let fs = (flip evalRand) gen $ do s1 <- lessSimple s2 <- lessSimple return $ zip s1 s2 print . take 20 $ fs

1 0

SDL build problem
by Henk-Jan van Tuyl 11 Oct '09

11 Oct '09

L.S., I am trying to install SDL, but I get error messages about multiple definition of `main'; before I spend many hours of debugging, does anybody know why this happens? See the log below. Regards, Henk-Jan van Tuyl C:\Programs\Haskell\Libs\SDL-0.5.5>runhaskell Setup configure --extra-include-dirs=C:\Programs\MSYS\1.0\include\SDL Setup.lhs:2:2: Warning: In the use of `defaultUserHooks' (imported from Distribution.Simple): Deprecated: "Use simpleUserHooks or autoconfUserHooks, unless you need Cabal-1.2 compatibility in which case you must stick with defaultUserHooks" Warning: defaultUserHooks in Setup script is deprecated. Configuring SDL-0.5.5... checking for sdl-config... /usr/bin/sdl-config configure: creating ./config.status config.status: creating config.mk config.status: creating SDL.buildinfo config.status: creating includes/HsSDLConfig.h config.status: includes/HsSDLConfig.h is unchanged C:\Programs\Haskell\Libs\SDL-0.5.5>runhaskell Setup build Setup.lhs:2:2: Warning: In the use of `defaultUserHooks' (imported from Distribution.Simple): Deprecated: "Use simpleUserHooks or autoconfUserHooks, unless you need Cabal-1.2 compatibility in which case you must stick with defaultUserHooks" Preprocessing library SDL-0.5.5... dist\build\Graphics\UI\SDL\General_hsc_make.o:General_hsc_make.c:(.text+0x0): multiple definition of `main' C:\Programs\ghc\ghc-6.10.4/gcc-lib/libmingw32.a(main.o):main.c:(.text+0x0): first defined here C:/Programs/MinGW/lib/libSDLmain.a(SDL_win32_main.o): In function `console_main': /Users/hercules/trunk/SDL-1.2/./src/main/win32/SDL_win32_main.c:246: undefined reference to `SDL_main' collect2: ld returned 1 exit status linking dist\build\Graphics\UI\SDL\General_hsc_make.o failed command was: C:\Programs\ghc\ghc-6.10.4\gcc.exe -BC:\Programs\ghc\ghc-6.10.4\gcc-lib -IC:\Programs\ghc\ghc-6.10.4\include\mingw -lSDL -L/usr/lib -lmingw32 -lSDLmain -lSDL -mwindows -LC:\Programs\ghc\ghc-6.10.4\base-4.1.0.0 -lwsock32 -luser32 -lshell32 -LC:\Programs\ghc\ghc-6.10.4\integer-0.1.0.1 -LC :\Programs\ghc\ghc-6.10.4\ghc-prim-0.1.0.0 -LC:\Programs\ghc\ghc-6.10.4 -LC:\Programs\ghc\ghc-6.10.4/gcc-lib -lm -lffi -lgmp -lwsock32 dist\build\Graphics\UI\SDL\General_hsc_make.o -o dist\build\Graphics\UI\SDL\General_hsc_make.exe --

1 0

The Monad.Reader (14) - Call for copy
by Brent Yorgey 11 Oct '09

11 Oct '09

Call for Copy: The Monad.Reader - Issue 14 ------------------------------------------ Whether you're an established academic or have only just started learning Haskell, if you have something to say, please consider writing an article for The Monad.Reader! The submission deadline for Issue 14 will be: **Friday, January 8, 2010** The Monad.Reader ~~~~~~~~~~~~~~~~ The Monad.Reader is a electronic magazine about all things Haskell. It is less formal than journal, but somehow more enduring than a wiki-page. There have been a wide variety of articles: exciting code fragments, intriguing puzzles, book reviews, tutorials, and even half-baked research ideas. Submission Details ~~~~~~~~~~~~~~~~~~ Get in touch with me if you intend to submit something -- the sooner you let me know what you're up to, the better. Please submit articles for the next issue to me by e-mail (byorgey at cis.upenn.edu) Articles should be written according to the guidelines available from http://themonadreader.wordpress.com/contributing/ Please submit your article in PDF, together with any source files you used. The sources will be released together with the magazine under a BSD license. If you would like to submit an article, but have trouble with LaTeX please let me know and we'll sort something out.

1 1

ANN: text 0.5, a major revision of the Unicode text library
by Bryan O'Sullivan 11 Oct '09

11 Oct '09

Get it while it's fresh on Hackage, folks! Details of the changes here: http://bit.ly/1u4UOT

5 9

How do I get this done in constant mem?
by mf-hcafe-15c311f0c＠etc-network.de 11 Oct '09

11 Oct '09

Hi all, I think there is something about my use of the IO monad that bites me, but I am bored of staring at the code, so here you g. The code goes through a list of records and collects the maximum in each record position. -- test.hs import Random import System.Environment (getArgs) import System.IO (putStr) samples :: Int -> Int -> IO [[Double]] samples i j = sequence . replicate i . sequence . replicate j $ randomRIO (0, 1000 ** 3) maxima :: [[Double]] -> [Double] maxima samples@(_:_) = foldr (\ x y -> map (uncurry max) $ zip x y) (head samples) (tail samples) main = do args <- getArgs x <- samples (read (head args)) 5 putStr . (++ "\n") . show $ maxima x I would expect this to take constant memory (foldr as well as foldl), but this is what happens: $ ghc -prof --make -O9 -o test test.hs [1 of 1] Compiling Main ( test.hs, test.o ) Linking test ... $ ./test 100 +RTS -p [9.881155955344708e8,9.910336352165401e8,9.71000686630374e8,9.968532576451201e8,9.996200333115692e8] $ grep 'total alloc' test.prof total alloc = 744,180 bytes (excludes profiling overheads) $ ./test 10000 +RTS -p [9.996199711457872e8,9.998928358545277e8,9.99960283632381e8,9.999707142123885e8,9.998952151508758e8] $ grep 'total alloc' test.prof total alloc = 64,777,692 bytes (excludes profiling overheads) $ ./test 1000000 +RTS -p Stack space overflow: current size 8388608 bytes. Use `+RTS -Ksize' to increase it. $ so... does sequence somehow force the entire list of monads into evaluation before the head of the result list can be used? what can i do to implement this in constant memory? thanks! matthias

5 9

Snow Leopard, gtk2hs
by Arne Dehli Halvorsen 11 Oct '09

11 Oct '09

This may be a little off-topic, but if someone could help me, I'd be grateful.I am trying to get to a working gtk2hs environment in MacOSX Snow Leopard I have a Macbook Pro 2.1 with Snow Leopard. While I had Leopard, I had the Haskell Platform installed, and it worked fine. I also had the MacPorts edition of gtk, and compiled gtk2hs by hand. After I got Snow Leopard, I installed the Haskell Platform. I have made the necessary changes to make it compile (flags to ghc), and it compiles normal programs. I installed the standalone version of the GTK+ platform, and then tried to compile gtk2hs from /gtk2hs . ./configure works, but make results in this: adhmac:gtk2hs arne$ make make all-am rm -rf gtk/Graphics/UI/Gtk/Types.o gtk/Graphics/UI/Gtk/Types_split/; mkdir -p gtk/Graphics/UI/Gtk/Types_split /usr/bin/ghc +RTS -RTS -split-objs -c gtk/Graphics/UI/Gtk/Types.hs -o gtk/Graphics/UI/Gtk/Types.o -O -XForeignFunctionInterface -fglasgow-exts -igtk -package-conf package.conf.inplace -hide-all-packages -ignore-package gtk -package base-4.1.0.0 -package mtl-1.1.0.2 -package containers-0.2.0.1 -package array-0.2.0.0 -package glib-0.10.1 -package cairo-0.10.1 -package-name gtk-0.10.1 '-#include<gtk/hsgtk.h>' -I/Library/Frameworks/GLib.framework/Headers -I/Library/Frameworks/Cairo.framework/Headers -I/Library/Frameworks/Gtk.framework/Headers -I. /var/folders/G8/G8LY9MSBEGuyatB+JjSWq++++TI/-Tmp-/ghc4162_0/ghc4162_0.split__2870.s:35:0: invalid character '_' in mnemonic /var/folders/G8/G8LY9MSBEGuyatB+JjSWq++++TI/-Tmp-/ghc4162_0/ghc4162_0.split__2870.s:953:0: FATAL:Symbol L_gtk_misc_get_type$stub already defined. make[1]: *** [gtk/Graphics/UI/Gtk/Types.o] Error 1 make: *** [all] Error 2 I also have gtk installed via macports recently, but I am not sure whether this makes a difference. I don't think there is any point currently in trying to go MacPorts all the way, and install ghc+gtk2hs via MacPorts. Does anyone have a recipe for getting ghc + gtk2hs + gtk working on MacOSX Snow Leopard? Best regards, Arne D Halvorsen

4 7

how to determine the dependency versions before packaging and submitting to hackage
by Andrew U. Frank 11 Oct '09

11 Oct '09

i plan to submit a package to hackage. i run it on my machine with a cabal file which has for all dependencies "any" (except for base, where it says >=4.0 -- see previous discussion on haskell-cafe). i am not certain, if my code runs agains any version, but i fear it is too restrictive to say >= "current version", which could exclude too much? testing against all previous versions of the packages seems complicated and very time consuming. what is the advice in this case? thank you andrew

3 2

STM in .NET
by Andrew Coppin 10 Oct '09

10 Oct '09

Apparently they like what they see, and they want it to: http://kskky.info/wiki/STM.NETInFramework4 (I notice that it relies on the user manually annotating anything that isn't safe to revert... This makes me nervous.)

2 2