Re: [Haskell-cafe] Proposal: Applicative => Monad: Call for consensus

2011-01-23 Thread Tyson Whitehead
On January 21, 2011 14:01:36 Ryan Ingram wrote: > Interesting little paper, Tyson. Hi Ryan, Thanks for comments and kind words. > I think what a programmer actually wants from ambiguity resolution is > something *predictable*; C++'s system is definitely stretching the > boundaries of predictabil

Re: [Haskell-cafe] Proposal: Applicative => Monad: Call for consensus

2011-01-21 Thread Tyson Whitehead
On January 19, 2011 15:28:33 Conor McBride wrote: > In each case, the former has (++) acting on lists of strings as pure > values, > while the latter has (++) acting on strings as values given in > []-computations. > > The type [String] determines a domain, it does not decompose uniquely > to a >

[Haskell-cafe] Re: Splittable random numbers

2010-11-04 Thread Tyson Whitehead
On November 4, 2010 13:38:12 Simon Peyton-Jones wrote: > From: Gideon Yuval (Gideon Yuval) > Sent: Wednesday, November 03, 2010 7:15 AM > To: Simon Peyton-Jones; Burton Smith > Cc: Tolga Acar > Subject: RE: Random number generation > > As long as the key, and the non-counting part of the counter,