semirings-0.2.0.0: two monoids as one, in holy haskimony
Data.Semiring.Free
newtype Free a Source #
Constructors
Fields
Defined in Data.Semiring.Free
Methods
(==) :: Free a -> Free a -> Bool #
(/=) :: Free a -> Free a -> Bool #
compare :: Free a -> Free a -> Ordering #
(<) :: Free a -> Free a -> Bool #
(<=) :: Free a -> Free a -> Bool #
(>) :: Free a -> Free a -> Bool #
(>=) :: Free a -> Free a -> Bool #
max :: Free a -> Free a -> Free a #
min :: Free a -> Free a -> Free a #
readsPrec :: Int -> ReadS (Free a) #
readList :: ReadS [Free a] #
readPrec :: ReadPrec (Free a) #
readListPrec :: ReadPrec [Free a] #
showsPrec :: Int -> Free a -> ShowS #
show :: Free a -> String #
showList :: [Free a] -> ShowS #
plus :: Free a -> Free a -> Free a Source #
zero :: Free a Source #
times :: Free a -> Free a -> Free a Source #
one :: Free a Source #
runFree :: Semiring s => (a -> s) -> Free a -> s Source #
lowerFree :: Semiring s => Free s -> s Source #
liftFree :: a -> Free a Source #