Re: [Haskell-cafe] New blog: mainly Haskell and wxHaskell related
Hi Jeremy! It´s a very nice Idea! Could you put a tutorial on how to install wxhaskell on different operating systems? I´ve tried to install it on ubuntu 9.10 and I got some compilation errors due to the installation process can´t find the wxdirect executable... Regards Rodrigo On Mon, Jan 11, 2010 at 9:54 AM, Jeremy O'Donoghue < jeremy.odonog...@gmail.com> wrote: > Hi all, > > I have just started a new blog at http://wewantarock.wordpress.com. > > At least initially, my intention is to provide a set of 'tutorial' > style articles to help new wxHaskell users get beyond the 'Hello > World' stage by offering a few worked examples on things you might > want to do to put together a usable application. The idea is to offer > something which fits between the first tutorial and the reference > documents. > > The first few postings will explain the anatomy of a complete custom > wxHaskell control written in Haskell. > > Comments gratefully accepted, including (gentle please - I'm not > dons!) criticism of my Haskell style. > > Regards > Jeremy O'Donoghue > ___ > Haskell-Cafe mailing list > Haskell-Cafe@haskell.org > http://www.haskell.org/mailman/listinfo/haskell-cafe > ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] Monad proof
Did you see this? http://okmij.org/ftp/Computation/proving-monad-laws.txt []'s Rodrigo Geraldo Ribeiro. PhD student - UFMG On Fri, Apr 11, 2008 at 2:35 PM, Rafael C. de Almeida <[EMAIL PROTECTED]> wrote: > Hello, > > I was studying Monads and I was trying to think about new Monads I could > define. So, a question poped into my mind: how is proof regarding the 3 > Monad laws handled? I know that, aside from testing all the possible values > (and there can be a lot of them), there's no general way to prove it. > Nonetheless, I think that it would be insightful to see how people write > those proofs for their monads -- specially for new user monads. Is there > some article or some notes on proving that Monads are implemented correctly? > > []'s > Rafael > ___ > Haskell-Cafe mailing list > Haskell-Cafe@haskell.org > http://www.haskell.org/mailman/listinfo/haskell-cafe > ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
[Haskell-cafe] A possibly stupid doubt about the GHC's overlapping instances flag's
Hi! Suppose that the GHC's flag -fallow-incoherent-instances is enabled. In this situation, when a instance will be rejected? And if the flag -fallow-overlapping-instances is enabled. When a instance will be rejected? Thanks! Rodrigo ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
[Haskell-cafe] Newbie question: Why gfoldl has this strange type?
Hi! I am a novice in Haskell, and particularly I have interested in generic programming. This interest motivated me to read paper Scrap your boilerplate: A practical design pattern for generic programming, but I didn't understand the type of the function gfoldl, that was present in class Term (Data). Somebody could help me to understand the type of this function? Thanks... Rodrigo ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
