(\x y z -> (x == y) == z) :: Eq a => a -> a -> Bool -> Bool
(\x y z -> x == (y == z)) :: Eq a => Bool -> a -> a -> Bool
Hi,
infixr seeems right for an equivalence (==) since implication is usually
also right associative.
Implication "==>" corresponds to "<=" on Bool, which might be confusing.
Reverse implication (>=) should be left associative, then.
Cheers Christian
Am 17.09.2018 um 11:28 schrieb Dannyu NDos:
> Well, infixr is friendlier to parsers.
>
> 2018년 9월 17일 (월) 오후 6:22, David Feuer <david.feuer@gmail.com
> <mailto:david.feuer@gmail.com>>님이 작성:
>
> Looks good to me! Do you have an opinion about infixl vs infixr?
>
> Libraries mailing list
> Libraries@haskell.org <mailto:Libraries@haskell.org>
> http://mail.haskell.org/cgi-bin/mailman/listinfo/libraries
>
>
>
> _______________________________________________
> Libraries mailing list
> Libraries@haskell.org
> http://mail.haskell.org/cgi-bin/mailman/listinfo/libraries
>
_______________________________________________
Libraries mailing list
Libraries@haskell.org
http://mail.haskell.org/cgi-bin/mailman/listinfo/libraries