-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On 9/10/10 14:13 , Ian Lynagh wrote:
When first reading the proposal, I thought the idea was to allow the
compiler to more easily perform optimisations like
a+b+c+2+3+d = a+b+c+5+d
but I guess that wasn't something you were thinking about?
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, and
Am Freitag, den 10.09.2010, 23:18 +0200 schrieb S. Doaitse Swierstra:
On 10 sep 2010, at 20:13, Ian Lynagh wrote:
How would the compiler work out which parsing to prefer? Or would it
assume that infixlr expressions are best balanced?
Yes, that is the idea.
To me, it seems weird that
