Countable, Searchable, Finite, Empty classes

Version on this page:1.0
LTS Haskell 13.25:1.0
Stackage Nightly 2019-06-12:1.0
Latest on Hackage:1.0

See all snapshots countable appears in

BSD-3-Clause licensed and maintained by Ashley Yakeley

Module documentation for 1.0

  • class Countable, for countable types

  • class AtLeastOneCountable, for countable types that have at least one value

  • class InfiniteCountable, for infinite countable types

  • class Searchable, for types that can be searched over. This turns out to include some infinite types, see

  • class Finite, for finite types

  • class Empty, for empty types

  • data Nothing, an empty type

Some orphan instances:

  • (Searchable a,Eq b) => Eq (a -> b)

  • (Finite t) => Foldable ((->) t)

  • (Finite a) => Traversable ((->) a)

  • (Show a,Finite a,Show b) => Show (a -> b)

Depends on 1 package:
Used by 1 package:
comments powered byDisqus