- Haskell-Cafe - Haskell.org

ghci vi mode?
by Adam Smyczek 27 Jun '08

27 Jun '08

If I remember correctly, ghci uses readline framework on Linux/OS X. Is it possible to change ghci editing mode to vi? Thanks, Adam

2 1

Error in configure script for GHC
by Jefferson Heard 27 Jun '08

27 Jun '08

I've tried all the 6.6 and 6.8 versions, trying to compile them on a RHEL-based supercomputer, and I always see this error when I run ./configure: -bash-3.00$ ./configure checking build system type... x86_64-unknown-linux-gnu checking host system type... x86_64-unknown-linux-gnu checking target system type... x86_64-unknown-linux-gnu Which we'll further canonicalise into: x86_64-unknown-linux checking for path to top of build tree... pwd: timer_create: Invalid argument configure: error: cannot determine current directory Is this a known bug with GHC, or is it my supercomputer? We have several supercomputers here running in production, so I can't really ask them to change the configuration just for me, but nonetheless I'd like to run on them.

3 4

Call Graph Tool?
by C.M.Brown 27 Jun '08

27 Jun '08

Hi, I have approx. 100+ source files and I was wondering if anyone has a tool that would let me see a visual call graph for the source files; i.e. a visual hierarchy of which module is imported by what, and so forth. Kind regards, Chris.

10 13

what's up with hackage.haskell.org?
by Martin DeMello 27 Jun '08

27 Jun '08

haven't been able to get to it in a couple of days (at least) martin

2 2

Parsing problem
by Eric 27 Jun '08

27 Jun '08

Hi all, I'm using the Parsec library to parse the following grammar expr = atom+ atom = integer | var | (expr) The input to the parser is a list of (Token, SourcePos). I have the following code for atom: atom = try variable <|> try integerr <|> do{sat(== Reserved "("); (e,pos) <- expression; sat(==Reserved ")"); return (e,pos)} sat p = do (t,pos) <- item if p t then return(t,pos) else pzero When I run the code on the input "(_ineg_ 0)" the parser fails, but removing sat(==Reserved ")") and it succeeds. Can any one see why? E.

2 7

System.Console.Readline stifleHistory Question
by Daniel Kahlenberg 27 Jun '08

27 Jun '08

Hello all, I'm learning Haskell and so very likely will have advantages from the history persistence feature added to the ghci haskell interpreter. It drives very well in my setup (the history file is growing and used), but I wanted to increase the number of saved history entries and now my question concerning ghci: In the ticket (http://hackage.haskell.org/trac/ghc/ticket/2050) associated with the feature, there's written that one can call stifleHistory in its dotghci file. Have done it like: :m +System.Console.Readline stifleHistory 300 :m -System.Console.Readline but now my ghci.exe says: Could not find module `System.Console.Readline': Use -v to see a list of the files searched for. <interactive>:1:0: Not in scope: `stifleHistory' `uname -r`: MINGW32_NT-5.1 CLE10 1.0.11(0.46/3/2) 2007-01-12 12:05 i686 Msys Do you have an idea, where I'm wrong? I'm starting my ghci session from zsh shell, provided by cygwin, wrapped in a tty emulator: $Drive\puttycyg\putty.exe -cygterm $Drive\zsh\bin\zsh.exe -p -c 'PATH=/cygdrive/h/zsh/bin:$PATH HOME=/cygdrive/h/.homedir rlwrap $(which ghcii.sh) -package-conf $Drive/.homedir/ghc/i386-mingw32-6.8.3/package.conf -read-dot-ghci' So I did not expect Readline not to work, but maybe the ghc system only sees the result from `uname -r` above?? Bye, Daniel.

1 1

Fwd: Stack Overflow with HaXml
by Samuel Silva 27 Jun '08

27 Jun '08

Hello I presents a small case studie, when I was using HaXml with DtdToHaskell. I write small DTD: > <!ELEMENT top (#PCDATA|child)* > > <!ELEMENT child (#PCDATA) > I run DtdToHaskell small.DTD > Extsubext.hs and test it with small XML > <top><child></child></top> Result it is presented below: >$ ghci Extsubset.hs >GHCi, version 6.8.2: http://www.haskell.org/ghc/ :? for help >Loading package base ... linking ... done. >[1 of 1] Compiling Extsubset ( Extsubset.hs, interpreted ) >Ok, modules loaded: Extsubset. >*Extsubset> fReadXml "sample.xml" :: IO Top >Loading package array-0.1.0.0 ... linking ... done. >Loading package bytestring-0.9.0.1 ... linking ... done. >Loading package pretty-1.0.0.0 ... linking ... done. >Loading package old-locale-1.0.0.0 ... linking ... done. >Loading package old-time-1.0.0.0 ... linking ... done. >Loading package filepath-1.1.0.0 ... linking ... done. >Loading package directory-1.0.0.0 ... linking ... done. >Loading package random-1.0.0.0 ... linking ... done. >Loading package process-1.0.0.0 ... linking ... done. >Loading package haskell98 ... linking ... done. >Loading package polyparse-1.1 ... linking ... done. >Loading package containers-0.1.0.1 ... linking ... done. >Loading package HaXml-1.19.4 ... linking ... done. >*** Exception: stack overflow >*Extsubset> HaXml is able handle XML mixed elements? -- Don't hug that, Hugs ME! Samuel Silva

1 0

Haskell, Microsoft, and interview questions
by Andrew Wagner 27 Jun '08

27 Jun '08

This post borders on being off-topic, but it seems like people on this list would be interested. First, some of you know that I had the distinct privilege of flying out to Microsoft this week to interview for a Software Development Engineer position on their Live Search team. So I want to first tell you about their reaction to my Haskell experience, and then give you some interesting coding problems that they asked me to solve, which could be good practice to tackle in Haskell. So the first task I was given to do, long before my in-person interview, was to complete a technical assessment. This consisted of two fairly simple algorithms to write. I chose to do so in Haskell. On the basis of this assessment, they decided I was worth a phone interview. When I got on that interview, one of the first things the interviewer said was "So, one thing that jumped out immediately was that you did the assessment in Haskell. Tell me a little bit about that." It led to a good discussion about why I like Haskell and functional programming. When I actually flew out there, several people made comments about me being "that guy who writes Haskell". The recruiter even said something along the lines of "anyone who knows haskell is certainly worth our time to talk to." Moral of the story: Haskell rocks, and even Microsoft knows it! That said, here are some interesting problems to work through in Haskell, if you'd like: 1.) A "rotated array" is an array of integers in ascending order, after which for every element i, it has been moved to element (i + n) mod sizeOfList. Write a function that takes a rotated array and, in less-than-linear time, returns n (the amount of rotation). 2.) You are given a list of Ball objects. Each Ball is either Red or Blue. Write a function that partitions these balls so that all of the balls of each color are contiguous. Return the index of the first ball of the second color (your result can be Red balls, then Blue balls, or the other way around). In haskell, you'll probably want to return a ([Ball],Int). 3.) Live Search is a search engine. Suppose it was to be tied into an online store. Now you're given two lists. One is a [(SessionId, NormalizedQuery)]. That is, when a particular user performs a query, it is turned into some consistent format, based on their apparent intent, and stored in this logfile. The second list is a [(SessionId, ProductId)]. This indicates the product bought by a particular user. Now, you want to take these two (potentially very long) lists, and return some structure that will make it easy to take a query and return a list of the most popular resulting purchases. That is, of people who have run this query in the past, what are the most common products they've wound up buying? The interviewer said that this is an instance of a well-known problem, but I didn't catch the name of it. 4.) You're given an array which contains the numbers from 1 to n, in random order, except there is one missing. Write a function to return the missing number. 5.) Write a function to reconstruct a binary tree from its preorder traversal and inorder traversal. Take into account that the traversals could be invalid. 6.) You have a [(WeatherStationId, Latitude, Longitude)]. Similar to #3, write a function which will, off-line, turn this into a data structure from which you can easily determine the nearest Weather Station, given an arbitrary Latitude and Longitude. 7.) Write a function for scoring a mastermind guess. That is, in a game of mastermind (http://en.wikipedia.org/wiki/Mastermind_(board_game)) given a guess, and the actual answer, determine the number correct, the number wrong, and the number out of place. 8.) Implement a trie (http://en.wikipedia.org/wiki/Trie) data structure. Write a function add, which takes a word, and a trie, and adds the word to the trie. Write another function lookup, which takes a prefix and a trie, and returns all the words in the trie that start with that prefix. 9.) Write an algorithm to shuffle a deck of cards. Now write a function to perform some kind of evaluation of "how shuffled" a deck of cards is. Hope you enjoy!

6 9

haskell and dockapps
by Martin DeMello 26 Jun '08

26 Jun '08

Anyone written a windowmaker dockapp in Haskell? I thought it'd be a fun project, but I don't quite know where to start. martin

2 2

Internet Communications Engine and Haskell
by Mitar 26 Jun '08

26 Jun '08

Hi! Has been any work on implementing Internet Communications Engine in Haskell already done? Any other suggestions how could I use ICE in Haskell? Through FFI calls to its C++ version? http://www.zeroc.com/ice.html Mitar

2 1