- Haskell-Cafe - Haskell.org

GHC panic!
by 北原真一 17 Aug '14

17 Aug '14

I am asking for help I am Haskeller of Japan I'm using GHC7.6.3 GHC has caused the panic https://gist.github.com/minamiyama1994/6697c3fb9c345da6715f

3 4

HsUnix.h on Ubuntu Linux
by Vasili I. Galchin 17 Aug '14

17 Aug '14

1) I forgot how to get this include file 2) where does it go under /usr/include ???

3 3

The Good, the Bad and the GUI
by Wojtek Narczyński 16 Aug '14

16 Aug '14

Dear All, Haskell is great for great many areas, let me name just two: - parsers, translators, interpreters, compilers; highly concurrent systems. Haskell is however not great for GUIs. I've been thinking a little why this is so. I think one of the reasons might be that in Haskell it is unusual to deal with data that is incomplete or otherwise erroneous. Let me try to explain, what I mean, by example. If you declare Person class in Java, you automatically get a thingy that you can readily use in UI construction, because all the fields can temporarily be null, even the required ones. In Haskell you'd need two data types: the usual proper Haskell data type, and another which wraps every field in Maybe, facilitates editing, validation, etc. Perhaps it would be possible to generate one data type from the other, or generate both from a common specification. Let me write the same thing in other words. It is not controversial to say on this list that specifying what is correct means, is a good idea. But for GUIs, in addition to the strong type, you need another relaxed type to hold the values temporarily, until the human manages to deliver correct data, often by trial and error. Comments welcome. -- Kind regards, Wojtek Narczyński

18 72

Re: [Haskell-cafe] HaskellWiki page about SDL
by Henk-Jan van Tuyl 15 Aug '14

15 Aug '14

FYI On Fri, 15 Aug 2014 01:26:09 +0200, Irene Knapp <irene.knapp(a)icloud.com> wrote: > For some reason, although I’m subscribed to the mailing list, I’m not > allowed to send stuff to it (not that I’ve ever wanted to before). > Sorry for the private reply! Feel free to forward it to the list if you > wish. > > I haven’t tried in a while, but the problem is that on OS X, the SDL > library defines its own main() which invokes the user-provided main(), > and the C header file does #define main _SDL_main to make this “work” as > long as an FFI isn’t involved. > > I checked the SDL Mercurial repo, and it still does this: > > http://hg.libsdl.org/SDL/file/74356aed1fa2/include/SDL_main.h > <http://hg.libsdl.org/SDL/file/74356aed1fa2/include/SDL_main.h> > > So yes, the problem still exists. There is no easy workaround, either; > for Haskell code to run as a library rather than an executable requires > a special wrapper in C to initialize the runtime. > > Irene > >> On Aug 14, 2014, at 3:43 PM, Henk-Jan van Tuyl <hjgtuyl(a)chello.nl> >> wrote: >> >> >> L.S., >> >> Does the problem with SDL on OS X, as mentioned on the HaskellWiki page >> about SDL[0], still exist? This text is quite old and I would like to >> remove it. >> >> Regards, >> Henk-Jan van Tuyl >> >> >> [0] https://www.haskell.org/haskellwiki/SDL#Haskell-SDL_with_Mac_OS_X Regards, Henk-Jan van Tuyl -- Folding@home What if you could share your unused computer power to help find a cure? In just 5 minutes you can join the world's biggest networked computer and get us closer sooner. Watch the video. http://folding.stanford.edu/ http://Van.Tuyl.eu/ http://members.chello.nl/hjgtuyl/tourdemonad.html Haskell programming --

1 0

local mins
by Закиров Марат 15 Aug '14

15 Aug '14

Some time ago we have a discussion and now I am ready to present my algorithm for counting local mins. It is liniar for imperative case and in functially too (I hope). I spent hours of debugging on it... -- | Main entry point to the application. module Main where str = [5, 6, 7, 1, 0, 5, 3] norm :: ([a],[a]) -> ([a],[a]) norm (x,[]) = (take l1 x, take l2 $ reverse x) where l1 = length x `div` 2 l2 = length x - l1 norm ([],x) = (take l2 $ reverse x, take l1 x) where l1 = length x `div` 2 l2 = length x - l1 norm x = x insert :: (Ord a, Show a) => [a] -> Int -> ([(a, Int)],[(a, Int)]) -> ([(a, Int)],[(a, Int)]) insert [] _ x = x insert x p ([],[]) = ([(head x, p)],[]) insert x p (y,[]) = insert x p (norm (y,[])) insert x p (ys,z:zs) = if head x >= fst z then (ys,(head x, p):z:zs) else insert x p (ys,zs) delete :: (Ord a, Show a) => Int -> Int -> ([(a, Int)],[(a, Int)]) -> ([(a, Int)],[(a, Int)]) False = undefined delete p r ([],x) = delete p r (norm ([],x)) delete p r (x:xs,y) = if p > (snd x + r) then (xs,y) else (x:xs,y) getmin :: (Ord a, Show a) => ([(a, Int)],[(a, Int)]) -> a getmin ([],[]) = error "Getmin error" getmin ([],x) = getmin (norm ([],x)) getmin (x:xs,y) = fst x pass :: (Ord a, Show a) => [a] -> [a] pass [] = [] pass (x:xs) = xs minn :: Ord a => [a] -> [a] -> [a] minn x y = [] lmini :: (Ord a, Show a) => Int -> Int -> ([(a, Int)],[(a, Int)]) -> [a] -> [a] -> [a] lmini _ _ _ [] _ = [] lmini p r deq c l = if p < r then lmini (p+1) r (insert l p deq) c (pass l) else getmin deqn : lmini (p+1) r deqn (pass c) (pass l) where deqn = if p < (r*2) then insert l p deq else insert l p (delete (p-1) r deq) lmin :: (Ord a, Show a) => Int -> [a] -> [a] lmin r x = lmini 0 r ([],[]) x x main :: IO () main = do putStrLn "Min for list" putStrLn $ show str -- Regards, Marat. С уважением Марат.

1 0

ANNOUNCE: BOB Conference 2015 Berlin
by Matthias Fischmann 15 Aug '14

15 Aug '14

BOB Conference 2015 Berlin 23.1.2015 http://bobkonf.de/2015/ CALL FOR CONTRIBUTIONS English: http://bobkonf.de/2015/cfp.html German: http://bobkonf.de/2015/cfp.html Deadline: September 30, 2014 You drive advanced software engineering methods, implement ambitious architectures and are open to cutting-edge innovation? Attend this conference, meet people that share your goals, and get to know the best software tools and technologies available today. We strive to offer you a day full of new experiences and impressions that you can use to immediately improve your daily life as a software developer. If you share our vision and want to contribute, submit a proposal for a talk or tutorial! We are looking for talks about best-of-breed software technology, e.g.: - functional programming - reactive programming - micro-service architectures - persistent data structures and databases - everything really that isn’t mainstream, but you think should be. Presenters should provide the audience with information that is practically useful for software developers. This could take the form of e.g.: - experience reports - introductory talks on technical background - demos and how-tos We accept proposals for presentations of 45 minutes (40 minutes talk + 5 minutes questions), as well as 90 minute tutorials for beginners. The language of presentation should be either English or German. - questions to bobkonf at active minus group dot de - proposal deadline: September 30, 2014 - notification: October 15, 2014 - program: October 2014, 2014 For more info, visit http://bobkonf.de/2015/ Looking forward to your submissions, and to seeing you there! cheers, matthias

1 0

Functional Programming Job Opportunities
by stephen.t.west＠barclays.com 15 Aug '14

15 Aug '14

The Risk & Analytics team at Barclays currently has opportunities for functional programmers with experience of investment banking technology and quantitative analytics. If you're interested, please contact me (stephen dot t dot west at barclays dot com). Regards, Stephen. _______________________________________________ This message is for information purposes only, it is not a recommendation, advice, offer or solicitation to buy or sell a product or service nor an official confirmation of any transaction. It is directed at persons who are professionals and is not intended for retail customer use. Intended for recipient only. This message is subject to the terms at: www.barclays.com/emaildisclaimer. For important disclosures, please see: www.barclays.com/salesandtradingdisclaimer regarding market commentary from Barclays Sales and/or Trading, who are active market participants; and in respect of Barclays Research, including disclosures relating to specific issuers, please see http://publicresearch.barclays.com. _______________________________________________

1 0

Using `jack` on Windows, sounds realistic?
by Alois Cochard 15 Aug '14

15 Aug '14

Hi all, I've been recently used the great `jack` library from Henning Thielemann (cc'ed) on my linux computer. It work like a charm, but I was wondering about Windows support? As I see Jack run on windows, I'm hoping I might be able to build my haskell application that use `jack` on windows as well, is that realistic? anyone have tried already? Thanks in advance Note: I plan to have an other backend using 'portaudio', which would allow me to be cross-platform anyway... but using Jack bring ASIO support, which is really need for my use case (real time synthesizer). -- *Λ\ois* http://twitter.com/aloiscochard http://github.com/aloiscochard

2 2

Cannot install the Haskell Platform on GNU/Linux (possible Cabal issue)
by egarrulo 15 Aug '14

15 Aug '14

Hello guys, I cannot install the Haskell Platform 2014.2.0.0 on my GNU/Linux system: $ ./platform.sh \ > --prefix=/opt/haskell-platform/haskell-platform-2014.2.0.0 \ > ../ghc-7.8.3/ghc-7.8.3-i386-unknown-linux.tar.bz2 Warning: The following packages are likely to be broken by the reinstalls: haskell-platform-2013.2.0.0 Use --force-reinstalls if you want to install anyway. === pre-requisite packages for hptool are not installed run the following: cd hptool ; cabal install --only-dependencies However, the dependencies for *hptool* are already installed: $ cd hptool ; cabal install --only-dependencies Resolving dependencies... All the requested packages are already installed: Use --reinstall if you want to reinstall anyway. The existing Haskell system: - GHC 7.6.3 - Haskell Platform 2013.2.0.0 - cabal-install 1.16.0.2 (using Cabal library 1.16.0) Any help? Thank you.

3 7

How to improve the zipwith's performance
by jun zhang 15 Aug '14

15 Aug '14

Dear All I write a code for Clustering with Data.Clustering.Hierarchical, but it's slow. I use the profiling and change some code, but I don't know why zipwith take so many time? (even I change list to vector) My code is as blow, Any one kindly give me some advices. ====================== main = do .... let cluster = dendrogram SingleLinkage vectorList getVectorDistance .... getExp2 v1 v2 = d*d where d = v1 - v2 getExp v1 v2 | v1 == v2 = 0 | otherwise = getExp2 v1 v2 tfoldl d = DV.foldl1' (+) d changeDataType:: Int -> Double changeDataType d = fromIntegral d getVectorDistance::(a,DV.Vector Int)->(a, DV.Vector Int )->Double getVectorDistance v1 v2 = fromIntegral $ tfoldl dat where l1 = snd v1 l2 = snd v2 dat = DV.zipWith getExp l1 l2 ======================================= build with ghc -prof -fprof-auto -rtsopts -O2 log_cluster.hs run with log_cluster.exe +RTS -p profiling result is log_cluster.exe +RTS -p -RTS total time = 8.43 secs (8433 ticks @ 1000 us, 1 processor) total alloc = 1,614,252,224 bytes (excludes profiling overheads) COST CENTRE MODULE %time %alloc getVectorDistance.dat Main 49.4 37.8 tfoldl Main 5.7 0.0 getExp Main 4.5 0.0 getExp2 Main 0.5 1.5

3 2