Data.FTree.BottomUp

Top-down, depth-typed functor trees. In other words, right-associated n-ary functor composition. See http://conal.net/blog/posts/a-trie-for-length-typed-vectors/.

Documentation

data T :: (* -> *) -> * -> * -> * where

Constructors

L :: a -> T f Z a

B :: IsNat n => T f n (f a) -> T f (S n) a

Instances

Functor f => Functor ((:^) f n)

(IsNat n, Applicative f) => Applicative ((:^) f n)

(Functor f, Foldable f) => Foldable ((:^) f n)

Traversable f => Traversable ((:^) f n)

(Functor f, ShowF f) => ShowF ((:^) f n)

(Foldable f, Applicative f, IsNat n, Eq a) => Eq ((:^) f n a)

(Foldable f, Applicative f, IsNat n, Ord a) => Ord ((:^) f n a)

(Functor f, ShowF f, Show a) => Show ((:^) f n a)

(IsNat n, Applicative f, Monoid m) => Monoid ((:^) f n m)

type (:^) = T

unL :: (f :^ Z) a -> a

unB :: (f :^ S n) a -> (f :^ n) (f a)

foldT :: forall f n a z. Functor f => (a -> z) -> (f a -> a) -> (f :^ n) a -> z

inT :: (a -> b) -> (forall n. IsNat n => (f :^ n) (f a) -> (f :^ n) (f b)) -> forall n. (f :^ n) a -> (f :^ n) b

inT2 :: (a -> b -> c) -> (forall n. IsNat n => (f :^ n) (f a) -> (f :^ n) (f b) -> (f :^ n) (f c)) -> forall n. (f :^ n) a -> (f :^ n) b -> (f :^ n) c

inL :: (a -> b) -> (f :^ Z) a -> (f :^ Z) b

inB :: ((f :^ n) (f a) -> (f :^ n) (f b)) -> (f :^ S n) a -> (f :^ S n) b

inL2 :: (a -> b -> c) -> (f :^ Z) a -> (f :^ Z) b -> (f :^ Z) c

inB2 :: ((f :^ n) (f a) -> (f :^ n) (f b) -> (f :^ n) (f c)) -> (f :^ S n) a -> (f :^ S n) b -> (f :^ S n) c