- Beginners - Haskell.org

Basic sound playing on Windows?
by Cleverson Casarin Uliana 08 Oct '16

08 Oct '16

Hello all, is it easy to play/stop sound wave files on Windows? For now I'd like just playing and stopping them assynchronously. Do I need to install any package besides Haskell Platform? Thanks, Cleverson

2 2

Re: [Haskell-beginners] how to enter EOF in emacs haskell mode
by Shrivats 06 Oct '16

06 Oct '16

Hi, If it's anything like other interactive modes, does C-c C-d do the job of signalling EOF? Shrivats On Sep 14, 2016 15:53, "Chul-Woong Yang" <cwyang(a)aranetworks.com> wrote: Hi, all. I use emacs haskell mode for editing and testing simple programs. I have no success in finding out how to enter EOF to haskell program in emacs "Interactive-Haskell" buffer. So I am unable to test haskell program which reads from stdin. :-( Any help would be appreciated deeply. Regards, Chul-Woong Yang _______________________________________________ Beginners mailing list Beginners(a)haskell.org http://mail.haskell.org/cgi-bin/mailman/listinfo/beginners

3 4

Problems with lifting code
by PATRICK BROWNE 02 Oct '16

02 Oct '16

Hi, I am trying, without sucess, to run the code below from [1] (Section 4.3). Obviouly I am missing something. I would like to keep as close to the original code as possible. Any help would be apreciated. Regards, Pat [1] http://publik.tuwien.ac.at/files/pub-geo_2321.pdf data MyNumbers a = MyNum a deriving Show class (Floating a) => Numbers a where sqr :: a -> a -- Not sure if i need these -- instance Num (MyNumbers a) where -- instance Fractional (MyNumbers a) where class Lifts b a where lift0 :: a -> b a lift1 :: (a -> a) -> b a -> b a instance Lifts MyNumbers a where lift0 x = MyNum x lift1 o x = MyNum (o x) -- ** Couldn't match expected type `a' with actual type `MyNumbers a' ** instance (Floating (MyNumbers Float)) => Numbers (MyNumbers Float) where sqr x = lift1 sqr x -- ** could not deduce (Numbers Float) arising from a use of `sqr' ** -- This email originated from DIT. If you received this email in error, please delete it from your system. Please note that if you are not the named addressee, disclosing, copying, distributing or taking any action based on the contents of this email or attachments is prohibited. www.dit.ie Is ó ITBÁC a tháinig an ríomhphost seo. Má fuair tú an ríomhphost seo trí earráid, scrios de do chóras é le do thoil. Tabhair ar aird, mura tú an seolaí ainmnithe, go bhfuil dianchosc ar aon nochtadh, aon chóipeáil, aon dáileadh nó ar aon ghníomh a dhéanfar bunaithe ar an ábhar atá sa ríomhphost nó sna hiatáin seo. www.dit.ie Tá ITBÁC ag aistriú go Gráinseach Ghormáin – DIT is on the move to Grangegorman <http://www.dit.ie/grangegorman>

3 5

Just wanted to share some GHCI macros with fellow beginners
by Lai Boon Hui 01 Oct '16

01 Oct '16

Hi fellow beginners, wanted to share some macros you can add to your ghci config file so that you don't have to keep switching between ghci and command line. In my case i use Git a lot :def pwd (\_-> System.Directory.getCurrentDirectory >>= print >> return "") :def gitA (\_ -> System.Process.rawSystem "git" ["add", "-A"] >>= print >> return "") :def gitC (\m -> System.Process.rawSystem "git" ["commit", "-am", m] >>= print >> return "") :def gitP (\_ -> System.Process.rawSystem "git" ["push"] >>= print >> return "") -- Best Regards, Boon Hui

2 1

short-circuit like Maybe monad with a difference
by Dennis Raddle 30 Sep '16

30 Sep '16

I have a function 'evalRule' that applies rules to steps in a backtracking search optimization problem and evaluates the step's fitness or decides that it must be eliminated entirely. In the following, a result of Nothing means "eliminate the step," Just x means the step has fitness score x. evalRule :: Rule -> Step -> Maybe Double I would like to write a function that applies a bunch of rules but short-circuits the computation if it hits Nothing. However, unlike the way the Maybe monad works, I want to know the partial results. In the following, the rules are applied in order and the "Just" results are collected up the point where a rule returns Nothing. evalRules :: [Rule] -> Step -> [Double] What's a nice way to do this? D

2 4

Could not deduce (Frame a r0) arising from a use of `len'
by PICCA Frederic-Emmanuel 30 Sep '16

30 Sep '16

Hello I try to write something like this {-# LANGUAGE MultiParamTypeClasses #-} {-# LANGUAGE RankNTypes #-} module Hkl.Frame ( Frame(..) , frames , frames' ) where import Pipes import Control.Monad class (Frame a r) where len :: a -> IO (Maybe Int) row :: a -> Int -> IO r frames :: (Frame a r) => Pipe a r IO () frames = do d <- await (Just n) <- lift $ len d forM_ [0..n-1] (\i' -> do f <- lift $ row d i' yield f) But when I try to compile this I get this error message. Could not deduce (Frame a r0) arising from a use of `len' from the context (Frame a r) bound by the type signature for frames :: Frame a r => Pipe a r IO () at src/Hkl/Frame.hs:17:11-39 The type variable `r0' is ambiguous Possible fix: add a type signature that fixes these type variable(s) In the second argument of `($)', namely `len d' In a stmt of a 'do' block: (Just n) <- lift $ len d In the expression: do { d <- await; (Just n) <- lift $ len d; forM_ [0 .. n - 1] (\ i' -> do { f <- lift $ row d i'; .... }) } What should I do in order to solve this problem. Thanks Frederic

1 0

Why isn't :t (1+1) Integer
by Lai Boon Hui 30 Sep '16

30 Sep '16

Hi, i read that the default type for Num is Integer. If we specify a type for one of the arguments: :t (1 + 1::Double) is Double If we don't, i expect the default type for Num to come into play: However :t (1 + 1) is Num a => a Why is that so? -- Best Regards, Boon Hui

2 1

Haskell Platform on OS X, Sierra
by Dennis Raddle 29 Sep '16

29 Sep '16

I have been running the Haskell Platform on OS X El Capitan for a few months. I just upgraded to Sierra and I notice it broke something. For instance when I run ghci I get xcrun: error: invalid active developer path ... missing xcrun .... What's the best way to recover? Should I uninstall and reinstall Haskell Platform? BTW, how DO you uninstall the Haskell Platform on OS X?

1 1

A seemingly simple use-case for Template Haskell
by Mario Lang 29 Sep '16

29 Sep '16

Hi. As a long-term Lisp fan, and someone who always admired compile-time code-generation, I wanted to at least do something simple with Template Haskell once. In a small project of mine, I have this basically auto-generated data type: -- Braille music code only uses the old 6-dot system. We enumerate all -- possible dot patterns to use the type system to avoid accidentally -- specifying invalid dot patterns in the source code. -- -- gen :: String -- gen = -- "data Braille = " ++ intercalate " | " ctors ++ " deriving (Enum, Eq)" where -- ctors = "NoDots" : map ctorName [1..63] where -- ctorName :: Int -> String -- ctorName = (++) "Dot" . concatMap (show . succ) . flip filter [0..5] . testBit data SixDots = NoDots | Dot1 | Dot2 | Dot12 | Dot3 | Dot13 | Dot23 | Dot123 | Dot4 | Dot14 | Dot24 | Dot124 | Dot34 | Dot134 | Dot234 | Dot1234 | Dot5 | Dot15 | Dot25 | Dot125 | Dot35 | Dot135 | Dot235 | Dot1235 | Dot45 | Dot145 | Dot245 | Dot1245 | Dot345 | Dot1345 | Dot2345 | Dot12345 | Dot6 | Dot16 | Dot26 | Dot126 | Dot36 | Dot136 | Dot236 | Dot1236 | Dot46 | Dot146 | Dot246 | Dot1246 | Dot346 | Dot1346 | Dot2346 | Dot12346 | Dot56 | Dot156 | Dot256 | Dot1256 | Dot356 | Dot1356 | Dot2356 | Dot12356 | Dot456 | Dot1456 | Dot2456 | Dot12456 | Dot3456 | Dot13456 | Dot23456 | Dot123456 deriving (Bounded, Enum, Eq, Read, Show) So, while actually quite simple, this looks like an opportunity to use Template Haskell for me. In other words, I want to figure out what is necessary to generate this data type with TH, instead of the gen function that basically generates a piece of plain Haskell code. I have been reading "A practical Template Haskell Tutorial"[1] but I find it a little bit too terse to actually solve this very little riddle on my own. For one, I find it confusing that some TH functions return "Q Dec" while others just return Dec. I am aware that this is some sort of Monad for the TH system, but I have never seen it explained anywhere. Also, all the examples I can find seem to be mostly focused in generating Q Exp or similar, but I didn't really find an example for Q Dec. I realize this should be simple to figure out on my own, but it apparently is not. I have tried to wrap my head around this on my own at least three times now, but always stopped after an hour or two due to frustration. Is there some comprehensive TH documentation I haven't seen yet? Could you please give me enough of a head-start that I actually manage to write something which can generate this simple data type above? [1] https://wiki.haskell.org/A_practical_Template_Haskell_Tutorial -- CYa, ⡍⠁⠗⠊⠕

4 5

ftp-client for Windows
by Kees Bleijenberg 27 Sep '16

27 Sep '16

Is there a library with a ftp client that works on Windows? I tried ftphs but I get segmentation faults. Kees

1 0