[Haskell-cafe] Re: Fractional/negative fixity?
robdockins at fastmail.fm
Wed Nov 8 09:38:12 EST 2006
On Nov 8, 2006, at 3:58 AM, apfelmus at quantentunnel.de wrote:
> Lennart Augustsson wrote:
>> On Nov 7, 2006, at 11:47 ,
>> apfelmus at quantentunnel.de wrote:
>>> Henning Thielemann wrote:
>>>> On Tue, 7 Nov 2006, Simon Marlow wrote:
>>>>> I'd support fractional and negative fixity. It's a simple
>>>>> change to
>>>>> make, but we also have to adopt
>>> I think that computable real fixity levels are useful, too. A
>>> step to complex numbers is not advised because those cannot be
>> But ordering of the computable reals is not computable. So it could
>> cause the compiler to loop during parsing. :)
> Actually, that's one of the use cases ;)
A turing-complete type-checker isn't enough! Our work is not
complete until the parser is a universal machine as well!
Speak softly and drive a Sherman tank.
Laugh hard; it's a long way to the bank.
More information about the Haskell-Cafe