There are very good reasons for not following this road; indeed everything
which is a Monad can also be made an instance of Applicative. But more often
than not we want to have a more specific implementation. Because Applicative is
less general, there is in general more that you can do with it.
On 10 sep 2010, at 20:13, Ian Lynagh wrote:
On Fri, Sep 10, 2010 at 07:51:10PM +0200, S. Doaitse Swierstra wrote:
Currently Haskell has infix, infixl and infixr operators. I see a use for
infixlr as well. This indicates that the implemtation may assume the
operator to be associative
AM, Simon Marlow wrote:
On 09/02/10 21:43, S. Doaitse Swierstra wrote:
One we start discussing syntax again it might be a good occasion
to
reformulate/make more precise a few points.
The following program is accepted by the Utrecht Haskell
Compiler (here
we took great effort to follow
One we start discussing syntax again it might be a good occasion to
reformulate/make more precise a few points.
The following program is accepted by the Utrecht Haskell Compiler
(here we took great effort to follow the report closely ;-} instead of
spending our time on n+k patterns), but
Herewith I propose Atze Dijkstra as a member of the Haskell 2011
committee.
Atze is the main architect/implementor of the Utrecht Haskell Compiler
(see http://www.cs.uu.nl/wiki/UHC, and last year Haskell Symposium),
and has as a result of that a very good insight in the implementation
