| Safe Haskell | Safe |
|---|---|
| Language | Haskell2010 |
Data.Universe.Instances.Extended
Contents
Documentation
Creating an instance of this class is a declaration that your type is
recursively enumerable (and that universe is that enumeration). In
particular, you promise that any finite inhabitant has a finite index in
universe, and that no inhabitant appears at two different finite indices.
Instances
| Universe Void # | |
Defined in Data.Universe.Instances.Extended | |
| (Representable f, Finite (Rep f), Ord (Rep f), Universe a) => Universe (Co f a) # | |
Defined in Data.Universe.Instances.Extended | |
| (Representable f, Finite s, Ord s, Finite (Rep f), Ord (Rep f), Universe a) => Universe (TracedT s f a) # | |
Defined in Data.Universe.Instances.Extended | |
class Universe a => Finite a where #
Creating an instance of this class is a declaration that your universe
eventually ends. Minimal definition: no methods defined. By default,
universeF = universe, but for some types (like Either) the universeF
method may have a more intuitive ordering.
Instances
| Finite Void # | |
Defined in Data.Universe.Instances.Extended | |
| (Representable f, Finite (Rep f), Ord (Rep f), Finite a) => Finite (Co f a) # | |
Defined in Data.Universe.Instances.Extended | |
| (Representable f, Finite s, Ord s, Finite (Rep f), Ord (Rep f), Finite a) => Finite (TracedT s f a) # | |
Defined in Data.Universe.Instances.Extended | |
Orphan instances
| Universe Void # | |
| Finite Void # | |
| (Representable f, Finite (Rep f), Ord (Rep f), Universe a) => Universe (Co f a) # | |
| (Representable f, Finite (Rep f), Ord (Rep f), Finite a) => Finite (Co f a) # | |
| (Representable f, Finite s, Ord s, Finite (Rep f), Ord (Rep f), Universe a) => Universe (TracedT s f a) # | |
| (Representable f, Finite s, Ord s, Finite (Rep f), Ord (Rep f), Finite a) => Finite (TracedT s f a) # | |