> Here's a video of bloxorz at work, very cool!
>
>
> http://archhaskell.wordpress.com/2009/07/04/bloxorz-an-opengl-logic-game-written-in-haskell/
I see it wasn't rehearsed in advance. ;)
Gergely
--
http://www.fastmail.fm - The professional email service
__
I would also like some sort of "combo" mode for Hackage where the
docs are shown the same way that they are now but with a link to
"Internals" showing the view that you propose, perhaps showing
only internals or highlighting them. Then we would be able to
have the internal documentation on Hackage
(for reference, here's the blog-post I wrote that inspired me to ask
this list for advice. I'll explain everything in this email anyway though.
http://haddock2009.wordpress.com/2009/06/23/how-to-navigate-your-code/
)
My challenge: getting to know an existing code-base quickly and easily,
so tha
Hi all,
Thanks everyone for the help. The HughesPJ module works well for me.
Cheers,
-John
On Mon, Jul 6, 2009 at 3:49 AM, Chris Eidhof wrote:
> On 4 jul 2009, at 05:13, Alexander Dunlap wrote:
>
> On Fri, Jul 3, 2009 at 6:45 PM, John Ky wrote:
>>
>>> Hi,
>>>
>>> Currently I'm pretty printi
On 7/5/09, Alexander Dunlap wrote:
> On Sun, Jul 5, 2009 at 7:46 PM, Uwe Hollerbach
> wrote:
>> On 7/5/09, Paul L wrote:
>>> Previously you had lastOrNil taking m [a] as input, presumably
>>> generated by mapM. So mapM is actually building an entire list before
>>> it returns the argument for you
On Sun, Jul 5, 2009 at 7:46 PM, Uwe Hollerbach wrote:
> On 7/5/09, Paul L wrote:
>> Previously you had lastOrNil taking m [a] as input, presumably
>> generated by mapM. So mapM is actually building an entire list before
>> it returns the argument for you to call lastOrNil. This is where you
>> had
On 7/5/09, Paul L wrote:
> Previously you had lastOrNil taking m [a] as input, presumably
> generated by mapM. So mapM is actually building an entire list before
> it returns the argument for you to call lastOrNil. This is where you
> had unexpected memory behavior.
>
> Now you are "fusing" lastOr
Previously you had lastOrNil taking m [a] as input, presumably
generated by mapM. So mapM is actually building an entire list before
it returns the argument for you to call lastOrNil. This is where you
had unexpected memory behavior.
Now you are "fusing" lastOrNil and mapM together, and instead of
While I like the idea of (++) as mappend to some extent, two objections
immediately come to mind:
1.) While I like the appeal to the PVP to export a version of (++) from
Data.Monoid and I think this has worked out well for new modules like
Control.Category, I'm not sure that with a module that has
patai_gergely:
> Hello all,
>
> This post is not about my own creation, it's just a little fun program
> written by a student of mine. You can install the bloxorz package to try
> it out, and read more about its background on my blog:
>
> http://just-bottom.blogspot.com/2009/07/playing-and-learni
On Tue, 30 Jun 2009, Bryan O'Sullivan wrote:
I've thought for a while that it would be very nice indeed if the Monoid class
had a more
concise operator for infix appending than "a `mappend` b". I wonder if other
people are of a
similar opinion, and if so, whether this is worth submitting a li
Robert Greayer schrieb:
> I'm sure there's some important historical reason... but why isn't '&'
> used in something more prominent than the fgl package? I understand
> why it's not used for bitwise AND in Data.Bits (I assume because the
> corresponding bitwise '|' operator isn't available), but a
Are there any tools for generating Show & Read instances for GADTs? - Conal
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On 4 jul 2009, at 05:13, Alexander Dunlap wrote:
On Fri, Jul 3, 2009 at 6:45 PM, John Ky wrote:
Hi,
Currently I'm pretty printing code by building arrays of strings
and calling
indent. For example:
instance JavaPrintableNamed AST.EnumeratedType where
javaLinesNamed parentName (AST.Enum
14 matches
Mail list logo
