- Haskell-Cafe - Haskell.org

turning an imperative loop to Haskell
by Axel Gerstenberger 10 Sep '07

10 Sep '07

Hi all, I am completely stuck with a problem involving a loop construct from imperative programming, that I want to translate to Haskell code. The problem goes as follows: Based on a value u_n, I can calculate a new value u_{n+1} with a function f(u). u_n was calculated from u_{n-1} and so on down to some initial value u_0. So far it looks like a standard recursion to me. The main goal is to write each result u_{n+1} to a file or screen. The problem arises (for me), when u is an array of doubles or a complex data object instead of a simple Double/Integer value, so that I can store only maybe the last or the two last steps in memory. I never need older values. In C, I would write a for loop, calculate the new u and write it to the file. Then I update the old values to the new ones and do the next step in the for loop. Here is what I did in Haskell: I create an infinite list and tried to print the n-th value to the screen/file. But it always calculates all values in the list "all_results", before it starts printing values to screen. On the other side, the function f is called exactly 50 times as the loop suggests. The result is correct, however, it would prohibitive much memory for more complex data and more steps. Can anyone help in explaining me, how I can print to screen and still keep only the last needed values in memory? I can only find imperative solutions, but maybe it is an imperative problem anyway.? Thanks for your time. Best Axel My approach: module Main where import System.IO import Text.Printf main :: IO () main = do let all_results1 = take 20000 $ step [1] --print $ length all_results1 -- BTW: if not commented out, -- all values of all_results -- are already -- calculated here loop [1..50] $ \i -> do let x = all_results1!!i putStrLn $ show i ++ " " ++ show x -- create an infinite list with values u_{n+1} ++ [u_n,u_{n-1},...,u_1] -- where u_{n+1} = f (u_n) step history = case history of [] -> error "no start values" xs -> xs ++ (step [ f (head $ reverse (xs) )]) f u = u + 1 + (sqrt u) -- some arbitrary complex function -- copied from some blog, not sure if this is a good way loop ns stuff = mapM_ stuff ns

12 17

Where would I find fromInt?
by PR Stanley 10 Sep '07

10 Sep '07

Hi Where would I find the fromInt function, please? Better still, would anyone know how to write a func for converting int to float and vice versa? Thanks, Paul

3 2

simple parsing (parsec) intro
by Tim Newsham 10 Sep '07

10 Sep '07

I wrote a small intro about how to write a parser in haskell. Its basically about parsec and how it works, but its written without directly referencing parsec and aimed towards beginners (basically wrote it for some friends). Any feedback is appreciated. http://www.thenewsh.com/%7Enewsham/formal/parse/parser.lhs Tim Newsham http://www.thenewsh.com/~newsham/

2 1

Second Request for code review - Knuth Morris Pratt for Data.Sequence
by Justin Bailey 10 Sep '07

10 Sep '07

Using the code developed for ByteStrings by myself, Christ Kuklewicz and Daniel Fischer, I've implemented Knuth-Morris-Pratt substring searching on Data.Sequence "Seq" values. Attached you'll find the library in kmp.zip.safe. The algorithm is implemented in the module Data.Sequence.KMP. At the root, SpeedTest.hs can be compiled on Windows with the "prof_compile.bat" file included (you'll need to install the "regex-dfa" and "regex-base" packages from Hackage to build). SpeedTest searches for a known value in the 7 MB file "endo.dna" (which can be downloaded from http://www.icfpcontest.org/endo.zip) using several different algorithms and methods: strict and lazy bytestrings, regular expressions, and the KMP algorithm for "Seq" values. SpeedTest is pretty fast but I worry about its space usage. It may just be the nature of Seq values, but I cannot get it to run in constant space when I think it should be. I'm especially interested in help here. All comments and feedback are welcome. Since the zip file includes a darcs context file, feel free to send patches. Justin

1 0

WinHugs shortcut keys
by Peter Verswyvelen 10 Sep '07

10 Sep '07

Winhugs seems to have some shortcut keys, like F5 for run. It does not seem to have shortcut keys for reload, edit, etc... These would be really handy. It is possible to customize the shortcuts assigned to the commands? If not, can it be build from source? Thanks, Peter

2 3

Installation of GLUT package
by Ronald Guida 10 Sep '07

10 Sep '07

About a month ago, I asked about how to install freeglut and get GHC to recognize it. I was side-tracked; I finally decided to try to get it working, and I'm just stuck. I have GHC 6.6.1 and freeglut 2.4.0. Freeglut successfully compiled "out of the box" in MS Visual Studio.Net 2003 on my Windows XP box. GHC won't recognize freeglut; I found out that I need to recompile the GLUT package to get things working. Today I downloaded the GLUT package from hackage.haskell.org and attempted to install it. The installation blows up. According to Cabal/How_to_install_a_Cabal_package, I need to download the package, unzip it, and then run the following three commands. 1. runghc Setup.hs configure 2. runghc Setup.hs build 3. runghc Setup.hs install The first command, "runghc Setup.hs configure", fails, reporting that it can't find "sh". Naturally, I'm on a Windows box, so I don't have the Unix shell on my system. So now I'm stuck... * Is there an easy way to work around the absence of "sh"? * Is there an easy way to get "sh" on my Windows box? * <joke> GHC was available pre-compiled for Windows. Is there an easy way to get someone else to compile the GLUT package for me? :-) </joke> * Is it feasible to walk past a cut and "upgrade" to Linux? Most Windows programs can be replaced by open-source equivalents, but my sticky issue is that there's no Linux version of iTunes. -- Ron PS, Here's the output of configure. Do I really need all this stuff just for the GLUT package? C:\GLUT\GLUT-2.0>runghc Setup.hs configure Configuring GLUT-2.0... configure: Dependency base-any: using base-2.1.1 configure: Dependency OpenGL-any: using OpenGL-2.2.1 configure: Using install prefix: C:\Program Files configure: Binaries installed in: C:\Program Files\Haskell\bin configure: Libraries installed in: C:\Program Files\Haskell\GLUT-2.0\ghc-6.6.1 configure: Private binaries installed in: C:\Program Files\GLUT-2.0 configure: Data files installed in: C:\Program Files\Common Files\GLUT-2.0 configure: Using compiler: C:\ghc\ghc-6.6.1\bin\ghc.exe configure: Compiler flavor: GHC configure: Compiler version: 6.6.1 configure: Using package tool: C:\ghc\ghc-6.6.1\bin\ghc-pkg.exe configure: Using ar found on system at: C:\ghc\ghc-6.6.1\bin\ar.exe configure: No haddock found configure: No pfesetup found configure: No ranlib found configure: Using runghc found on system at: C:\ghc\ghc-6.6.1\bin\runghc.exe configure: No runhugs found configure: No happy found configure: No alex found configure: Using hsc2hs: C:\ghc\ghc-6.6.1\bin\hsc2hs.exe configure: No c2hs found configure: No cpphs found configure: No greencard found Setup.hs: Cannot find: sh

5 12

ANN: The Monad.Reader - Issue 8
by Wouter Swierstra 10 Sep '07

10 Sep '07

I am pleased to announce that the latest issue of The Monad.Reader is now available: http://www.haskell.org/haskellwiki/The_Monad.Reader Issue 8 consists of the following two articles: * Brent Yorgey Generating Multiset Partitions * Conrad Parker Type-Level Instant Insanity The Monad.Reader is a quarterly magazine about functional programming. It is less-formal than journal, but somehow more enduring than a wiki page or blog post. If you'd like to submit something to the next issue of The Monad.Reader, please get in touch. I haven't fixed the deadline for the next issue just yet; I hope to send out an official call for copy in the coming weeks. I'd also like to point out that you can now order TMR apparel from: http://www.cafepress.com/TheMonadReader. Enjoy! Wouter This message has been checked for viruses but the contents of an attachment may still contain software viruses, which could damage your computer system: you are advised to perform your own checks. Email communications with the University of Nottingham may be monitored as permitted by UK legislation.

1 0

Re: [Haskell-cafe] Tiny documentation request
by manu 10 Sep '07

10 Sep '07

Neil Mitchell wrotes : > Replicating actual tables with CSS is a nightmare - you shouldn't use > table's for lots of things, I agree > but there are sometimes when it really is > the best option. Which isn't the case here ! Nested lists would easily do the trick... > Fixing up the CSS and still keeping tables is a > perfectly valid option. yes it's true... E.D

1 0

Re: [Haskell-cafe] Speed of character reading in Haskell
by Miguel Mitrofanov 10 Sep '07

10 Sep '07

> I started with the obvious > main = getContents >>= print . tokenise > where tokenise maps its way down a list of characters. This is very > simple, very pleasant, and worked like a charm. > However, the language has an INCLUDE directive, so I'm going to have > to call readFile or something in the middle of tokenising, so the > main tokeniser loop can't be a pure String -> [Token] function any > more. What about > tokenise :: [String] -> ([Token],[FilePath]) > main = print . fst =<< mfix process where > process (tokens,paths) = do > mainContents <- getContents > includes <- mapM readFile paths > return $ tokenise $ mainContents : includes I guess, it would be useful to replace ([Token],[FilePath]) with Writer [FilePath] [Token] > Method 1A (pure list processing) > main = getContents >>= print . doit 0 > doit n ('\n':cs) = doit (n+1) cs > doit n ( _ :cs) = doit n cs > doit n [] = n I think, you should use something like (doit $! n+1) cs here. > In *retrospect*, it is really obvious why this was > necessary, but I must say that in *prospect* I wasn't expecting it. In fact, I was expecting this to be an issue even for 1A. I suppose, GHC is smart enough to suppress lazyness in the first method.

6 7

Elevator pitch for Haskell.
by Paul Johnson 10 Sep '07

10 Sep '07

This page (http://www.npdbd.umn.edu/deliver/elevator.html) has a template for an "elevator pitch". This is what you say to someone when you have 30 seconds to explain your big idea, for instance if you find yourself in an elevator with them. I thought I'd try instantiating it for Haskell. For software developers who need to produce highly reliable software at minimum cost, Haskell is a pure functional programming language that reduces line count by 75% through reusable higher order functions and detects latent defects with its powerful static type system. Unlike Ada and Java, Haskell allows reusable functions to be combined without the overhead of class definitions and inheritance, and its type system prevents the hidden side effects that cause many bugs in programs written in conventional languages. Comments? Paul.

20 29