On Pi, 2009-11-06 at 17:25 -0500, Brent Yorgey wrote:
> On Fri, Nov 06, 2009 at 03:29:47PM +, Stephen Tetley wrote:
> > Hello all,
> >
> > Are any of the of the more exotic recursion schemes definable without
> > a least-fixed point /Mu/ type?
>
> Note that Haskell datatypes have a built-in i
Hello, -Cafe,
I'm looking for an interesting topic to hack on in my thesis.
The thesis should be rather "theoretical"/abstract (writing a mail
client in Haskell is not, for example), dealing with FP or related
fields. I've had a few (blurry) ideas, ranging from investigating
(possibilities for) H
On So, 2008-08-23 at 22:16 +0200, Thomas Davie wrote:
> Today I made an interesting discovery.
>
> We all know the benefits of a strong type system, and often tout it as
> a major advantage of using Haskell. The discovery I made, was that C
> programmer don't realise the implications of that,
