Ideas.Common.Derivation

Datatype for representing a derivation (parameterized both in the terms and the steps)

Data type

data Derivation s a

Instances

BiFunctor Derivation

Methods

biMap :: (a -> c) -> (b -> d) -> Derivation a b -> Derivation c d

mapFirst :: (a -> b) -> Derivation a c -> Derivation b c

mapSecond :: (b -> c) -> Derivation a b -> Derivation a c

Functor (Derivation s)

Methods

fmap :: (a -> b) -> Derivation s a -> Derivation s b

(<$) :: a -> Derivation s b -> Derivation s a

(Show s, Show a) => Show (Derivation s a)

Methods

showsPrec :: Int -> Derivation s a -> ShowS

show :: Derivation s a -> String

showList :: [Derivation s a] -> ShowS

Constructing a derivation

emptyDerivation :: a -> Derivation s a

prepend :: (a, s) -> Derivation s a -> Derivation s a

extend :: Derivation s a -> (s, a) -> Derivation s a

Querying a derivation

isEmpty :: Derivation s a -> Bool

Tests whether the derivation is empty

derivationLength :: Derivation s a -> Int

Returns the number of steps in a derivation

terms :: Derivation s a -> [a]

All terms in a derivation

steps :: Derivation s a -> [s]

All steps in a derivation

triples :: Derivation s a -> [(a, s, a)]

The triples of a derivation, consisting of the before term, the step, and the after term.

firstTerm :: Derivation s a -> a

lastTerm :: Derivation s a -> a

lastStep :: Derivation s a -> Maybe s

withoutLast :: Derivation s a -> Derivation s a

updateSteps :: (a -> s -> a -> t) -> Derivation s a -> Derivation t a

derivationM :: Monad m => (s -> m ()) -> (a -> m ()) -> Derivation s a -> m ()

Apply a monadic function to each term, and to each step