-- Hoogle documentation, generated by Haddock
-- See Hoogle, http://www.haskell.org/hoogle/


-- | Lists with fair choice
--   
--   Lists with fair choice
@package fair
@version 0.1.0.0

module Data.List.Fair
newtype Fair a
Fair :: [a] -> Fair a
[unFair] :: Fair a -> [a]
instance Data.Functor.Classes.Show1 Data.List.Fair.Fair
instance Data.Functor.Classes.Read1 Data.List.Fair.Fair
instance Data.Functor.Classes.Ord1 Data.List.Fair.Fair
instance Data.Functor.Classes.Eq1 Data.List.Fair.Fair
instance GHC.Show.Show a => GHC.Show.Show (Data.List.Fair.Fair a)
instance GHC.Read.Read a => GHC.Read.Read (Data.List.Fair.Fair a)
instance GHC.Classes.Ord a => GHC.Classes.Ord (Data.List.Fair.Fair a)
instance GHC.Classes.Eq a => GHC.Classes.Eq (Data.List.Fair.Fair a)
instance Data.Traversable.Traversable Data.List.Fair.Fair
instance Data.Foldable.Foldable Data.List.Fair.Fair
instance GHC.Base.Functor Data.List.Fair.Fair
instance GHC.Base.Applicative Data.List.Fair.Fair
instance GHC.Base.Monad Data.List.Fair.Fair
instance GHC.Base.Semigroup a => GHC.Base.Semigroup (Data.List.Fair.Fair a)
instance GHC.Base.Monoid a => GHC.Base.Monoid (Data.List.Fair.Fair a)