November 2006 - Haskell-Cafe

Re: [Haskell-cafe] working with lists of couples
by Clare 23 Nov '06

23 Nov '06

Yes the code you are suggesting is certainly linear and it takes without doubt time n. But I was looking for a solution using foldl that of course takes time n. The problem of the following solution is that it gives a reversed result, and of course i can't just reverse the result. couples = snd . foldl f (0,[]) where f (s,[]) x = (s+x, [(x,0)]) f (s,xs) x = (s+x, (:) (x,s) xs) Clare 2006/11/17, Valentin Gjorgjioski <valentin.gjorgjioski(a)ijs.si>: > > On 17.11.2006 21:04 Clare wrote: > > I'm not sure it takes time n couse of the operator ++ and the lazy > > stuffs in haskell. > Ok, you can use > buildCouples (x:xs) s = (x,s) : (buildCouples xs (x+s)) > instead of ++ > > this algorithm is linear, I don't know why(?) you think it is not. > > Valentin > > -- > Valentin Gjorgjioski > Bachelor of Computer Science > Department of Knowledge Technologies, Jozef Stefan Institute > Jamova 39, SI-1000 Ljubljana, Slovenia > Phone: +386 1 477 3343 > Fax: +386 1 477 3315 > Web: http://kt.ijs.si/ValentinGjorgjioski/ > Email: Valentin.Gjorgjioski(a)ijs.si > >

1 0

type keeping rounding, typeable (and a difficulty)
by isto 23 Nov '06

23 Nov '06

Hi, I've been trying to compile the following function (rounding to a desired degree): roundDec :: (Num a, Typeable a) => Int -> a -> a roundDec d a = let t = show (typeOf a) in case t of "Double" -> roundDDec d a "Complex Double" -> roundCDec d a otherwise -> a -- or something The two other functions are roundCDec :: (RealFloat a) => Int -> Complex a -> Complex a roundCDec d (c :+ b) = (roundDDec d c :+ roundDDec d b) and roundDDec :: (RealFloat a) => Int -> a -> a roundDDec d a = a -- or somegthing Compiler gives the following error message: Couldn't match expected type `Complex a' against inferred type `a1' (a rigid variable) `a1' is bound by the type signature for `roundDec' at FFT.hs:57:17 In the second argument of `roundCDec', namely `a' In the expression: roundCDec d a In a case alternative: "Complex Double" -> roundCDec d a If in the roundDDec a's are replaced with Double, there will be similar error message from the "Double"-line. The functionality can be written differently, but I wanted to try write rounding having in a signature at least "(Num a) => Int -> a -> a". Again, any help would be appreciated a lot! Thanks in advance! br, Isto

3 5

Type Error. Why!?
by Tim Newsham 23 Nov '06

23 Nov '06

Can anyone tell me why I get a type error in the following code? I have to define liftA2 twice to avoid the type error. Both times its defined identically but with different type signature. If I use the original liftA2 in place of liftA2' I get: whyerror.lhs:36:25: Ambiguous type variable `a' in the constraint: `Arrow a' arising from use of `>>>' at whyerror.lhs:36:25-27 Possible cause: the monomorphism restriction applied to the following: liftA2' :: forall b a1 b1 c. (a1 -> b1 -> c) -> a b a1 -> a b b1 -> a b c (bound at whyerror.lhs:36:1) unsplit' :: forall a1 b c. (a1 -> b -> c) -> a (a1, b) c (bound at whyerror.lhs:34:1) split' :: forall b. a b (b, b) (bound at whyerror.lhs:33:1) Probable fix: give these definition(s) an explicit type signature or use -fno-monomorphism-restriction ----- whyerror.lhs ---- > {-# OPTIONS_GHC -farrows #-} > module WhyError where > import Control.Arrow > newtype SimpleFunc a b = SimpleFunc { runF :: (a -> b) } > instance Arrow SimpleFunc where > arr f = SimpleFunc f > first (SimpleFunc f) = SimpleFunc (mapFst f) > where mapFst g (a,b) = (g a, b) > (SimpleFunc f) >>> (SimpleFunc g) = SimpleFunc (g . f) > split :: (Arrow a) => a b (b, b) > split = arr (\x -> (x,x)) > unsplit :: (Arrow a) => (b -> c -> d) -> a (b, c) d > unsplit = arr . uncurry > -- arr (\op (x,y) -> x `op` y) > liftA2 :: (Arrow a) => (b -> c -> d) -> a e b -> a e c -> a e d > liftA2 op f g = split >>> first f >>> second g >>> unsplit op > -- f &&& g >>> unsplit op > f, g :: SimpleFunc Int Int > f = arr (`div` 2) > g = arr (\x -> x*3 + 1) > h = liftA2 (+) f g > hOutput = runF h 8 > -- XXX I am getting type problems with split, unsplit and liftA2! why? > split' = arr (\x -> (x,x)) > unsplit' = arr . uncurry > -- liftA2' :: (Arrow a) => (b -> c -> d) -> a e b -> a e c -> a e d > liftA2' op f g = split' >>> first f >>> second g >>> unsplit' op > plusminus, double, h2 :: Kleisli [] Int Int > plusminus = Kleisli (\x -> [x, -x]) > double = arr (* 2) > h2 = liftA2 (+) plusminus double > h2Output = runKleisli h2 8 > main = do > print hOutput > print h2Output Tim Newsham http://www.thenewsh.com/~newsham/

5 6

LLVM back end
by Michael T. Richter 23 Nov '06

23 Nov '06

I've been eyeing LLVM[1] as interesting technology -- brief executive summary: a virtual machine suited as the back end of compiler output with optimised native code then coming from it as either JIT-based execution of the LLVM bytecode or as a further compilation step -- and couldn't help but immediately think of the possibility of one of the Haskell compiler projects providing an LLVM code generator. I think this would help in several areas: * it could make porting the compiler to other architectures -- including oddball ones that would be too small to otherwise support -- easier; * it could help remove the nigh-ubiquitous reliance upon GCC as a back-end (while I think that GCC is a pretty good piece of software, I'm not sure it's really suited to its current role as the "do-everything" back end); * it could leverage some of the really interesting work that's going on in optimisation technology by letting one VM's optimiser do the work for any number of languages; * it could improve interaction between source code written in multiple languages. Is this me opening up a Pandora's Box of ignorance here? Or is LLVM potentially interesting? (And were someone motivated into perhaps trying to make an LLVM back-end, where would one start to poke around in, say, the GHC codebase to even begin to implement this? And how insane would they be driven by the process?) [1]http://llvm.org -- Michael T. Richter Email: ttmrichter(a)gmail.com, mtr1966(a)hotpop.com MSN: ttmrichter(a)hotmail.com, mtr1966(a)hotmail.com; YIM: michael_richter_1966; AIM: YanJiahua1966; ICQ: 241960658; Jabber: mtr1966(a)jabber.cn "I have never seen the poor people being so familiar with their heads of state as they were with [Michele Duvalier]. It was a beautiful lesson for me. I've learned something from it." --Mother Theresa

2 2

Re: help with happy/alex
by Simon Marlow 23 Nov '06

23 Nov '06

robert bauer wrote: > Hi, > > I have a .y and .x file. The alex -g _.x gives me a .hs file and happy -g -a -c _.y gives me a .hs file. > I then use ghc -c alex.hs to get a a .o and a .hi file. This works great. > Unfortunately > ghc -c happy.y doesn't work -- it says that it the module name for the lexer doesn't match. I've attached the > .y and .x files. > > Also, I cannot figure out what I need to do in the parser to call the lexer and I don't know how to kick start the > parser -- I have no clue what to put in third, main.hs, module. > > Any help would be appreciated. You have a typo in the module name in TVScriptLexer.x. As for tying it together, I suggest taking a look at some of the examples, eg. http://darcs.haskell.org/alex/examples/tiny.y from the Alex distribution. Cheers, Simon

1 0

YCR2JS Programmers Guide Draft available
by Dimitry Golubovsky 22 Nov '06

22 Nov '06

Hi, I have finished typing in the draft of low-level programming guide for Yhc Core to Javascript converter. Everyone interested in future use of this tool is encouraged to read and review the Guide. Its purpose is to give some ideas about interaction of Haskell programs converted into Javascript with a web browser on the lowest possible level, without application frameworks and support libraries (just because these haven't been developed). Any feedback and ideas are appreciated. The document is located at: http://haskell.org/haskellwiki/Yhc/Javascript/Programmers_guide Thanks. -- Dimitry Golubovsky Anywhere on the Web

1 0

trivial ghc problem, help needed
by brad clawsie 22 Nov '06

22 Nov '06

i have a program tb.hs: --- module Main where import Network.URI (URI(..), URIAuth(..), parseURI) myFunc :: String -> Maybe URI myFunc u = parseURI u main = do { return () } --- when i attempt to build it with ghc, i get the following output: tb.o: In function `Main_myFunc_info': (.text+0x11): undefined reference to `networkzm2zi0_NetworkziURI_parseURI_closure' tb.o: In function `Main_myFunc_srt': (.rodata+0x0): undefined reference to `networkzm2zi0_NetworkziURI_parseURI_closure' collect2: ld returned 1 exit status any clue why? i would send this to the ghc list but i presume my issue is due to a trivial misunderstanding of the language thanks in advance

2 1

Articles on programming with (IO) exceptions in Haskell?
by Magnus Therning 22 Nov '06

22 Nov '06

I'm having problems finding a good introduction to exceptions. Yet Another Haskell Tutorial leaves it for chapter 10, which is empty. I'd prefer something that suits a noob. :-) /M -- Magnus Therning (OpenPGP: 0xAB4DFBA4) magnus(a)therning.org Jabber: magnus.therning(a)gmail.com http://therning.org/magnus Software is not manufactured, it is something you write and publish. Keep Europe free from software patents, we do not want censorship by patent law on written works. `Time is an illusion. Lunchtime doubly so.' `Very deep,' said Arthur, `you should send that in to the "Reader's Digest". They've got a page for people like you.' -- Ford convincing Arthur to drink three pints in ten minutes at lunchtime.

4 3

Why are new releases of libraries required for every GHC release?
by DavidA 22 Nov '06

22 Nov '06

Some recent comments suggested that every time there is a new GHC release, there needs to be a new wxHaskell release (or insert name of other library here) to work with it. This seems to be true even for minor upgrades, like 6.4.1 -> 6.4.2. Why is this? Does GHC break binary compatibility at every release? Is this avoidable? This makes using Haskell unnecessarily hard compared to other platforms.

4 3

help with threadDelay
by Neil Davies 22 Nov '06

22 Nov '06

Hi, I'm using GHC 6.6 (debian/etch) - and having some fun with threadDelay. When compiled without the -threaded compiler argument it "behaves" as documented - waits at least the interval - for example: Tgt/Actual = 0.000000/0.036174s, diff = 0.036174s Tgt/Actual = 0.000001/0.049385s, diff = 0.049384s Tgt/Actual = 0.000005/0.049492s, diff = 0.049487s Tgt/Actual = 0.000025/0.049596s, diff = 0.049571s Tgt/Actual = 0.000125/0.049655s, diff = 0.04953s Tgt/Actual = 0.000625/0.04969s, diff = 0.049065s Tgt/Actual = 0.003125/0.049684s, diff = 0.046559s Tgt/Actual = 0.015625/0.04962s, diff = 0.033995s Tgt/Actual = 0.078125/0.099668s, diff = 0.021543s Tgt/Actual = 0.390625/0.399637s, diff = 0.009012s Tgt/Actual = 1.953125/1.999515s, diff = 0.04639s Tgt/Actual = 9.765625/9.799505s, diff = 0.03388s however when -threaded is used you get some interesting effects, including returning too early: Tgt/Actual = 0.000000/0.000093s, diff = 0.000093s Tgt/Actual = 0.000001/0.000031s, diff = 0.00003s Tgt/Actual = 0.000005/0.000029s, diff = 0.000024s Tgt/Actual = 0.000025/0.000028s, diff = 0.000003s Tgt/Actual = 0.000125/0.000034s, diff = -0.000091s Tgt/Actual = 0.000625/0.000035s, diff = -0.00059s Tgt/Actual = 0.003125/0.000029s, diff = -0.003096s Tgt/Actual = 0.015625/0.000028s, diff = -0.015597s Tgt/Actual = 0.078125/0.058525s, diff = -0.0196s Tgt/Actual = 0.390625/0.389669s, diff = -0.000956s Tgt/Actual = 1.953125/1.939513s, diff = -0.013612s Tgt/Actual = 9.765625/9.749573s, diff = -0.016052s The program I used to generate this is :- import Control.Concurrent import Data.Time import Text.Printf main = mapM_ delay (0 : take 11 (iterate (*5) 1)) delay n = do tS <- getCurrentTime threadDelay n tE <- getCurrentTime let n' = toRational n / 10^6 n'' = fromRational (n') :: Double obs = diffUTCTime tE tS printf "Tgt/Actual = %0.6f/%s, diff = %s\n" n'' (show obs) (show $ obs - fromRational n') return () Any suggestions? Neil

3 2