(¬) :: Bool → Bool<br>(¬) q = not q<br><br>q = True<br>¬ q : parser error on input<br>q ¬ : parser error (possibly incorrect indentation)<br>(¬ q) : Couldn't match expected type `Bool -> t' against inferred type `Bool' In the expression: (� True) In the definition of `it': it = (� True) *
<br>(q ¬) : False<br><br>(Why) is it not possible to define a (non-infix) function whose name consists of a single non-alphabetical mathematical symbol?<br><br>¬ :: Bool → Bool -- parser error on input **<br>¬ q = not q -- parser error on input **
<br><br>Cetin Sert<br>