Safe Haskell	None
Language	Haskell2010

Data.Semiring.Free

Description

The Free semiring.

Synopsis

newtype Free a = Free {
- getFree :: Map (Seq a) Natural
}
liftFree :: a -> Free a
lowerFree :: Semiring s => Free s -> s
runFree :: Semiring s => (a -> s) -> Free a -> s

Documentation

newtype Free a Source #

The free semiring

Constructors

Free
Fields getFree :: Map (Seq a) Natural

Instances

Foldable Free Source #
Instance details Defined in Data.Semiring.Free Methods fold :: Monoid m => Free m -> m # foldMap :: Monoid m => (a -> m) -> Free a -> m # foldr :: (a -> b -> b) -> b -> Free a -> b # foldr' :: (a -> b -> b) -> b -> Free a -> b # foldl :: (b -> a -> b) -> b -> Free a -> b # foldl' :: (b -> a -> b) -> b -> Free a -> b # foldr1 :: (a -> a -> a) -> Free a -> a # foldl1 :: (a -> a -> a) -> Free a -> a # toList :: Free a -> [a] # null :: Free a -> Bool # length :: Free a -> Int # elem :: Eq a => a -> Free a -> Bool # maximum :: Ord a => Free a -> a # minimum :: Ord a => Free a -> a # sum :: Num a => Free a -> a # product :: Num a => Free a -> a #
Eq a => Eq (Free a) Source #
Instance details Defined in Data.Semiring.Free Methods (==) :: Free a -> Free a -> Bool # (/=) :: Free a -> Free a -> Bool #
Ord a => Num (Free a) Source #
Instance details Defined in Data.Semiring.Free Methods (+) :: Free a -> Free a -> Free a # (-) :: Free a -> Free a -> Free a # (*) :: Free a -> Free a -> Free a # negate :: Free a -> Free a # abs :: Free a -> Free a # signum :: Free a -> Free a # fromInteger :: Integer -> Free a #
Ord a => Ord (Free a) Source #
Instance details Defined in Data.Semiring.Free Methods 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 #
(Ord a, Read a) => Read (Free a) Source #
Instance details Defined in Data.Semiring.Free Methods readsPrec :: Int -> ReadS (Free a) # readList :: ReadS [Free a] # readPrec :: ReadPrec (Free a) # readListPrec :: ReadPrec [Free a] #
Show a => Show (Free a) Source #
Instance details Defined in Data.Semiring.Free Methods showsPrec :: Int -> Free a -> ShowS # show :: Free a -> String # showList :: [Free a] -> ShowS #
Ord a => Semiring (Free a) Source #
Instance details Defined in Data.Semiring.Free Methods zero :: Free a Source # one :: Free a Source # (<.>) :: Free a -> Free a -> Free a Source # (<+>) :: Free a -> Free a -> Free a Source # add :: [Free a] -> Free a Source # mul :: [Free a] -> Free a Source #

liftFree :: a -> Free a Source #

Create a Free with one item.

lowerFree :: Semiring s => Free s -> s Source #

Run a Free, interpreting it in the underlying semiring.

runFree :: Semiring s => (a -> s) -> Free a -> s Source #

Run a Free.