- Haskell-Cafe - Haskell.org

Re: [Haskell-cafe] RE: [Announce] primes
by michael rice 17 Apr '09

17 Apr '09

Oh, I just remembered, I'm using ghci. I'll bet that's why I'm so slow. Thanks. Michael --- On Thu, 4/16/09, Andrew Coppin <andrewcoppin(a)btinternet.com> wrote: From: Andrew Coppin <andrewcoppin(a)btinternet.com> Subject: Re: [Haskell-cafe] RE: [Announce] primes To: haskell-cafe(a)haskell.org Date: Thursday, April 16, 2009, 4:38 PM Jake McArthur wrote: > michael rice wrote: >> Just curious, what kind of super-cooled processor is this guy running on? I got the same answer but it took almost three minutes (2:43:15). > > Only took a few seconds on my machine (Core 2 Duo 2.53GHz). Maybe it's the version of GHC that matters? _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe(a)haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

2 1

"O LANGUAGE DESIGNER, REMEMBER THE POOR USER""
by Matt Morrow 17 Apr '09

17 Apr '09

This is interesting (and from 1990): http://groups.google.co.uk/group/comp.lang.functional/msg/655bb7bbd0fd8586 (Not sure if this is well-known. It seems like it either is, or it should be. Either way, I just stumbled across it.)

2 2

REMINDER: Haskell Communities and Activities Report
by Janis Voigtlaender 17 Apr '09

17 Apr '09

Dear Haskellers, The deadline for the May 2009 edition of the Haskell Communities and Activities Report is only two weeks away. If you haven't already, please write an entry for your new project, or update your old entry. Please mail your entries to hcar(a)haskell.org in LaTeX format. More information can be found in the original Call for Contributions at: http://www.haskell.org/pipermail/haskell/2009-April/021180.html I look forward to receiving your contributions. Thanks a lot, Janis (current editor) -- Dr. Janis Voigtlaender http://wwwtcs.inf.tu-dresden.de/~voigt/ mailto:voigt@tcs.inf.tu-dresden.de

1 0

Best text editor
by Melanie_Green 17 Apr '09

17 Apr '09

Hi I would like to follow the crowd and find out what text editor everyone uses for haskell on windows. Thx in advanced -- View this message in context: http://www.nabble.com/Best-text-editor-tp23018470p23018470.html Sent from the Haskell - Haskell-Cafe mailing list archive at Nabble.com.

24 29

Re: wxHaskell not in scope (Source available)
by Tsunkiet Man 16 Apr '09

16 Apr '09

Note: the source can be found here: http://www.students.cs.uu.nl/~jtkman/Application.hs (It's my own work, please tell me what I did wrong) 2009/4/16 Tsunkiet Man <temp.tsun(a)gmail.com> > Hello, > > I'm trying to create a GUI by using wxHaskell. However I get the weird > error message of "Not in scope "dt"", well so I sorted them so that my so > called "dt" was in scope, however it failed. Can someone please tell me how > I can solve this error? > > ... A lot of code that is not relevant in my opinion, if I'm > wrong please correct me and I will post my full code > > --Debug text -- > dt <- staticText f [text := "Hello world!"] > > imagePanel <- panel f [position := Point 2 2, clientSize := > Size 100 100, tooltip := "This is a drawPanel", bgcolor := rgb 255 255 255] > set f [ clientSize := Size 700 500, > menuBar := [mFile, mHelp], > visible := True, > on (menu exit) := close f, > on (menu open) := onOpen f vFile ] > > > return () > > where > onOpen :: Frame a -> Var b -> IO () > onOpen frame var = do file <- fileOpenDialog frame False > True "Open File" [("PGM bestanden (*.pgm)",["*.pgm"]),("Alle bestanden > (*.*)",["*.*"])] "" "" > case file of > Nothing -> return () > Just file -> set dt [text := > "HELLO"] > return () > > Thank you for your help, I really owe haskell-cafe. > > Greetings Tsunkiet Man >

1 0

Re: [Haskell-cafe] RE: [Announce] primes
by michael rice 16 Apr '09

16 Apr '09

Just curious, what kind of super-cooled processor is this guy running on? I got the same answer but it took almost three minutes (2:43:15). Michael --- On Thu, 4/16/09, Geoffrey Irving <irving(a)naml.us> wrote: From: Geoffrey Irving <irving(a)naml.us> Subject: Re: [Haskell-cafe] RE: [Announce] primes To: "Daniel Fischer" <daniel.is.fischer(a)web.de> Cc: haskell-cafe(a)haskell.org Date: Thursday, April 16, 2009, 12:57 PM >> > The implementation is reasonably efficient. The query >> > >> > > primes !! 1000000 >> > >> > 15485867 >> > >> > answers after a few seconds. >> >

3 3

How the following works
by Tsunkiet Man 16 Apr '09

16 Apr '09

Hello, I can hardly imagine how the following code works: cinits :: [a] -> [[a]] cinits [] = [[]] cinits (x:xs) = [] : map (x:) (cinits xs) can someone give me a good explaination? (I understand it a bit, but it's really hard for me to figure out how a map in a map function works.) Thank you for your time, Tsunkiet

4 8

google-like "do you mean?" feature
by Michael Mossey 16 Apr '09

16 Apr '09

I'm thinking of writing a parser to load files that my customers have created. I'm a software requirements engineer; the data consists of the customers' thoughts in response to the latest release of the requirements doc. In fact, the files will probably be copies of the requirements doc itself, into which customers have entered their notes and made changes. The original requirements doc will have a format that can be parsed; probably something simple like lines marked with codes like //customer={customer name goes here} //requirement= {requirement text goes here} When I parse the documents that come back from the customers, they are likely to contain some errors. Field names may be mangled or misspelled. Customer names may be entered in unrecognizable variants (e.g. someone named "Michael" is indicated as "Mike") and so forth. I was thinking that it might be useful to have a Google-like "do you mean this?" feature. If the field name is //customer=, then the parser might recognize a huge list of variants like //ustomer=, //customor=, etc... that is, recognize them well enough to continue parsing and give a decent error message in context. Any ideas how to go about this? I don't think I would create a parser language that includes every variant, but instead the field names would be tokens that could be passed to another routine. The variants could be generated ahead of time. I would limit the number of variants to something manageable, like 10,000 for each field name. Thanks, Mike

5 5

Re: [Haskell-cafe] Issues with running Ghci from emacs
by Patai Gergely 16 Apr '09

16 Apr '09

> I end up doing > > :set -i../Documents/haskell/SOE/src > > To set the search directory so that ghci can find the source. > > I've not been how to tailor that 'cd' which is run at start > up (but I've not looked to hard) It is looking for the closest ancestor directory with a file ending in .cabal, and that's where cd goes. Probably the simplest way to trick it without chaniging any setting is to create an empty dummy.cabal in the directory of your program. Gergely -- http://www.fastmail.fm - Send your email first class

3 2

[Announce] primes
by Sebastian Fischer 16 Apr '09

16 Apr '09

I am pleased to announce the package 'primes' that implements lazy wheel sieves for efficient, purely functional generation of prime numbers in Haskell. Following the current discussion about primes in Haskell, I packaged up an implementation inspired by the papers "Lazy wheel sieves and spirals of primes" by Colin Runciman and "The Genuine Sieve of Eratosthenes" by Melissa O'Neil. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/primes The package does not implement all that was wished for in the mentioned discussion. It only exports two operations: The global constant primes :: [Integer] is an infinite list of primes and wheelSieve :: Int -> [Integer] is the function used to build this list. If you are worried about the memory requirements of using a global constant, you can use `wheelSieve 6` instead of `primes`. The implementation is reasonably efficient. The query > primes !! 1000000 15485867 answers after a few seconds. Feel free to contribute more functionality to this package. The sources are on Github: http://github.com/sebfisch/primes If you fork my project, I'll be happy to merge your changes. Cheers, Sebastian

1 0