constrained-dynamic-0.1.0.0: Dynamic typing with retained constraints

Safe HaskellNone
LanguageHaskell2010

Data.Type.HasClassPreludeInstances

Contents

Description

Provides instances of the type class HasClass for common single-parameter type classes contained in the Prelude. Note that instances for tuple types are *not* currently included due to the very large number of somewhat complex classes that would be required.

Documentation

Orphan instances

HasClass * Bounded Bool True Source # 
HasClass * Bounded Char True Source # 
HasClass * Bounded Int True Source # 
HasClass * Bounded Ordering True Source # 
HasClass * Bounded Word True Source # 
HasClass * Enum Bool True Source # 
HasClass * Enum Char True Source # 
HasClass * Enum Double True Source # 
HasClass * Enum Float True Source # 
HasClass * Enum Int True Source # 
HasClass * Enum Integer True Source # 
HasClass * Enum Ordering True Source # 
HasClass * Enum Word True Source # 
HasClass * Enum () True Source # 
HasClass * Eq Bool True Source # 
HasClass * Eq Char True Source # 
HasClass * Eq Double True Source # 
HasClass * Eq Float True Source # 
HasClass * Eq Int True Source # 
HasClass * Eq Ordering True Source # 
HasClass * Eq Word True Source # 
HasClass * Floating Double True Source # 
HasClass * Floating Float True Source # 
HasClass * Fractional Double True Source # 
HasClass * Fractional Float True Source # 
HasClass * Integral Int True Source # 
HasClass * Integral Integer True Source # 
HasClass * Integral Word True Source # 
HasClass * Num Double True Source # 
HasClass * Num Float True Source # 
HasClass * Num Int True Source # 
HasClass * Num Integer True Source # 
HasClass * Num Word True Source # 
HasClass * Ord Bool True Source # 
HasClass * Ord Char True Source # 
HasClass * Ord Double True Source # 
HasClass * Ord Float True Source # 
HasClass * Ord Int True Source # 
HasClass * Ord Integer True Source # 
HasClass * Ord Ordering True Source # 
HasClass * Ord Word True Source # 
HasClass * Read Bool True Source # 
HasClass * Read Char True Source # 
HasClass * Read Double True Source # 
HasClass * Read Float True Source # 
HasClass * Read Int True Source # 
HasClass * Read Integer True Source # 
HasClass * Read Ordering True Source # 
HasClass * Read Word True Source # 
HasClass * Real Double True Source # 
HasClass * Real Float True Source # 
HasClass * Real Int True Source # 
HasClass * Real Integer True Source # 
HasClass * Real Word True Source # 
HasClass * RealFloat Double True Source # 
HasClass * RealFloat Float True Source # 
HasClass * RealFrac Double True Source # 
HasClass * RealFrac Float True Source # 
HasClass * Show Bool True Source # 
HasClass * Show Char True Source # 
HasClass * Show Double True Source # 
HasClass * Show Float True Source # 
HasClass * Show Int True Source # 
HasClass * Show Integer True Source # 
HasClass * Show Ordering True Source # 
HasClass * Show Word True Source # 
HasClass * Monoid Ordering True Source # 
HasClass * Eq a f1 => HasClass * Eq [a] f1 Source # 

Methods

classDict :: Proxy (Eq -> Constraint) [a] -> Proxy Eq f1 -> Proxy Bool b -> TDict Eq [a] f1 Source #

HasClass * Eq a f1 => HasClass * Eq (Maybe a) f1 Source # 

Methods

classDict :: Proxy (Eq -> Constraint) (Maybe a) -> Proxy Eq f1 -> Proxy Bool b -> TDict Eq (Maybe a) f1 Source #

HasClass * Ord a f1 => HasClass * Ord [a] f1 Source # 

Methods

classDict :: Proxy (Ord -> Constraint) [a] -> Proxy Ord f1 -> Proxy Bool b -> TDict Ord [a] f1 Source #

HasClass * Ord a f1 => HasClass * Ord (Maybe a) f1 Source # 

Methods

classDict :: Proxy (Ord -> Constraint) (Maybe a) -> Proxy Ord f1 -> Proxy Bool b -> TDict Ord (Maybe a) f1 Source #

HasClass * Read a f1 => HasClass * Read [a] f1 Source # 

Methods

classDict :: Proxy (Read -> Constraint) [a] -> Proxy Read f1 -> Proxy Bool b -> TDict Read [a] f1 Source #

HasClass * Read a f1 => HasClass * Read (Maybe a) f1 Source # 

Methods

classDict :: Proxy (Read -> Constraint) (Maybe a) -> Proxy Read f1 -> Proxy Bool b -> TDict Read (Maybe a) f1 Source #

HasClass * Show a f1 => HasClass * Show [a] f1 Source # 

Methods

classDict :: Proxy (Show -> Constraint) [a] -> Proxy Show f1 -> Proxy Bool b -> TDict Show [a] f1 Source #

HasClass * Show a f1 => HasClass * Show (Maybe a) f1 Source # 

Methods

classDict :: Proxy (Show -> Constraint) (Maybe a) -> Proxy Show f1 -> Proxy Bool b -> TDict Show (Maybe a) f1 Source #

HasClass * Monoid [a] True Source # 
HasClass * Monoid a f1 => HasClass * Monoid (Maybe a) f1 Source # 

Methods

classDict :: Proxy (Monoid -> Constraint) (Maybe a) -> Proxy Monoid f1 -> Proxy Bool b -> TDict Monoid (Maybe a) f1 Source #

(HasClass * Eq a f1, HasClass * Eq b f2, And f1 f2 f3) => HasClass * Eq (Either a b) f3 Source # 

Methods

classDict :: Proxy (Eq -> Constraint) (Either a b) -> Proxy Eq f3 -> Proxy Bool b -> TDict Eq (Either a b) f3 Source #

(HasClass * Ord a f1, HasClass * Ord b f2, And f1 f2 f3) => HasClass * Ord (Either a b) f3 Source # 

Methods

classDict :: Proxy (Ord -> Constraint) (Either a b) -> Proxy Ord f3 -> Proxy Bool b -> TDict Ord (Either a b) f3 Source #

(HasClass * Read a f1, HasClass * Read b f2, And f1 f2 f3) => HasClass * Read (Either a b) f3 Source # 

Methods

classDict :: Proxy (Read -> Constraint) (Either a b) -> Proxy Read f3 -> Proxy Bool b -> TDict Read (Either a b) f3 Source #

(HasClass * Show a f1, HasClass * Show b f2, And f1 f2 f3) => HasClass * Show (Either a b) f3 Source # 

Methods

classDict :: Proxy (Show -> Constraint) (Either a b) -> Proxy Show f3 -> Proxy Bool b -> TDict Show (Either a b) f3 Source #

HasClass * Monoid b f1 => HasClass * Monoid (a -> b) f1 Source # 

Methods

classDict :: Proxy (Monoid -> Constraint) (a -> b) -> Proxy Monoid f1 -> Proxy Bool b -> TDict Monoid (a -> b) f1 Source #