I too am against broadening the scope of n+k patterns, for reasons that others have 
given.  In particular, I am absolutely against allowing n+k patterns to be used for 
If n+k patterns are to be meaningful at all, you want matching y against x+1, you want 
a unique
x such that (x+1)=y.  Yet for floats there may not be such an x (y = positive zero), 
or there may
be more than one (y=2^n with n chosen so that 2^n+1 is not exactly representable but 
2^n-1 is, then
x could be 2^n or 2^n-1).

Haskell mailing list

Reply via email to