|
| Math.Combinatorics.Species.AST |
|
|
| Description |
| A data structure to reify combinatorial species.
|
|
| Synopsis |
|
|
|
| Documentation |
|
| data SpeciesTypedAST s where | Source |
|
Reified combinatorial species. Note that SpeciesTypedAST has a
phantom type parameter which also reflects the structure, so we
can do case analysis on species at both the value and type level.
Of course, the non-uniform type parameter means that
SpeciesTypedAST cannot be an instance of the Species class;
for that purpose the existential wrapper SpeciesAST is
provided.
| | Constructors | |  Instances | |
|
|
|
| An existential wrapper to hide the phantom type parameter to
SpeciesTypedAST, so we can make it an instance of Species.
| | Constructors | | | Instances | |
|
|
|
| needsZT is a predicate which checks whether a species uses any
of the operations which are not supported directly by ordinary
generating functions (composition, differentiation, cartesian
product, and functor composition), and hence need cycle index
series.
|
|
|
| A version of needsZT for SpeciesAST.
|
|
|
Reify a species expression into an AST. Of course, this is just
the identity function with a usefully restricted type. For
example:
> reify octopus
C . L+
> reify (ksubset 3)
E3 * E
|
|
|
| Reflect an AST back into any instance of the Species class.
|
|
|
| Reflect an AST back into any instance of the Species class.
|
|
| Produced by Haddock version 2.6.0 |
