- Beginners - Haskell.org

problem running yi on OS X
by Richard Talley 09 Sep '09

09 Sep '09

I'm running OS X 10.5.8 on Intel. I installed GHC 6.10.4 and the Haskell Platform 2009.2.0.2 with no problem (thanks to everybody who made this so easy on OS X). The yi editor seems very interesting, so I installed it with 'cabal install yi' (after running 'cabal update'). That went OK (with some warnings about deprecated GHC features) and I was able to run yi which I found in ~/.cabal/bin Pressing h for help gave me a sample configuration file for yi which I edited to use cua keybindings and the (experimental) cocoa gui. Now when I tried to run yi again, I got this: Recompiling custom yi Launching custom yi: "/Users/rbtalley/.yi/yi-i386-darwin" yi: /Users/rbtalley/.yi/yi-i386-darwin: executeFile: does not exist (No such file or directory) Any suggestions? -- Rich -- Dealing with failure is easy: Work hard to improve. Success is also easy to handle: You've solved the wrong problem. Work hard to improve. -- Alan Perlis

1 0

Problems defining a type with a multiplication function
by Amy de Buitléir 09 Sep '09

09 Sep '09

I'm trying to define a Quaternion, which is sort of a four-element vector with special rules for multiplication. ----- Quaternion.hs ----- data Quaternion = Quaternion Double Double Double Double deriving (Show) (*) :: (Quaternion a) => a -> a -> a (*) (Quaternion w1 x1 y1 z1) (Quaternion w2 x2 y2 z2) = Quaternion w x y z where w = w1*w2 - x1*x2 - y1*y2 - z1*z2 x = x1*w2 + w1*x2 + y1*z2 - z1*y2 y = w1*y2 - x1*z2 + y1*w2 + z1*x2 z = w1*z2 + x1*y2 - y1*x2 + z1*w2 ----- end code ----- When I try to load this into ghci, I get: Quaternion.hs:6:13: Ambiguous occurrence `*' It could refer to either `Main.*', defined at Quaternion.hs:5:0 or `Prelude.*', imported from Prelude ... and lots more messages like that. I understand roughly what the message means, but I don't know how to tell it that when I use "*" within the definition, I just want ordinary multiplication. Thanks in advance for any help! Amy

4 4

number formatting with locale
by Dmitry Simonchik 08 Sep '09

08 Sep '09

Hi all haskell lovers I'm trying to print out Double in russian locale (we use "," as decimal separator insetad of "."). I'm trying to set locale with System.Locale.SetLocale like setLocale LC_ALL $ Just "ru_RU.UTF-8" this returns Just "ru_RU.UTF-8", so it seems that function call succeeded, but when I call show 20.2 it just prints 20.2 and not desired 20,2 Can anyone please help?

3 3

Urgent: Defining Momory data Types in Haskell
by Akshay Dave 08 Sep '09

08 Sep '09

Hi All, I am stuck in converting the transition semantics in Haskell. Please let me know how to define memory data types in Haskell( like we define pointer in C). Prompt help would be greatly appreciated. Sincerely, Akshay _________________________________________________________________ With Windows Live, you can organize, edit, and share your photos. http://www.windowslive.com/Desktop/PhotoGallery

3 3

Help with CSV
by Hong Yang 07 Sep '09

07 Sep '09

I need to process csv files that have the characteristics as follows: 1) each file has thousands of columns which have String, Int, and Double types 2) the number of columns may change 3) for those columns whose name do not change, their location may change I want to process some columns in 3) using Haskell. In Perl, I can easily have the code like below: use Text::CSV; my $csv = Text::CSV->new( { allow_whitespace => 1 } ); open my $temp, "<", "temp.csv" or die "Cannot open temp.csv! ($!)"; my @fields = @{ $csv->getline($temp) }; $csv->column_names(@fields); while ( my $hr = $csv->getline_hr($temp) ) { my $sn = $hr->{"UNIT:unitSerialNumber"}; # processing goes here ... } close $temp; Can someone please give me an equivalent code in Haskell? Then I can digest and expand it. Thanks, Hong

3 3

idiomatic haskell question
by Tom Doris 07 Sep '09

07 Sep '09

Hi all, I've recently started using Haskell and am looking for some feedback on code I've written; I sometimes feel that maybe I'm not doing things the best way possible that Haskell allows, and maybe missing out on obvious improvements in brevity or elegance. So here's a tic-tac-toe solver I wrote that does basic min-max search of the entire tree (not efficient algorithmically, but it's tictactoe so a blank board can be fully solved in a few seconds). Also, if people have suggestions on how to change the program to actually output the moves it would make, please let me know - right now it just responds with 1 for a win for X, 0 for a draw, and -1 for a win for O. And there are probably bugs! Thanks in advance import Data.List data Box = Blank | X | O deriving (Eq, Show) -- usage: call score with the board rows concatenated: score [Blank, Blank, Blank, Blank, Blank, Blank, Blank, Blank, Blank] -- or score [Blank, X, O, Blank, X, O, Blank, Blank, Blank] -- score is 1 if X wins, 0 for draw, -1 for lose score :: [Box] -> Int score g | haveline X g = 1 | haveline O g = -1 | gridfull g = 0 | isxmove g = maximum (map score (makeallmoves X g)) | otherwise = minimum (map score (makeallmoves O g)) tolines :: [Box] -> [[Box]] tolines [a1, a2, a3, b1, b2, b3, c1, c2, c3] = [ [a1,a2,a3], [b1,b2,b3], [c1,c2,c3], [a1,b1,c1], [a2,b2,c2], [a3,b3,c3], [a1,b2,c3], [a3,b2,c1] ] haveline :: Box->[Box] -> Bool haveline b g = any ([b,b,b]==) (tolines g) gridfull :: [Box] -> Bool gridfull g = not $ any (Blank==) g isxmove :: [Box] -> Bool isxmove g = let movecount = sum $ map (\b -> if b==Blank then 0 else 1) g in mod movecount 2 == 0 isomove = not . isxmove fl :: Box->[Box]->[Box]->[[Box]] fl b xs (Blank:ys) = [xs ++ b:ys] fl _ _ _ = [] makeallmoves :: Box->[Box]-> [[Box]] makeallmoves b g = concat $ zipWith (fl b) (inits g) (tails g)

2 1

qtHaskell, ForeignPtr
by Michael Mossey 07 Sep '09

07 Sep '09

I'm trying to learn qtHaskell, an interface to the Qt GUI library. I am fairly new to Haskell, but have used Qt for a long time, so I thought I could probably reasonably attempt to grok qtHaskell at this point. My main question is: anyone recommended a good explanation of the foreign function or foreign pointer interface? My immediate question is that I was poking through the Qtc docs, and saw this: Documentation data Object a Constructors QObject !(ForeignPtr a) I am not sure how Haddock works. Is this telling me that an Object constructor takes one argument, which is of type QObject, where QObject is a type constructor that takes !(ForeignPtr a)? Or is this saying it takes two arguments, a QObject and a !(ForeignPtr a). That latter makes more sense I guess. What does the ! mean? Thanks, Mike

2 1

oops
by Michael Mossey 07 Sep '09

07 Sep '09

I'm sorry, I just noticed one of my prior questions was pretty silly. The second Object is the name of the type constructor. I realized that now. I was just fooled by the layout of Haddock and got temporarily confused. However, I'm still interested in learning more about what the ! means, and where I can learn about ForeignPtr (maybe a short tutorial to start). Thanks, Mike

2 1

graphics.ui.wxcore
by John Moore 06 Sep '09

06 Sep '09

Hi, Could someone please explain how to intall this. I have installed ghc and gtk2Hs and tried running small programs to get an idea of the gui system in Haskell. It keeps telling me cannot find graphics.ui.wxcore. Module failed etc. I just very recently started to learn Haskell. ( I need an idea for my final year project which at this moment is on functional programming and want to find advantages/disadvantages of the gui system in Haskell) Regards John

2 1

Haskell data structures: cheap immutable manipulation and nested equality?
by Anand Patil 06 Sep '09

06 Sep '09

Hi all, I'm slowly shopping around for a functional language. The first one I seriously considered was Clojure, because of its agents; but I'm now realizing that most of my concurrency needs can be met using 'par' and 'seq', so I'm thinking about giving Haskell a closer look. However, Clojure's collections (maps, lists, vectors, sets) have a couple of features that I would really miss: - Cheap 'manipulation'. In the following: user=> (def m {:a 1 :b 2}) #'user/m1 user=> (assoc m :a 3) {:a 3, :b 2} the 'assoc' function produces a new map which actually shares structure with m, meaning it doesn't need to make a full copy in memory; but it also leaves m unchanged. This works efficiently even for nested, mixed collections. - Cheap equality by value: user=> (= m {:a 1 :b 2 :c {:d 3 :f 4}}) false user=> (= m {:a 1 :b 2}) true If I understand correctly, equality is computed based on some kind of hash rather than by comparing the two maps element by element, so it's efficient even for large and/or nested collections. Do Haskell's data structures have analogous properties? If not, are there libraries providing such data structures? Thanks, Anand

2 2