Hi Atze,
I share your desire for simplicity. In fact, I think my proposal is
simpler than the existing ones of hugs, ghc, nhc98 and the language
descriptions (98, 2010), although it's basically a matter of tuning.
Layout and the type system are far more involving and should not
interfere with
Malcolm Wallace schrieb:
I'm asking for support of:
http://hackage.haskell.org/trac/haskell-prime/wiki/PrefixMinusResolution
Just to note that nhc98 appears to fulfill the outcome of this
resolution algorithm already, with the exception of example x7, which is
parsed as -(4#5).
Because it
Hi,
I prefer the simplicity of
http://hackage.haskell.org/trac/haskell-prime/wiki/NegationBindsTightly over
the more involved proposal. I think we should take every opportunity to
simplify matters instead of complicating them. Although each individual
improvement (like this) seems harmless,
Simon Marlow schrieb:
BTW, here's a related proposal made by Simon PJ earlier this year:
http://hackage.haskell.org/trac/haskell-prime/wiki/NegationBindsTightly
please consider merging the proposals, or at least clearly identifying
the differences, if any.
Thanks for pointing this out.
Christian Maeder schrieb:
[...]
Without this restriction polynomials like
- a + - b * x + - c * - x ^ 2
would uniquely resolve to
((- a) + (- (b * x))) + (- (c * (- (x ^ 2
I think hugs handles this correctly!
yes it does this case.
Let us assume a user-defined (non- or)
