Safe Haskell | None |
---|---|
Language | Haskell2010 |
This module contains an example used by the test suite.
Data Types
Eq Bert Source # | |
Show Bert Source # | |
Generic Bert Source # | |
NFData Bert Source # | |
Recursive Bert Source # | |
Corecursive Bert Source # | |
Dummy Bert Source # | |
SubType Bert Source # | |
(Functor ErnieF, Functor BertF) => SubHom ErnieF BertF Ernie Bert Source # | |
(Functor BertF, Functor ErnieF) => SubHom BertF ErnieF Bert Ernie Source # | |
type Rep Bert Source # | |
type Base Bert Source # | |
Eq Ernie Source # | |
Show Ernie Source # | |
Generic Ernie Source # | |
NFData Ernie Source # | |
Recursive Ernie Source # | |
Corecursive Ernie Source # | |
Dummy Ernie Source # | |
SubType Ernie Source # | |
(Functor ErnieF, Functor BertF) => SubHom ErnieF BertF Ernie Bert Source # | |
(Functor BertF, Functor ErnieF) => SubHom BertF ErnieF Bert Ernie Source # | |
type Rep Ernie Source # | |
type Base Ernie Source # | |
Catamorphisms
collapseErnieSyntaxTree :: Recursive Ernie => Ernie -> Ernie Source #
Dendromorphism collapsing the tree. Note that we can use the same F-algebras here as we would in a normal catamorphism.
collapseErnieSyntaxTree' :: Recursive Ernie => Ernie -> Ernie Source #
Catamorphism, which collapses the tree the usual way.