On Mon, Apr 2, 2012 at 16:30, Evan Laforge wrote:
> On Mon, Apr 2, 2012 at 5:41 AM, Michael Snoyman
wrote:
>> On Mon, Apr 2, 2012 at 3:38 PM, Alp Mestanogullari
wrote:
>>> Lesson learned: for next year, write a Haskell program that tells if a
given
>>> -cafe thread or reddit discussion is a Apri
On Mon, Apr 2, 2012 at 5:41 AM, Michael Snoyman wrote:
> On Mon, Apr 2, 2012 at 3:38 PM, Alp Mestanogullari
> wrote:
>> Lesson learned: for next year, write a Haskell program that tells if a given
>> -cafe thread or reddit discussion is a April Fool's joke or not.
>
> import Data.Time
>
> main =
On 2 April 2012 14:41, Michael Snoyman wrote:
> import Data.Time
>
> main = do
> now <- getCurrentTime
> let (_, month, day) = toGregorian $ utctDay now
> putStrLn $
> if month == 4 && day == 1
> then "It's a joke"
> else "It's real"
import Data.Time
main = d
On Mon, Apr 2, 2012 at 3:38 PM, Alp Mestanogullari wrote:
> Lesson learned: for next year, write a Haskell program that tells if a given
> -cafe thread or reddit discussion is a April Fool's joke or not.
import Data.Time
main = do
now <- getCurrentTime
let (_, month, day) = toGregorian $
Lesson learned: for next year, write a Haskell program that tells if a
given -cafe thread or reddit discussion is a April Fool's joke or not.
On Sun, Apr 1, 2012 at 7:10 PM, Christopher Done
wrote:
> I actually read the first couple paragraphs and thought “sounds
> interesting I'll read it later”
I actually read the first couple paragraphs and thought “sounds
interesting I'll read it later”. After reading it properly, I lol'd.
> After some initial feedback, I'm going to create a page for the
> Homotopy Extensional Records Proposal (HERP) on trac. There are really
> only a few remaining que
Obviously Gregory is not familiar with Homotopy. In fact, its
isomorphism predicts that if someone named Greg is involved in a
discussion, someone named Gregory will also become involved.
Or that is what I get for responding to an e-mail without reading it
on April 1st :)
On Sun, Apr 1, 2012 at 7
Whoosh? :-)
On Sun, Apr 1, 2012 at 3:54 PM, Greg Weber wrote:
> Hi Gershom,
>
> This sounds very interesting even if I have no idea what you are
> talking about :)
> Please create a proposal linked from this page:
> http://hackage.haskell.org/trac/ghc/wiki/Records
> The first thing you should pr
Hi Gershom,
This sounds very interesting even if I have no idea what you are
talking about :)
Please create a proposal linked from this page:
http://hackage.haskell.org/trac/ghc/wiki/Records
The first thing you should probably do is explain the programmer's
point of view. That ensures that we are
The records discussion has been really complicated and confusing. But
I have a suggestion that should provide a great deal of power to
records, while being mostly[1] backwards-compatible with Haskell 2010.
Consider this example:
data A a = A{a:a, aa::a, aaa :: a -> A (a -> a)}
data B a = B
10 matches
Mail list logo
