Portability | unknown |
---|---|

Stability | alpha |

Maintainer | divip@aszt.inf.elte.hu |

*If the Haddock documentation is unreadable, look the source.*

This module adds unicode notation for some definitions in Prelude.

The following notations are built in GHC (enabled with the `UnicodeSyntax`

language extension):

- '' ('\x2192') is equivalent to '->'.
- '' ('\x2190') is equivalent to '<-'.
- '' ('\x2237') is equivalent to '::'.
- '' ('\x21d2') is equivalent to '=>'.
- '' ('\x2200') is equivalent to
`forall`

(use the`Rank2Types`

language extension).

The following notations are *not* built in GHC
(see also http://hackage.haskell.org/trac/haskell-prime/wiki/UnicodeInHaskellSource):

- '' ('\x2025') is equivalent to '..'.
- '' ('\x2203') is equivalent to
`exists`

(with`ExistentialQuantification`

).

Usage examples

even succ Integral a a Bool

25 [xx | x[1..10], x2] Bool

foldl (flip (:)) () [a] [a]

(\a a a a) a a : a : a

(\a b ()(a b) ()a ()b) Bool Bool Bool

- type :× a b = (a, b)
- (×) :: a -> b -> a :× b
- (¬) :: Bool -> Bool
- (∧) :: Bool -> Bool -> Bool
- (∨) :: Bool -> Bool -> Bool
- (⇔) :: Bool -> Bool -> Bool
- (≡) :: Eq a => a -> a -> Bool
- (≠) :: Eq a => a -> a -> Bool
- (≢) :: Eq a => a -> a -> Bool
- (≤) :: Ord a => a -> a -> Bool
- (≥) :: Ord a => a -> a -> Bool
- (≮) :: Ord a => a -> a -> Bool
- (≯) :: Ord a => a -> a -> Bool
- π :: Floating a => a
- (÷) :: Fractional a => a -> a -> a
- (⋅) :: Num a => a -> a -> a
- (◦) :: (b -> c) -> (a -> b) -> a -> c
- (∅) :: [a]
- (∈) :: Eq a => a -> [a] -> Bool
- (∉) :: Eq a => a -> [a] -> Bool
- (⊥) :: a

# Data structures

# Boolean functions and operators

# Comparisons

# Numbers

(÷) :: Fractional a => a -> a -> aSource

Division.