| sorear | saddev: autoreconf first |
| fantasma | > let mult a 0 = 0; mult a b = a + mult a (b-1) in mult 4 3 |
| lambdabot | 12 |
| fantasma | woot > let mult a 0 = 0; mult a b = a + mult a (b-1) in mult 1 3 |
| lambdabot | 3 |
| fantasma | > let mult a 0 = 0; mult a b = a + mult a (b-1) in mult 0 3 |
| monochrom | @quote Syzygy |
| lambdabot | No quotes match. Wrong! You cheating scum! 0 |
| saddev | 11 October 2006 realease right? |
| monochrom | @quote Syzygy- |
| lambdabot | Syzygy- says: Why do I get the feeling that the arrow code was written during "Speak like a pirate day"? |
| monochrom | @quote Syzygy- |
| lambdabot | Syzygy- says: Why do I get the feeling that the arrow code was written during "Speak like a pirate day"? |
| monochrom | @quote Syzygy- |
| lambdabot | Syzygy- says: Why do I get the feeling that the arrow code was written during "Speak like a pirate day"? |
| bos | @hoogle forever |
| lambdabot | No matches found |
| sorear | saddev: if you have a release .tar.gz you don't need to autoreconf, but if you're not going HEAD there's not much point in coming from source |
| monochrom | OK, I can't find what I want. |
| fantasma | i did it, i multiplied numbers! |
| JoshTriplett | bos: Looking for something in particular? |
| sorear | bos: repeatM |
| bos | JoshTriplett: forever is in Control.Monad in the darcs head of base, but not ghc 6.6 |
| sorear | bos: fix.(>>) |
| fantasma | is it possible to do division recursively |
| sorear | bos: short enough? |
| bos | sorear: :-) |
| sorear | fantasma: of course! |
| fantasma | dont write the code! :) |
| saddev | sorear: I see what you mean. To learn, is it better going with HEAD, the tar.gz 6.6 or the ubuntu deb package 6.4.2? |
| siti | well you don't really need the features in ghc 6.6 |
| JoshTriplett | saddev: For learning purposes, one of the latter two, most likely the deb. |
| sorear | saddev: 6.4.2. anything later than 3.0 or so will get you haskell98 saddev: 6.4.2 is likely to get you the least "fun" |
| siti | they come in useful when you are making gtk apps in haskell, using a debugger and other nifty features |
| sorear | drum roll... |
| monochrom | I know how to do division recursively. To divide x by y, search through 0*y, 1*y, 2*y, ... until you find n*y == x. |