{-

instances:

(Num Int, (inst__Prelude_Num_Int, []))

(Num Integer, (inst__Prelude_Num_Integer, []))

(Num Rational, (inst__Prelude_Num_Rational, []))

(Num Double, (inst__Prelude_Num_Double, []))

(Eq Int, (inst__Prelude_Eq_Int, []))

(Ord Int, (inst__Prelude_Ord_Int, []))

(Enum Int, (inst__Prelude_Enum_Int, []))

(Eq Char, (inst__Prelude_Eq_Char, []))

(Eq Integer, (inst__Prelude_Eq_Integer, []))

(Eq Rational, (inst__Prelude_Eq_Rational, []))

(Eq Double, (inst__Prelude_Eq_Double, []))

(Ord Char, (inst__Prelude_Ord_Char, []))

(Ord Integer, (inst__Prelude_Ord_Integer, []))

(Ord Rational, (inst__Prelude_Ord_Rational, []))

(Ord Double, (inst__Prelude_Ord_Double, []))

(Show Int, (inst__Prelude_Show_Int, []))

(Show Char, (inst__Prelude_Show_Char, []))

(Show Integer, (inst__Prelude_Show_Integer, []))

(Show Rational, (inst__Prelude_Show_Rational, []))

(Show Double, (inst__Prelude_Show_Double, []))

(Fractional Rational, (inst__Prelude_Fractional_Rational, []))

(Fractional Double, (inst__Prelude_Fractional_Double, []))

(Show (Copy a), (inst__Prelude_Show__l_Copy_a_r_, []))

(Eq Bool, (derived__Prelude_Eq_Bool, []))

(Ord Bool, (derived__Prelude_Ord_Bool, []))

(Show Bool, (derived__Prelude_Show_Bool, []))

(Eq Ordering, (derived__Prelude_Eq_Ordering, []))

(Ord Ordering, (derived__Prelude_Ord_Ordering, []))

(Show Ordering, (derived__Prelude_Show_Ordering, []))

(Eq [a], (derived__Prelude_Eq_34_65, [Eq a]))

(Ord [a], (derived__Prelude_Ord_34_69, [Ord a]))

(Show [a], (derived__Prelude_Show_34_59, [Show a]))

(Eq (), (derived__Prelude_Eq_184_27, []))

(Ord (), (derived__Prelude_Ord_184_31, []))

(Show (), (derived__Prelude_Show_184_36, []))

(Eq (a, b), (derived__Prelude_Eq_188_20, [Eq a,

Eq b]))

(Ord (a, b), (derived__Prelude_Ord_188_24, [Ord a,

Ord b]))

(Show (a, b), (derived__Prelude_Show_188_14, [Show a,

Show b]))

(Eq (a, b, c), (derived__Prelude_Eq_192_20, [Eq a,

Eq b, Eq c]))

(Ord (a, b, c), (derived__Prelude_Ord_192_24, [Ord a,

Ord b, Ord c]))

(Show (a, b,

c), (derived__Prelude_Show_192_14, [Show a, Show b,

Show c]))

(Eq (a, b, c, d), (derived__Prelude_Eq_196_20, [Eq a,

Eq b, Eq c, Eq d]))

(Ord (a, b, c,

d), (derived__Prelude_Ord_196_24, [Ord a, Ord b,

Ord c, Ord d]))

(Show (a, b, c,

d), (derived__Prelude_Show_196_14, [Show a, Show b,

Show c, Show d]))

types:

() :: (*, data)

(,) :: (*->*->*, data)

Prelude.(,,) :: (*->*->*->*, data)

Prelude.(,,,) :: (*->*->*->*->*, data)

((->)) :: (*->*->*, data)

B :: ((*->*)->*, data)

Bool :: (*, data)

Bounded ::

(*->Pred, class _ a

where

minBound :: a

maxBound :: a)

C :: ((*->*)->*, data)

Char :: (*, data)

Copy :: (*->*, newtype)

Double :: (*, data)

Enum ::

(*->Pred, class _ a

where

succ :: a -> a

pred :: a -> a

toEnum :: Int -> a

fromEnum :: a -> Int

enumFrom :: a -> [a]

enumFromThen :: a -> a -> [a]

enumFromTo :: a -> a -> [a]

enumFromThenTo :: a -> a -> a -> [a])

Eq ::

(*->Pred, class _ a

where

(==) :: a -> a -> Bool

(/=) :: a -> a -> Bool)

Fractional ::

(*->Pred, class Num a => _ a

where

(/) :: a -> a -> a

recip :: a -> a

fromRational :: Rational -> a)

Int :: (*, data)

Integer :: (*, data)

Integral ::

(*->Pred, class (Real a, Enum a) => _ a

where

quot :: a -> a -> a

rem :: a -> a -> a

div :: a -> a -> a

mod :: a -> a -> a

quotRem :: a -> a -> (a, a)

divMod :: a -> a -> (a, a)

toInteger :: a -> Integer)

Num ::

(*->Pred, class (Eq a, Show a) => _ a

where

(+) :: a -> a -> a

(-) :: a -> a -> a

(*) :: a -> a -> a

negate :: a -> a

abs :: a -> a

signum :: a -> a

fromInteger :: Integer -> a)

Ord ::

(*->Pred, class Eq a => _ a

where

compare :: a -> a -> Ordering

(<) :: a -> a -> Bool

(<=) :: a -> a -> Bool

(>=) :: a -> a -> Bool

(>) :: a -> a -> Bool

max :: a -> a -> a

min :: a -> a -> a)

Ordering :: (*, data)

Rational :: (*, data)

Real ::

(*->Pred, class (Num a, Ord a) => _ a

where

toRational :: a -> Rational)

RealFrac ::

(*->Pred, class (Real a, Fractional a) => _ a

where

properFraction ::

forall a . (Integral a) => a -> (a, a)

truncate :: forall a . (Integral a) => a -> a

round :: forall a . (Integral a) => a -> a

ceiling :: forall a . (Integral a) => a -> a

floor :: forall a . (Integral a) => a -> a)

Show ::

(*->Pred, class _ a

where

showsPrec :: Int -> a -> ShowS

show :: a -> String

showList :: [a] -> ShowS)

ShowS :: (*, type _ = String -> String)

Sport :: ((*->*)->*, data)

String :: (*, type _ = String)

Wonky :: ((*->*)->*, data)

[] :: (*->*, data)

values:

($--*) :: forall a . (Num a) => a -> a -> a

($--+) :: forall a . (Num a) => a -> a -> a

($---) :: forall a . (Num a) => a -> a -> a

($--/) :: forall a . (Fractional a) => a -> a -> a

($--/=) :: forall a . (Eq a) => a -> a -> Bool

($--<) :: forall a . (Ord a) => a -> a -> Bool

($--<=) :: forall a . (Ord a) => a -> a -> Bool

($--==) :: forall a . (Eq a) => a -> a -> Bool

($-->) :: forall a . (Ord a) => a -> a -> Bool

($-->=) :: forall a . (Ord a) => a -> a -> Bool

(&&) :: Bool -> Bool -> Bool

(*) :: forall a . (Num a) => a -> a -> a

(+) :: forall a . (Num a) => a -> a -> a

(++) :: forall a . [a] -> [a] -> [a]

(-) :: forall a . (Num a) => a -> a -> a

(.) :: forall a b c . (a -> b) -> (c -> a) -> c -> b

(/) :: forall a . (Fractional a) => a -> a -> a

(/=) :: forall a . (Eq a) => a -> a -> Bool

(<) :: forall a . (Ord a) => a -> a -> Bool

(<=) :: forall a . (Ord a) => a -> a -> Bool

(==) :: forall a . (Eq a) => a -> a -> Bool

(>) :: forall a . (Ord a) => a -> a -> Bool

(>=) :: forall a . (Ord a) => a -> a -> Bool

abs :: forall a . (Num a) => a -> a

ceiling ::

forall a b . (RealFrac a, Integral b) => a -> b

compare :: forall a . (Ord a) => a -> a -> Ordering

default__abs :: forall a . (Num a) => a -> a

default__ceiling ::

forall a b . (RealFrac a, Integral b) => a -> b

default__compare ::

forall a . (Ord a) => a -> a -> Ordering

default__div ::

forall a . (Integral a) => a -> a -> a

default__divMod ::

forall a . (Integral a) => a -> a -> (a, a)

default__enumFrom :: forall a . (Enum a) => a -> [a]

default__enumFromThen ::

forall a . (Enum a) => a -> a -> [a]

default__enumFromThenTo ::

forall a . (Enum a) => a -> a -> a -> [a]

default__enumFromTo ::

forall a . (Enum a) => a -> a -> [a]

default__floor ::

forall a b . (RealFrac a, Integral b) => a -> b

default__fromEnum :: forall a . (Enum a) => a -> Int

default__fromInteger ::

forall a . (Num a) => Integer -> a

default__fromRational ::

forall a . (Fractional a) => Rational -> a

default__max :: forall a . (Ord a) => a -> a -> a

default__maxBound :: forall a . (Bounded a) => a

default__min :: forall a . (Ord a) => a -> a -> a

default__minBound :: forall a . (Bounded a) => a

default__mod ::

forall a . (Integral a) => a -> a -> a

default__negate :: forall a . (Num a) => a -> a

default__pred :: forall a . (Enum a) => a -> a

default__properFraction ::

forall a b . (RealFrac a, Integral b) => a -> (b, a)

default__quot ::

forall a . (Integral a) => a -> a -> a

default__quotRem ::

forall a . (Integral a) => a -> a -> (a, a)

default__recip :: forall a . (Fractional a) => a -> a

default__rem ::

forall a . (Integral a) => a -> a -> a

default__round ::

forall a b . (RealFrac a, Integral b) => a -> b

default__show :: forall a . (Show a) => a -> String

default__showList ::

forall a . (Show a) => [a] -> ShowS

default__showsPrec ::

forall a . (Show a) => Int -> a -> ShowS

default__signum :: forall a . (Num a) => a -> a

default__succ :: forall a . (Enum a) => a -> a

default__toEnum :: forall a . (Enum a) => Int -> a

default__toInteger ::

forall a . (Integral a) => a -> Integer

default__toRational ::

forall a . (Real a) => a -> Rational

default__truncate ::

forall a b . (RealFrac a, Integral b) => a -> b

derived__Prelude_Eq_184_27 :: Eq ()

derived__Prelude_Eq_188_20 ::

forall a b . (Eq a) -> (Eq b) -> Eq (a, b)

derived__Prelude_Eq_192_20 ::

forall a b c .

(Eq a) -> (Eq b) -> (Eq c) -> Eq (a, b, c)

derived__Prelude_Eq_196_20 ::

forall a b c d .

(Eq a) ->

(Eq b) -> (Eq c) -> (Eq d) -> Eq (a, b, c, d)

derived__Prelude_Eq_34_65 ::

forall a . (Eq a) -> Eq [a]

derived__Prelude_Eq_Bool :: Eq Bool

derived__Prelude_Eq_Ordering :: Eq Ordering

derived__Prelude_Ord_184_31 :: Ord ()

derived__Prelude_Ord_188_24 ::

forall a b . (Ord a) -> (Ord b) -> Ord (a, b)

derived__Prelude_Ord_192_24 ::

forall a b c .

(Ord a) -> (Ord b) -> (Ord c) -> Ord (a, b, c)

derived__Prelude_Ord_196_24 ::

forall a b c d .

(Ord a) ->

(Ord b) -> (Ord c) -> (Ord d) -> Ord (a, b, c, d)

derived__Prelude_Ord_34_69 ::

forall a . (Ord a) -> Ord [a]

derived__Prelude_Ord_Bool :: Ord Bool

derived__Prelude_Ord_Ordering :: Ord Ordering

derived__Prelude_Show_184_36 :: Show ()

derived__Prelude_Show_188_14 ::

forall a b . (Show a) -> (Show b) -> Show (a, b)

derived__Prelude_Show_192_14 ::

forall a b c .

(Show a) -> (Show b) -> (Show c) -> Show (a, b, c)

derived__Prelude_Show_196_14 ::

forall a b c d .

(Show a) ->

(Show b) -> (Show c) -> (Show d) -> Show (a, b, c, d)

derived__Prelude_Show_34_59 ::

forall a . (Show a) -> Show [a]

derived__Prelude_Show_Bool :: Show Bool

derived__Prelude_Show_Ordering :: Show Ordering

div :: forall a . (Integral a) => a -> a -> a

divMod :: forall a . (Integral a) => a -> a -> (a, a)

enumFrom :: forall a . (Enum a) => a -> [a]

enumFromThen :: forall a . (Enum a) => a -> a -> [a]

enumFromThenTo ::

forall a . (Enum a) => a -> a -> a -> [a]

enumFromTo :: forall a . (Enum a) => a -> a -> [a]

error :: forall a . String -> a

even :: forall a . (Integral a) => a -> Bool

flip :: forall a b c . (a -> b -> c) -> b -> a -> c

floor ::

forall a b . (RealFrac a, Integral b) => a -> b

fromEnum :: forall a . (Enum a) => a -> Int

fromInteger :: forall a . (Num a) => Integer -> a

fromIntegral ::

forall a b . (Integral a, Num b) => a -> b

fromRational ::

forall a . (Fractional a) => Rational -> a

head :: forall a . [a] -> a

inst__Prelude_Enum_Int :: Enum Int

inst__Prelude_Eq_Char :: Eq Char

inst__Prelude_Eq_Double :: Eq Double

inst__Prelude_Eq_Int :: Eq Int

inst__Prelude_Eq_Integer :: Eq Integer

inst__Prelude_Eq_Rational :: Eq Rational

inst__Prelude_Fractional_Double :: Fractional Double

inst__Prelude_Fractional_Rational ::

Fractional Rational

inst__Prelude_Num_Double :: Num Double

inst__Prelude_Num_Int :: Num Int

inst__Prelude_Num_Integer :: Num Integer

inst__Prelude_Num_Rational :: Num Rational

inst__Prelude_Ord_Char :: Ord Char

inst__Prelude_Ord_Double :: Ord Double

inst__Prelude_Ord_Int :: Ord Int

inst__Prelude_Ord_Integer :: Ord Integer

inst__Prelude_Ord_Rational :: Ord Rational

inst__Prelude_Show_Char :: Show Char

inst__Prelude_Show_Double :: Show Double

inst__Prelude_Show_Int :: Show Int

inst__Prelude_Show_Integer :: Show Integer

inst__Prelude_Show_Rational :: Show Rational

inst__Prelude_Show__l_Copy_a_r_ ::

forall a . Show (Copy a)

lexOrder :: Ordering -> Ordering -> Ordering

map :: forall a b . (a -> b) -> [a] -> [b]

max :: forall a . (Ord a) => a -> a -> a

maxBound :: forall a . (Bounded a) => a

min :: forall a . (Ord a) => a -> a -> a

minBound :: forall a . (Bounded a) => a

mod :: forall a . (Integral a) => a -> a -> a

negate :: forall a . (Num a) => a -> a

not :: Bool -> Bool

odd :: forall a . (Integral a) => a -> Bool

otherwise :: Bool

pred :: forall a . (Enum a) => a -> a

primError :: forall a . String -> a

properFraction ::

forall a b . (RealFrac a, Integral b) => a -> (b, a)

quot :: forall a . (Integral a) => a -> a -> a

quotRem ::

forall a . (Integral a) => a -> a -> (a, a)

recip :: forall a . (Fractional a) => a -> a

rem :: forall a . (Integral a) => a -> a -> a

round ::

forall a b . (RealFrac a, Integral b) => a -> b

show :: forall a . (Show a) => a -> String

showArgument ::

forall a . (Show a) => a -> String -> String

showChar :: Char -> ShowS

showList :: forall a . (Show a) => [a] -> ShowS

showParen :: Bool -> ShowS -> ShowS

showParenArg :: Int -> ShowS -> ShowS

showString :: String -> ShowS

shows :: forall a . (Show a) => a -> ShowS

showsPrec :: forall a . (Show a) => Int -> a -> ShowS

signum :: forall a . (Num a) => a -> a

subtract :: forall a . (Num a) => a -> a -> a

succ :: forall a . (Enum a) => a -> a

tail :: forall a . [a] -> [a]

toEnum :: forall a . (Enum a) => Int -> a

toInteger :: forall a . (Integral a) => a -> Integer

toRational :: forall a . (Real a) => a -> Rational

truncate ::

forall a b . (RealFrac a, Integral b) => a -> b

() :: ()

(,) :: forall a b . a -> b -> (a, b)

Prelude.(,,) ::

forall a b c . a -> b -> c -> (a, b, c)

Prelude.(,,,) ::

forall a b c d . a -> b -> c -> d -> (a, b, c, d)

(:) :: forall a . a -> [a] -> [a]

Association :: forall (a::*->*) . (a Bool) -> Sport a

Barfoo :: forall (a::*->*) . (a Int) -> B a

C :: forall a . a -> Copy a

EQ :: Ordering

False :: Bool

Foobar :: forall (a::*->*) . (B a) -> C a

Foobar2 :: forall (a::*->*) . (a Int) -> C a

GT :: Ordering

LT :: Ordering

M :: forall (a::*->*) . (a (Wonky a)) -> Wonky a

Sport :: forall (a::*->*) . Sport a

True :: Bool

W :: forall (a::*->*) . Wonky a

[] :: forall a . [a]

scope:

Prelude.&& |-> Prelude.&&, Value

() |-> Prelude.(), Type [()] []

() |-> Prelude.(), con of ()

(,) |-> Prelude.(,), Type [(,)] []

(,) |-> Prelude.(,), con of (,)

Prelude.(,,) |-> Prelude.(,,), Type [(,,)] []

Prelude.(,,) |-> Prelude.(,,), con of (,,)

Prelude.(,,,) |-> Prelude.(,,,), Type [(,,,)] []

Prelude.(,,,) |-> Prelude.(,,,), con of (,,,)

Prelude.* |-> Prelude.*, method of Num

Prelude.+ |-> Prelude.+, method of Num

Prelude.++ |-> Prelude.++, Value

Prelude.- |-> Prelude.-, method of Num

(->) |-> Prelude.->, Type [] []

Prelude.. |-> Prelude.., Value

Prelude./ |-> Prelude./, method of Fractional

Prelude./= |-> Prelude./=, method of Eq

Prelude.: |-> Prelude.:, con of []

Prelude.< |-> Prelude.<, method of Ord

Prelude.<= |-> Prelude.<=, method of Ord

Prelude.== |-> Prelude.==, method of Eq

Prelude.> |-> Prelude.>, method of Ord

Prelude.>= |-> Prelude.>=, method of Ord

Prelude.Association |-> Prelude.Association, con of Sport

Prelude.B |-> Prelude.B, Type [Barfoo] []

Prelude.Barfoo |-> Prelude.Barfoo, con of B

Prelude.Bool |-> Prelude.Bool, Type [False, True] []

Prelude.Bounded |-> Prelude.Bounded, Class [minBound,

maxBound]

Prelude.C |-> Prelude.C, Type [Foobar, Foobar2] []

Prelude.C |-> Prelude.C, con of Copy

Prelude.Char |-> Prelude.Char, Type [] []

Prelude.Copy |-> Prelude.Copy, Type [C] []

Prelude.Double |-> Prelude.Double, Type [] []

Prelude.EQ |-> Prelude.EQ, con of Ordering

Prelude.Enum |-> Prelude.Enum, Class [succ, pred,

toEnum, fromEnum, enumFrom, enumFromThen,

enumFromTo, enumFromThenTo]

Prelude.Eq |-> Prelude.Eq, Class [==, /=]

Prelude.False |-> Prelude.False, con of Bool

Prelude.Foobar |-> Prelude.Foobar, con of C

Prelude.Foobar2 |-> Prelude.Foobar2, con of C

Prelude.Fractional |-> Prelude.Fractional, Class [/,

recip, fromRational]

Prelude.GT |-> Prelude.GT, con of Ordering

Prelude.Int |-> Prelude.Int, Type [] []

Prelude.Integer |-> Prelude.Integer, Type [] []

Prelude.Integral |-> Prelude.Integral, Class [quot,

rem, div, mod, quotRem, divMod,

toInteger]

Prelude.LT |-> Prelude.LT, con of Ordering

Prelude.M |-> Prelude.M, con of Wonky

Prelude.Num |-> Prelude.Num, Class [+, -, *, negate,

abs, signum, fromInteger]

Prelude.Ord |-> Prelude.Ord, Class [compare, <, <=,

>=, >, max, min]

Prelude.Ordering |-> Prelude.Ordering, Type [LT, EQ,

GT] []

Prelude.Rational |-> Prelude.Rational, Type [] []

Prelude.Real |-> Prelude.Real, Class [toRational]

Prelude.RealFrac |-> Prelude.RealFrac, Class [properFraction,

truncate, round, ceiling, floor]

Prelude.Show |-> Prelude.Show, Class [showsPrec,

show, showList]

Prelude.ShowS |-> Prelude.ShowS, Type [] []

Prelude.Sport |-> Prelude.Sport, Type [Sport,

Association] []

Prelude.Sport |-> Prelude.Sport, con of Sport

Prelude.String |-> Prelude.String, Type [] []

Prelude.True |-> Prelude.True, con of Bool

Prelude.W |-> Prelude.W, con of Wonky

Prelude.Wonky |-> Prelude.Wonky, Type [W, M] []

[] |-> Prelude.[], Type [[], :] [head, tail]

[] |-> Prelude.[], con of []

Prelude.abs |-> Prelude.abs, method of Num

Prelude.ceiling |-> Prelude.ceiling, method of RealFrac

Prelude.compare |-> Prelude.compare, method of Ord

Prelude.div |-> Prelude.div, method of Integral

Prelude.divMod |-> Prelude.divMod, method of Integral

Prelude.enumFrom |-> Prelude.enumFrom, method of Enum

Prelude.enumFromThen |-> Prelude.enumFromThen, method of Enum

Prelude.enumFromThenTo |-> Prelude.enumFromThenTo, method of Enum

Prelude.enumFromTo |-> Prelude.enumFromTo, method of Enum

Prelude.error |-> Prelude.error, Value

Prelude.even |-> Prelude.even, Value

Prelude.flip |-> Prelude.flip, Value

Prelude.floor |-> Prelude.floor, method of RealFrac

Prelude.fromEnum |-> Prelude.fromEnum, method of Enum

Prelude.fromInteger |-> Prelude.fromInteger, method of Num

Prelude.fromIntegral |-> Prelude.fromIntegral, Value

Prelude.fromRational |-> Prelude.fromRational, method of Fractional

Prelude.head |-> Prelude.head, field of []

Prelude.lexOrder |-> Prelude.lexOrder, Value

Prelude.map |-> Prelude.map, Value

Prelude.max |-> Prelude.max, method of Ord

Prelude.maxBound |-> Prelude.maxBound, method of Bounded

Prelude.min |-> Prelude.min, method of Ord

Prelude.minBound |-> Prelude.minBound, method of Bounded

Prelude.mod |-> Prelude.mod, method of Integral

Prelude.negate |-> Prelude.negate, method of Num

Prelude.not |-> Prelude.not, Value

Prelude.odd |-> Prelude.odd, Value

Prelude.otherwise |-> Prelude.otherwise, Value

Prelude.pred |-> Prelude.pred, method of Enum

Prelude.primError |-> Prelude.primError, Value

Prelude.properFraction |-> Prelude.properFraction, method of RealFrac

Prelude.quot |-> Prelude.quot, method of Integral

Prelude.quotRem |-> Prelude.quotRem, method of Integral

Prelude.recip |-> Prelude.recip, method of Fractional

Prelude.rem |-> Prelude.rem, method of Integral

Prelude.round |-> Prelude.round, method of RealFrac

Prelude.show |-> Prelude.show, method of Show

Prelude.showArgument |-> Prelude.showArgument, Value

Prelude.showChar |-> Prelude.showChar, Value

Prelude.showList |-> Prelude.showList, method of Show

Prelude.showParen |-> Prelude.showParen, Value

Prelude.showParenArg |-> Prelude.showParenArg, Value

Prelude.showString |-> Prelude.showString, Value

Prelude.shows |-> Prelude.shows, Value

Prelude.showsPrec |-> Prelude.showsPrec, method of Show

Prelude.signum |-> Prelude.signum, method of Num

Prelude.subtract |-> Prelude.subtract, Value

Prelude.succ |-> Prelude.succ, method of Enum

Prelude.tail |-> Prelude.tail, field of []

Prelude.toEnum |-> Prelude.toEnum, method of Enum

Prelude.toInteger |-> Prelude.toInteger, method of Integral

Prelude.toRational |-> Prelude.toRational, method of Real

Prelude.truncate |-> Prelude.truncate, method of RealFrac

&& |-> Prelude.&&, Value

() |-> Prelude.(), Type [()] []

() |-> Prelude.(), con of ()

(,) |-> Prelude.(,), Type [(,)] []

(,) |-> Prelude.(,), con of (,)

(,,) |-> Prelude.(,,), Type [(,,)] []

(,,) |-> Prelude.(,,), con of (,,)

(,,,) |-> Prelude.(,,,), Type [(,,,)] []

(,,,) |-> Prelude.(,,,), con of (,,,)

* |-> Prelude.*, method of Num

+ |-> Prelude.+, method of Num

++ |-> Prelude.++, Value

- |-> Prelude.-, method of Num

-> |-> Prelude.->, Type [] []

. |-> Prelude.., Value

/ |-> Prelude./, method of Fractional

/= |-> Prelude./=, method of Eq

: |-> Prelude.:, con of []

< |-> Prelude.<, method of Ord

<= |-> Prelude.<=, method of Ord

== |-> Prelude.==, method of Eq

> |-> Prelude.>, method of Ord

>= |-> Prelude.>=, method of Ord

Association |-> Prelude.Association, con of Sport

B |-> Prelude.B, Type [Barfoo] []

Barfoo |-> Prelude.Barfoo, con of B

Bool |-> Prelude.Bool, Type [False, True] []

Bounded |-> Prelude.Bounded, Class [minBound,

maxBound]

C |-> Prelude.C, Type [Foobar, Foobar2] []

C |-> Prelude.C, con of Copy

Char |-> Prelude.Char, Type [] []

Copy |-> Prelude.Copy, Type [C] []

Double |-> Prelude.Double, Type [] []

EQ |-> Prelude.EQ, con of Ordering

Enum |-> Prelude.Enum, Class [succ, pred, toEnum,

fromEnum, enumFrom, enumFromThen, enumFromTo,

enumFromThenTo]

Eq |-> Prelude.Eq, Class [==, /=]

False |-> Prelude.False, con of Bool

Foobar |-> Prelude.Foobar, con of C

Foobar2 |-> Prelude.Foobar2, con of C

Fractional |-> Prelude.Fractional, Class [/, recip,

fromRational]

GT |-> Prelude.GT, con of Ordering

Int |-> Prelude.Int, Type [] []

Integer |-> Prelude.Integer, Type [] []

Integral |-> Prelude.Integral, Class [quot, rem, div,

mod, quotRem, divMod, toInteger]

LT |-> Prelude.LT, con of Ordering

M |-> Prelude.M, con of Wonky

Num |-> Prelude.Num, Class [+, -, *, negate, abs,

signum, fromInteger]

Ord |-> Prelude.Ord, Class [compare, <, <=, >=, >,

max, min]

Ordering |-> Prelude.Ordering, Type [LT, EQ, GT] []

Rational |-> Prelude.Rational, Type [] []

Real |-> Prelude.Real, Class [toRational]

RealFrac |-> Prelude.RealFrac, Class [properFraction,

truncate, round, ceiling, floor]

Show |-> Prelude.Show, Class [showsPrec, show,

showList]

ShowS |-> Prelude.ShowS, Type [] []

Sport |-> Prelude.Sport, Type [Sport, Association] []

Sport |-> Prelude.Sport, con of Sport

String |-> Prelude.String, Type [] []

True |-> Prelude.True, con of Bool

W |-> Prelude.W, con of Wonky

Wonky |-> Prelude.Wonky, Type [W, M] []

[] |-> Prelude.[], Type [[], :] [head, tail]

[] |-> Prelude.[], con of []

abs |-> Prelude.abs, method of Num

ceiling |-> Prelude.ceiling, method of RealFrac

compare |-> Prelude.compare, method of Ord

div |-> Prelude.div, method of Integral

divMod |-> Prelude.divMod, method of Integral

enumFrom |-> Prelude.enumFrom, method of Enum

enumFromThen |-> Prelude.enumFromThen, method of Enum

enumFromThenTo |-> Prelude.enumFromThenTo, method of Enum

enumFromTo |-> Prelude.enumFromTo, method of Enum

error |-> Prelude.error, Value

even |-> Prelude.even, Value

flip |-> Prelude.flip, Value

floor |-> Prelude.floor, method of RealFrac

fromEnum |-> Prelude.fromEnum, method of Enum

fromInteger |-> Prelude.fromInteger, method of Num

fromIntegral |-> Prelude.fromIntegral, Value

fromRational |-> Prelude.fromRational, method of Fractional

head |-> Prelude.head, field of []

lexOrder |-> Prelude.lexOrder, Value

map |-> Prelude.map, Value

max |-> Prelude.max, method of Ord

maxBound |-> Prelude.maxBound, method of Bounded

min |-> Prelude.min, method of Ord

minBound |-> Prelude.minBound, method of Bounded

mod |-> Prelude.mod, method of Integral

negate |-> Prelude.negate, method of Num

not |-> Prelude.not, Value

odd |-> Prelude.odd, Value

otherwise |-> Prelude.otherwise, Value

pred |-> Prelude.pred, method of Enum

primError |-> Prelude.primError, Value

properFraction |-> Prelude.properFraction, method of RealFrac

quot |-> Prelude.quot, method of Integral

quotRem |-> Prelude.quotRem, method of Integral

recip |-> Prelude.recip, method of Fractional

rem |-> Prelude.rem, method of Integral

round |-> Prelude.round, method of RealFrac

show |-> Prelude.show, method of Show

showArgument |-> Prelude.showArgument, Value

showChar |-> Prelude.showChar, Value

showList |-> Prelude.showList, method of Show

showParen |-> Prelude.showParen, Value

showParenArg |-> Prelude.showParenArg, Value

showString |-> Prelude.showString, Value

shows |-> Prelude.shows, Value

showsPrec |-> Prelude.showsPrec, method of Show

signum |-> Prelude.signum, method of Num

subtract |-> Prelude.subtract, Value

succ |-> Prelude.succ, method of Enum

tail |-> Prelude.tail, field of []

toEnum |-> Prelude.toEnum, method of Enum

toInteger |-> Prelude.toInteger, method of Integral

toRational |-> Prelude.toRational, method of Real

truncate |-> Prelude.truncate, method of RealFrac

-}

module Dummy where

import Prelude (error, Show, Eq, Ord)

import MyLogic

otherwise = True

lexOrder EQ o = o

lexOrder o _ = o

showArgument d215 x

= (.){-String String String-} (showChar ' ')

(showsPrec{-t210-} d215

(fromInteger{-Int-} inst__Prelude_Num_Int 10)

x)

data Integer

data Rational

data Double

data Char

data Int

data a -> b

data Bool = False | True deriving (Show, Eq, Ord)

not :: Bool -> Bool

not True = False

not False = True

(&&) :: Bool -> Bool -> Bool

(&&) a b = if a then True else b

data Ordering = LT | EQ | GT deriving (Show, Eq, Ord)

class Eq a where (==),(/=) :: a -> a -> Bool

($--/=) d227 x y = not ((==){-a-} d227 x y)

($--==) d233 x y = not ((/=){-a-} d233 x y)

data [a]

= [] | (:) {head :: a, tail :: [a]}

deriving (Show, Eq, Ord)

(++) :: [a] -> [a] -> [a]

(++) [] ys = ys

(++) ((:){-a-} x xs) ys

= (:){-a-} x ((++){-a-} xs ys)

map :: (a -> b) -> [a] -> [b]

map f [] = []

map f ((:){-a-} x xs)

= (:){-b-} (f x) (map{-a b-} f xs)

type String = String

foreign import primError :: String -> a

error :: String -> a

error = primError{-a-}

(.) :: (b -> c) -> (a -> b) -> a -> c

(.) f g = \ x -> f (g x)

type ShowS = String -> String

class Eq a => Ord a

where

compare :: a -> a -> Ordering

(<),(<=),(>=),(>) :: a -> a -> Bool

max,min :: a -> a -> a

default__compare d273 x y

| (==){-a-} d270 x y = EQ

| (<=){-a-} d273 x y = LT

| otherwise = GT

where

d270 = super1_Ord{-a-} d273

{-

d270 :: Eq a

-}

($--<=) d281 x y

= (/=){-Ordering-} derived__Prelude_Eq_Ordering

(compare{-a-} d281 x y)

GT

($--<) d289 x y

= (==){-Ordering-} derived__Prelude_Eq_Ordering

(compare{-a-} d289 x y)

LT

($-->=) d297 x y

= (/=){-Ordering-} derived__Prelude_Eq_Ordering

(compare{-a-} d297 x y)

LT

($-->) d305 x y

= (==){-Ordering-} derived__Prelude_Eq_Ordering

(compare{-a-} d305 x y)

GT

default__max d311 x y

| (<=){-a-} d311 x y = y

| otherwise = x

default__min d317 x y

| (<=){-a-} d317 x y = x

| otherwise = y

shows :: Show a => a -> ShowS

shows d326

= showsPrec{-a-} d326

(fromInteger{-Int-} inst__Prelude_Num_Int 0)

showChar :: Char -> ShowS

showChar = (:){-Char-}

showString :: String -> ShowS

showString = (++){-Char-}

showParen :: Bool -> ShowS -> ShowS

showParen b p

= if b

then (.){-String String String-}

((.){-String String String-} (showChar '(') p)

(showChar ')')

else p

showParenArg :: Int -> ShowS -> ShowS

showParenArg d

= showParen

((<=){-Int-} inst__Prelude_Ord_Int

(fromInteger{-Int-} inst__Prelude_Num_Int 10)

d)

class Show a

where

showsPrec :: Int -> a -> ShowS

show :: a -> String

showList :: [a] -> ShowS

default__showsPrec d353 _ x s

= (++){-Char-} (show{-a-} d353 x) s

default__show d361 x

= showsPrec{-a-} d361

(fromInteger{-Int-} inst__Prelude_Num_Int 0)

x

""

default__showList d391 [] = showString "[]"

default__showList d391 ((:){-a-} x xs)

= (.){-String String String-}

((.){-String String String-} (showChar '[')

(shows{-a-} d391 x))

(showl{-a-} d391 xs)

where

showl d379 [] = showChar ']'

showl d379 ((:){-t368-} x xs)

= (.){-String String String-}

((.){-String String String-} (showChar ',')

(shows{-t368-} d379 x))

(showl{-t368-} d379 xs)

{-

showl ::

forall a . (Show a) => [a] -> String -> String

-}

class (Eq a, Show a) => Num a

where

(+),(-),(*) :: a -> a -> a

negate :: a -> a

abs,signum :: a -> a

fromInteger :: Integer -> a

($--+) d400

= error{-(a -> a -> a)-} "No default for method +"

($---) d403

= error{-(a -> a -> a)-} "No default for method -"

($--*) d406

= error{-(a -> a -> a)-} "No default for method *"

default__negate d409

= error{-(a -> a)-} "No default for method negate"

default__abs d412

= error{-(a -> a)-} "No default for method abs"

default__signum d415

= error{-(a -> a)-} "No default for method signum"

default__fromInteger d418

= error{-(Integer -> a)-}

"No default for method fromInteger"

class Num a => Fractional a

where

(/) :: a -> a -> a

recip :: a -> a

fromRational :: Rational -> a

($--/) d423

= error{-(a -> a -> a)-} "No default for method /"

default__recip d426

= error{-(a -> a)-} "No default for method recip"

default__fromRational d429

= error{-(Rational -> a)-}

"No default for method fromRational"

instance Num Int

where

super1_Num = super{-(Eq Int)-} inst__Prelude_Eq_Int

super2_Num

= super{-(Show Int)-} inst__Prelude_Show_Int

(+) = ($--+){-Int-} inst__Prelude_Num_Int

(-) = ($---){-Int-} inst__Prelude_Num_Int

(*) = ($--*){-Int-} inst__Prelude_Num_Int

negate = default__negate{-Int-} inst__Prelude_Num_Int

abs = default__abs{-Int-} inst__Prelude_Num_Int

signum = default__signum{-Int-} inst__Prelude_Num_Int

fromInteger

= default__fromInteger{-Int-} inst__Prelude_Num_Int

{-

super1_Num :: Eq Int

super2_Num :: Show Int

(+) :: Int -> Int -> Int

(-) :: Int -> Int -> Int

(*) :: Int -> Int -> Int

negate :: Int -> Int

abs :: Int -> Int

signum :: Int -> Int

fromInteger :: Integer -> Int

-}

instance Num Integer

where

super1_Num

= super{-(Eq Integer)-} inst__Prelude_Eq_Integer

super2_Num

= super{-(Show Integer)-} inst__Prelude_Show_Integer

(+) = ($--+){-Integer-} inst__Prelude_Num_Integer

(-) = ($---){-Integer-} inst__Prelude_Num_Integer

(*) = ($--*){-Integer-} inst__Prelude_Num_Integer

negate

= default__negate{-Integer-}

inst__Prelude_Num_Integer

abs = default__abs{-Integer-}

inst__Prelude_Num_Integer

signum

= default__signum{-Integer-}

inst__Prelude_Num_Integer

fromInteger

= default__fromInteger{-Integer-}

inst__Prelude_Num_Integer

{-

super1_Num :: Eq Integer

super2_Num :: Show Integer

(+) :: Integer -> Integer -> Integer

(-) :: Integer -> Integer -> Integer

(*) :: Integer -> Integer -> Integer

negate :: Integer -> Integer

abs :: Integer -> Integer

signum :: Integer -> Integer

fromInteger :: Integer -> Integer

-}

instance Num Rational

where

super1_Num

= super{-(Eq Rational)-} inst__Prelude_Eq_Rational

super2_Num

= super{-(Show Rational)-}

inst__Prelude_Show_Rational

(+) = ($--+){-Rational-} inst__Prelude_Num_Rational

(-) = ($---){-Rational-} inst__Prelude_Num_Rational

(*) = ($--*){-Rational-} inst__Prelude_Num_Rational

negate

= default__negate{-Rational-}

inst__Prelude_Num_Rational

abs = default__abs{-Rational-}

inst__Prelude_Num_Rational

signum

= default__signum{-Rational-}

inst__Prelude_Num_Rational

fromInteger

= default__fromInteger{-Rational-}

inst__Prelude_Num_Rational

{-

super1_Num :: Eq Rational

super2_Num :: Show Rational

(+) :: Rational -> Rational -> Rational

(-) :: Rational -> Rational -> Rational

(*) :: Rational -> Rational -> Rational

negate :: Rational -> Rational

abs :: Rational -> Rational

signum :: Rational -> Rational

fromInteger :: Integer -> Rational

-}

instance Num Double

where

super1_Num

= super{-(Eq Double)-} inst__Prelude_Eq_Double

super2_Num

= super{-(Show Double)-} inst__Prelude_Show_Double

(+) = ($--+){-Double-} inst__Prelude_Num_Double

(-) = ($---){-Double-} inst__Prelude_Num_Double

(*) = ($--*){-Double-} inst__Prelude_Num_Double

negate

= default__negate{-Double-} inst__Prelude_Num_Double

abs = default__abs{-Double-} inst__Prelude_Num_Double

signum

= default__signum{-Double-} inst__Prelude_Num_Double

fromInteger

= default__fromInteger{-Double-}

inst__Prelude_Num_Double

{-

super1_Num :: Eq Double

super2_Num :: Show Double

(+) :: Double -> Double -> Double

(-) :: Double -> Double -> Double

(*) :: Double -> Double -> Double

negate :: Double -> Double

abs :: Double -> Double

signum :: Double -> Double

fromInteger :: Integer -> Double

-}

instance Eq Int

where

(==) = ($--==){-Int-} inst__Prelude_Eq_Int

(/=) = ($--/=){-Int-} inst__Prelude_Eq_Int

{-

(==) :: Int -> Int -> Bool

(/=) :: Int -> Int -> Bool

-}

instance Ord Int

where

super1_Ord = super{-(Eq Int)-} inst__Prelude_Eq_Int

compare

= default__compare{-Int-} inst__Prelude_Ord_Int

(<) = ($--<){-Int-} inst__Prelude_Ord_Int

(<=) = ($--<=){-Int-} inst__Prelude_Ord_Int

(>=) = ($-->=){-Int-} inst__Prelude_Ord_Int

(>) = ($-->){-Int-} inst__Prelude_Ord_Int

max = default__max{-Int-} inst__Prelude_Ord_Int

min = default__min{-Int-} inst__Prelude_Ord_Int

{-

super1_Ord :: Eq Int

compare :: Int -> Int -> Ordering

(<) :: Int -> Int -> Bool

(<=) :: Int -> Int -> Bool

(>=) :: Int -> Int -> Bool

(>) :: Int -> Int -> Bool

max :: Int -> Int -> Int

min :: Int -> Int -> Int

-}

instance Enum Int

where

succ = default__succ{-Int-} inst__Prelude_Enum_Int

pred = default__pred{-Int-} inst__Prelude_Enum_Int

toEnum

= default__toEnum{-Int-} inst__Prelude_Enum_Int

fromEnum

= default__fromEnum{-Int-} inst__Prelude_Enum_Int

enumFrom

= default__enumFrom{-Int-} inst__Prelude_Enum_Int

enumFromThen

= default__enumFromThen{-Int-} inst__Prelude_Enum_Int

enumFromTo

= default__enumFromTo{-Int-} inst__Prelude_Enum_Int

enumFromThenTo

= default__enumFromThenTo{-Int-}

inst__Prelude_Enum_Int

{-

succ :: Int -> Int

pred :: Int -> Int

toEnum :: Int -> Int

fromEnum :: Int -> Int

enumFrom :: Int -> [Int]

enumFromThen :: Int -> Int -> [Int]

enumFromTo :: Int -> Int -> [Int]

enumFromThenTo :: Int -> Int -> Int -> [Int]

-}

instance Eq Char

where

(==) = ($--==){-Char-} inst__Prelude_Eq_Char

(/=) = ($--/=){-Char-} inst__Prelude_Eq_Char

{-

(==) :: Char -> Char -> Bool

(/=) :: Char -> Char -> Bool

-}

instance Eq Integer

where

(==) = ($--==){-Integer-} inst__Prelude_Eq_Integer

(/=) = ($--/=){-Integer-} inst__Prelude_Eq_Integer

{-

(==) :: Integer -> Integer -> Bool

(/=) :: Integer -> Integer -> Bool

-}

instance Eq Rational

where

(==) = ($--==){-Rational-} inst__Prelude_Eq_Rational

(/=) = ($--/=){-Rational-} inst__Prelude_Eq_Rational

{-

(==) :: Rational -> Rational -> Bool

(/=) :: Rational -> Rational -> Bool

-}

instance Eq Double

where

(==) = ($--==){-Double-} inst__Prelude_Eq_Double

(/=) = ($--/=){-Double-} inst__Prelude_Eq_Double

{-

(==) :: Double -> Double -> Bool

(/=) :: Double -> Double -> Bool

-}

instance Ord Char

where

super1_Ord = super{-(Eq Char)-} inst__Prelude_Eq_Char

compare

= default__compare{-Char-} inst__Prelude_Ord_Char

(<) = ($--<){-Char-} inst__Prelude_Ord_Char

(<=) = ($--<=){-Char-} inst__Prelude_Ord_Char

(>=) = ($-->=){-Char-} inst__Prelude_Ord_Char

(>) = ($-->){-Char-} inst__Prelude_Ord_Char

max = default__max{-Char-} inst__Prelude_Ord_Char

min = default__min{-Char-} inst__Prelude_Ord_Char

{-

super1_Ord :: Eq Char

compare :: Char -> Char -> Ordering

(<) :: Char -> Char -> Bool

(<=) :: Char -> Char -> Bool

(>=) :: Char -> Char -> Bool

(>) :: Char -> Char -> Bool

max :: Char -> Char -> Char

min :: Char -> Char -> Char

-}

instance Ord Integer

where

super1_Ord

= super{-(Eq Integer)-} inst__Prelude_Eq_Integer

compare

= default__compare{-Integer-}

inst__Prelude_Ord_Integer

(<) = ($--<){-Integer-} inst__Prelude_Ord_Integer

(<=) = ($--<=){-Integer-} inst__Prelude_Ord_Integer

(>=) = ($-->=){-Integer-} inst__Prelude_Ord_Integer

(>) = ($-->){-Integer-} inst__Prelude_Ord_Integer

max = default__max{-Integer-}

inst__Prelude_Ord_Integer

min = default__min{-Integer-}

inst__Prelude_Ord_Integer

{-

super1_Ord :: Eq Integer

compare :: Integer -> Integer -> Ordering

(<) :: Integer -> Integer -> Bool

(<=) :: Integer -> Integer -> Bool

(>=) :: Integer -> Integer -> Bool

(>) :: Integer -> Integer -> Bool

max :: Integer -> Integer -> Integer

min :: Integer -> Integer -> Integer

-}

instance Ord Rational

where

super1_Ord

= super{-(Eq Rational)-} inst__Prelude_Eq_Rational

compare

= default__compare{-Rational-}

inst__Prelude_Ord_Rational

(<) = ($--<){-Rational-} inst__Prelude_Ord_Rational

(<=) = ($--<=){-Rational-} inst__Prelude_Ord_Rational

(>=) = ($-->=){-Rational-} inst__Prelude_Ord_Rational

(>) = ($-->){-Rational-} inst__Prelude_Ord_Rational

max = default__max{-Rational-}

inst__Prelude_Ord_Rational

min = default__min{-Rational-}

inst__Prelude_Ord_Rational

{-

super1_Ord :: Eq Rational

compare :: Rational -> Rational -> Ordering

(<) :: Rational -> Rational -> Bool

(<=) :: Rational -> Rational -> Bool

(>=) :: Rational -> Rational -> Bool

(>) :: Rational -> Rational -> Bool

max :: Rational -> Rational -> Rational

min :: Rational -> Rational -> Rational

-}

instance Ord Double

where

super1_Ord

= super{-(Eq Double)-} inst__Prelude_Eq_Double

compare

= default__compare{-Double-} inst__Prelude_Ord_Double

(<) = ($--<){-Double-} inst__Prelude_Ord_Double

(<=) = ($--<=){-Double-} inst__Prelude_Ord_Double

(>=) = ($-->=){-Double-} inst__Prelude_Ord_Double

(>) = ($-->){-Double-} inst__Prelude_Ord_Double

max = default__max{-Double-} inst__Prelude_Ord_Double

min = default__min{-Double-} inst__Prelude_Ord_Double

{-

super1_Ord :: Eq Double

compare :: Double -> Double -> Ordering

(<) :: Double -> Double -> Bool

(<=) :: Double -> Double -> Bool

(>=) :: Double -> Double -> Bool

(>) :: Double -> Double -> Bool

max :: Double -> Double -> Double

min :: Double -> Double -> Double

-}

instance Show Int

where

showsPrec

= default__showsPrec{-Int-} inst__Prelude_Show_Int

show = default__show{-Int-} inst__Prelude_Show_Int

showList

= default__showList{-Int-} inst__Prelude_Show_Int

{-

showsPrec :: Int -> Int -> ShowS

show :: Int -> String

showList :: [Int] -> ShowS

-}

instance Show Char

where

showsPrec

= default__showsPrec{-Char-} inst__Prelude_Show_Char

show = default__show{-Char-} inst__Prelude_Show_Char

showList

= default__showList{-Char-} inst__Prelude_Show_Char

{-

showsPrec :: Int -> Char -> ShowS

show :: Char -> String

showList :: String -> ShowS

-}

instance Show Integer

where

showsPrec

= default__showsPrec{-Integer-}

inst__Prelude_Show_Integer

show

= default__show{-Integer-} inst__Prelude_Show_Integer

showList

= default__showList{-Integer-}

inst__Prelude_Show_Integer

{-

showsPrec :: Int -> Integer -> ShowS

show :: Integer -> String

showList :: [Integer] -> ShowS

-}

instance Show Rational

where

showsPrec

= default__showsPrec{-Rational-}

inst__Prelude_Show_Rational

show

= default__show{-Rational-}

inst__Prelude_Show_Rational

showList

= default__showList{-Rational-}

inst__Prelude_Show_Rational

{-

showsPrec :: Int -> Rational -> ShowS

show :: Rational -> String

showList :: [Rational] -> ShowS

-}

instance Show Double

where

showsPrec

= default__showsPrec{-Double-}

inst__Prelude_Show_Double

show

= default__show{-Double-} inst__Prelude_Show_Double

showList

= default__showList{-Double-}

inst__Prelude_Show_Double

{-

showsPrec :: Int -> Double -> ShowS

show :: Double -> String

showList :: [Double] -> ShowS

-}

instance Fractional Rational

where

super1_Fractional

= super{-(Num Rational)-} inst__Prelude_Num_Rational

(/) = ($--/){-Rational-}

inst__Prelude_Fractional_Rational

recip

= default__recip{-Rational-}

inst__Prelude_Fractional_Rational

fromRational

= default__fromRational{-Rational-}

inst__Prelude_Fractional_Rational

{-

super1_Fractional :: Num Rational

(/) :: Rational -> Rational -> Rational

recip :: Rational -> Rational

fromRational :: Rational -> Rational

-}

instance Fractional Double

where

super1_Fractional

= super{-(Num Double)-} inst__Prelude_Num_Double

(/) = ($--/){-Double-}

inst__Prelude_Fractional_Double

recip

= default__recip{-Double-}

inst__Prelude_Fractional_Double

fromRational

= default__fromRational{-Double-}

inst__Prelude_Fractional_Double

{-

super1_Fractional :: Num Double

(/) :: Double -> Double -> Double

recip :: Double -> Double

fromRational :: Rational -> Double

-}

subtract :: Num a => a -> a -> a

subtract d789 = flip{-a a a-} ((-){-a-} d789)

flip :: (a -> b -> c) -> b -> a -> c

flip f x y = f y x

class Enum a

where

succ,pred :: a -> a

toEnum :: Int -> a

fromEnum :: a -> Int

enumFrom :: a -> [a]

enumFromThen :: a -> a -> [a]

enumFromTo :: a -> a -> [a]

enumFromThenTo :: a -> a -> a -> [a]

default__succ d814

= (.){-Int a a-}

((.){-Int a Int-} (toEnum{-a-} d814)

(flip{-Int Int Int-}

((+){-Int-} inst__Prelude_Num_Int)

(fromInteger{-Int-} inst__Prelude_Num_Int 1)))

(fromEnum{-a-} d814)

default__pred d830

= (.){-Int a a-}

((.){-Int a Int-} (toEnum{-a-} d830)

(subtract{-Int-} inst__Prelude_Num_Int

(fromInteger{-Int-} inst__Prelude_Num_Int 1)))

(fromEnum{-a-} d830)

default__enumFrom d841 x

= map{-Int a-} (toEnum{-a-} d841)

(enumFrom{-Int-} inst__Prelude_Enum_Int

(fromEnum{-a-} d841 x))

default__enumFromTo d855 x y

= map{-Int a-} (toEnum{-a-} d855)

(enumFromTo{-Int-} inst__Prelude_Enum_Int

(fromEnum{-a-} d855 x)

(fromEnum{-a-} d855 y))

default__enumFromThen d869 x y

= map{-Int a-} (toEnum{-a-} d869)

(enumFromThen{-Int-} inst__Prelude_Enum_Int

(fromEnum{-a-} d869 x)

(fromEnum{-a-} d869 y))

default__enumFromThenTo d886 x y z

= map{-Int a-} (toEnum{-a-} d886)

(enumFromThenTo{-Int-} inst__Prelude_Enum_Int

(fromEnum{-a-} d886 x)

(fromEnum{-a-} d886 y)

(fromEnum{-a-} d886 z))

default__toEnum d889

= error{-(Int -> a)-} "No default for method toEnum"

default__fromEnum d892

= error{-(a -> Int)-}

"No default for method fromEnum"

class Bounded a

where

minBound :: a

maxBound :: a

default__minBound d902

= error{-a-} "No default for method minBound"

default__maxBound d905

= error{-a-} "No default for method maxBound"

data () = () deriving (Eq, Ord, Show)

data (a, b) = (,) a b deriving (Show, Eq, Ord)

data (a, b, c)

= Prelude.(,,) a b c deriving (Show, Eq, Ord)

data (a, b, c, d)

= Prelude.(,,,) a b c d deriving (Show, Eq, Ord)

class (Num a, Ord a) => Real a

where toRational :: a -> Rational

default__toRational d909

= error{-(a -> Rational)-}

"No default for method toRational"

class (Real a, Enum a) => Integral a

where

quot,rem :: a -> a -> a

div,mod :: a -> a -> a

quotRem,divMod :: a -> a -> (a, a)

toInteger :: a -> Integer

default__quot d914

= error{-(a -> a -> a)-} "No default for method quot"

default__rem d917

= error{-(a -> a -> a)-} "No default for method rem"

default__div d920

= error{-(a -> a -> a)-} "No default for method div"

default__mod d923

= error{-(a -> a -> a)-} "No default for method mod"

default__quotRem d926

= error{-(a -> a -> (a, a))-}

"No default for method quotRem"

default__divMod d929

= error{-(a -> a -> (a, a))-}

"No default for method divMod"

default__toInteger d932

= error{-(a -> Integer)-}

"No default for method toInteger"

fromIntegral :: (Integral a, Num b) => a -> b

fromIntegral d946 d947

= (.){-Integer b a-} (fromInteger{-b-} d947)

(toInteger{-a-} d946)

even,odd :: Integral a => a -> Bool

even d958 n

= (==){-a-} d951

(rem{-a-} d958 n (fromInteger{-a-} d955 2))

(fromInteger{-a-} d955 0)

where

d955 = super1_Real{-a-} (super1_Integral{-a-} d958)

d951

= super1_Num{-a-}

(super1_Real{-a-} (super1_Integral{-a-} d958))

{-

d955 :: Num a

d951 :: Eq a

-}

odd d963 n = not (even{-a-} d963 n)

class (Real a, Fractional a) => RealFrac a

where

properFraction :: Integral b => a -> (b, a)

truncate,round :: Integral b => a -> b

ceiling,floor :: Integral b => a -> b

default__truncate d972 d973 x

= m

where

(m, _) = properFraction{-a b-} d972 d973 x

{-

m :: b

-}

default__round d1013 d1014 x

= let (n, r) = properFraction{-a b-} d1013 d1014 x

m = if (<){-a-} d984 r (fromInteger{-a-} d986 0)

then (-){-b-} d988 n (fromInteger{-b-} d988 1)

else (+){-b-} d988 n (fromInteger{-b-} d988 1)

{-

r :: a

n :: b

m :: b

-}

in case signum{-a-} d986

((-){-a-} d986 (abs{-a-} d986 r)

(fromRational{-a-} d1002 1 % 2)) of

negate{-a-} d1004 (fromInteger{-a-} d1006 1) -> n

fromInteger{-a-} d1008 0

-> if even{-b-} d1014 n then n else m

fromInteger{-a-} d1012 1 -> m

where

d1002 = super2_RealFrac{-a-} d1013

d988 = super1_Real{-b-} (super1_Integral{-b-} d1014)

d986 = super1_Real{-a-} (super1_RealFrac{-a-} d1013)

d984 = super2_Real{-a-} (super1_RealFrac{-a-} d1013)

{-

d1002 :: Fractional a

d988 :: Num b

d986 :: Num a

d984 :: Ord a

-}

default__ceiling d1031 d1032 x

= if (>){-a-} d1024 r (fromInteger{-a-} d1026 0)

then (+){-b-} d1028 n (fromInteger{-b-} d1028 1)

else n

where

d1028 = super1_Real{-b-} (super1_Integral{-b-} d1032)

d1026 = super1_Real{-a-} (super1_RealFrac{-a-} d1031)

d1024 = super2_Real{-a-} (super1_RealFrac{-a-} d1031)

(n, r) = properFraction{-a b-} d1031 d1032 x

{-

d1028 :: Num b

d1026 :: Num a

d1024 :: Ord a

r :: a

n :: b

-}

default__floor d1049 d1050 x

= if (<){-a-} d1042 r (fromInteger{-a-} d1044 0)

then (-){-b-} d1046 n (fromInteger{-b-} d1046 1)

else n

where

d1046 = super1_Real{-b-} (super1_Integral{-b-} d1050)

d1044 = super1_Real{-a-} (super1_RealFrac{-a-} d1049)

d1042 = super2_Real{-a-} (super1_RealFrac{-a-} d1049)

(n, r) = properFraction{-a b-} d1049 d1050 x

{-

d1046 :: Num b

d1044 :: Num a

d1042 :: Ord a

r :: a

n :: b

-}

default__properFraction d1053 d1054

= error{-(a -> (b, a))-}

"No default for method properFraction"

data B b = Barfoo (b Int)

data C c = Foobar (B c) | Foobar2 (c Int)

newtype Copy a = C a

instance Show (Copy a)

where

show x = "haha"

showsPrec

= default__showsPrec{-(Copy a)-} d1070

where

d1070 = inst__Prelude_Show__l_Copy_a_r_{-a-}

{-

d1070 :: Show (Copy a)

-}

showList

= default__showList{-(Copy a)-} d1073

where

d1073 = inst__Prelude_Show__l_Copy_a_r_{-a-}

{-

d1073 :: Show (Copy a)

-}

{-

show :: forall a . (Copy a) -> String

showsPrec :: forall a . Int -> (Copy a) -> ShowS

showList :: forall a . [Copy a] -> ShowS

-}

data Wonky f = W | M (f (Wonky f))

data Sport f = Sport | Association (f Bool)

instance Eq Bool

where

(==) False False = True

(==) True True = True

(==) _ _ = False

(/=) = ($--/=){-Bool-} derived__Prelude_Eq_Bool

{-

(==) :: Bool -> Bool -> Bool

(/=) :: Bool -> Bool -> Bool

-}

instance Ord Bool

where

super1_Ord

= super{-(Eq Bool)-} derived__Prelude_Eq_Bool

compare x y

= let cno False

= let t1088 :: Int

t1088 = fromInteger{-Int-} inst__Prelude_Num_Int 0

{- t1088 :: Int -}

in t1088

cno True = fromInteger{-Int-} inst__Prelude_Num_Int 1

{- cno :: Bool -> Int -}

in compare{-Int-} inst__Prelude_Ord_Int (cno x)

(cno y)

(<) = ($--<){-Bool-} derived__Prelude_Ord_Bool

(<=) = ($--<=){-Bool-} derived__Prelude_Ord_Bool

(>=) = ($-->=){-Bool-} derived__Prelude_Ord_Bool

(>) = ($-->){-Bool-} derived__Prelude_Ord_Bool

max = default__max{-Bool-} derived__Prelude_Ord_Bool

min = default__min{-Bool-} derived__Prelude_Ord_Bool

{-

super1_Ord :: Eq Bool

compare :: Bool -> Bool -> Ordering

(<) :: Bool -> Bool -> Bool

(<=) :: Bool -> Bool -> Bool

(>=) :: Bool -> Bool -> Bool

(>) :: Bool -> Bool -> Bool

max :: Bool -> Bool -> Bool

min :: Bool -> Bool -> Bool

-}

instance Show Bool

where

showsPrec d False = showString "False"

showsPrec d True = showString "True"

show

= default__show{-Bool-} derived__Prelude_Show_Bool

showList

= default__showList{-Bool-}

derived__Prelude_Show_Bool

{-

showsPrec :: Int -> Bool -> ShowS

show :: Bool -> String

showList :: [Bool] -> ShowS

-}

instance Eq Ordering

where

(==) LT LT = True

(==) EQ EQ = True

(==) GT GT = True

(==) _ _ = False

(/=)

= ($--/=){-Ordering-} derived__Prelude_Eq_Ordering

{-

(==) :: Ordering -> Ordering -> Bool

(/=) :: Ordering -> Ordering -> Bool

-}

instance Ord Ordering

where

super1_Ord

= super{-(Eq Ordering)-} derived__Prelude_Eq_Ordering

compare x y

= let cno LT

= let t1139 :: Int

t1139 = fromInteger{-Int-} inst__Prelude_Num_Int 0

{- t1139 :: Int -}

in t1139

cno EQ = fromInteger{-Int-} inst__Prelude_Num_Int 1

cno GT = fromInteger{-Int-} inst__Prelude_Num_Int 2

{- cno :: Ordering -> Int -}

in compare{-Int-} inst__Prelude_Ord_Int (cno x)

(cno y)

(<) = ($--<){-Ordering-}

derived__Prelude_Ord_Ordering

(<=)

= ($--<=){-Ordering-} derived__Prelude_Ord_Ordering

(>=)

= ($-->=){-Ordering-} derived__Prelude_Ord_Ordering

(>) = ($-->){-Ordering-}

derived__Prelude_Ord_Ordering

max = default__max{-Ordering-}

derived__Prelude_Ord_Ordering

min = default__min{-Ordering-}

derived__Prelude_Ord_Ordering

{-

super1_Ord :: Eq Ordering

compare :: Ordering -> Ordering -> Ordering

(<) :: Ordering -> Ordering -> Bool

(<=) :: Ordering -> Ordering -> Bool

(>=) :: Ordering -> Ordering -> Bool

(>) :: Ordering -> Ordering -> Bool

max :: Ordering -> Ordering -> Ordering

min :: Ordering -> Ordering -> Ordering

-}

instance Show Ordering

where

showsPrec d LT = showString "LT"

showsPrec d EQ = showString "EQ"

showsPrec d GT = showString "GT"

show

= default__show{-Ordering-}

derived__Prelude_Show_Ordering

showList

= default__showList{-Ordering-}

derived__Prelude_Show_Ordering

{-

showsPrec :: Int -> Ordering -> ShowS

show :: Ordering -> String

showList :: [Ordering] -> ShowS

-}

instance Eq a => Eq [a]

where

(==) d1195 []{-a-} []{-a-} = True

(==) d1195 ((:){-a-} x1 x2) ((:){-a-} y1 y2)

= (&&) ((==){-a-} d1195 x1 y1)

((==){-[a]-} d1191 x2 y2)

where

d1191 = derived__Prelude_Eq_34_65{-a-} d1195

{-

d1191 :: Eq [a]

-}

(==) d1195 _ _ = False

(/=) d1199

= ($--/=){-[a]-} d1198

where

d1198 = derived__Prelude_Eq_34_65{-a-} d1199

{-

d1198 :: Eq [a]

-}

{-

(==) :: forall a . (Eq a) => [a] -> [a] -> Bool

(/=) :: forall a . (Eq a) => [a] -> [a] -> Bool

-}

instance Ord a => Ord [a]

where

super1_Ord d1204

= super{-(Eq [a])-} d1203

where

d1205 = super1_Ord{-a-} d1204

d1203 = derived__Prelude_Eq_34_65{-a-} d1205

{-

d1205 :: Eq a

d1203 :: Eq [a]

-}

compare d1238 ((:){-a-} x1 x2) ((:){-a-} y1 y2)

= lexOrder (compare{-a-} d1238 x1 y1)

(compare{-[a]-} d1216 x2 y2)

where

d1216 = derived__Prelude_Ord_34_69{-a-} d1238

{-

d1216 :: Ord [a]

-}

compare d1238 x y

= let cno []{-t1229-}

= let t1222 :: Int

t1222 = fromInteger{-Int-} inst__Prelude_Num_Int 0

{- t1222 :: Int -}

in t1222

cno ((:){-t1229-} _ _)

= fromInteger{-Int-} inst__Prelude_Num_Int 1

{- cno :: forall a . [a] -> Int -}

in compare{-Int-} inst__Prelude_Ord_Int (cno{-a-} x)

(cno{-a-} y)

(<) d1242

= ($--<){-[a]-} d1241

where

d1241 = derived__Prelude_Ord_34_69{-a-} d1242

{-

d1241 :: Ord [a]

-}

(<=) d1247

= ($--<=){-[a]-} d1246

where

d1246 = derived__Prelude_Ord_34_69{-a-} d1247

{-

d1246 :: Ord [a]

-}

(>=) d1252

= ($-->=){-[a]-} d1251

where

d1251 = derived__Prelude_Ord_34_69{-a-} d1252

{-

d1251 :: Ord [a]

-}

(>) d1257

= ($-->){-[a]-} d1256

where

d1256 = derived__Prelude_Ord_34_69{-a-} d1257

{-

d1256 :: Ord [a]

-}

max d1262

= default__max{-[a]-} d1261

where

d1261 = derived__Prelude_Ord_34_69{-a-} d1262

{-

d1261 :: Ord [a]

-}

min d1267

= default__min{-[a]-} d1266

where

d1266 = derived__Prelude_Ord_34_69{-a-} d1267

{-

d1266 :: Ord [a]

-}

{-

super1_Ord :: forall a . (Ord a) => Eq [a]

compare ::

forall a . (Ord a) => [a] -> [a] -> Ordering

(<) :: forall a . (Ord a) => [a] -> [a] -> Bool

(<=) :: forall a . (Ord a) => [a] -> [a] -> Bool

(>=) :: forall a . (Ord a) => [a] -> [a] -> Bool

(>) :: forall a . (Ord a) => [a] -> [a] -> Bool

max :: forall a . (Ord a) => [a] -> [a] -> [a]

min :: forall a . (Ord a) => [a] -> [a] -> [a]

-}

instance Show a => Show [a]

where

showsPrec d1287 d []{-a-} = showString "[]"

showsPrec d1287 d ((:){-a-} x1 x2)

= showParenArg d

((.){-String String String-} (showString ":")

((.){-String String String-}

(showArgument{-a-} d1287 x1)

(showArgument{-[a]-} d1285 x2)))

where

d1285 = derived__Prelude_Show_34_59{-a-} d1287

{-

d1285 :: Show [a]

-}

show d1291

= default__show{-[a]-} d1290

where

d1290 = derived__Prelude_Show_34_59{-a-} d1291

{-

d1290 :: Show [a]

-}

showList d1296

= default__showList{-[a]-} d1295

where

d1295 = derived__Prelude_Show_34_59{-a-} d1296

{-

d1295 :: Show [a]

-}

{-

showsPrec ::

forall a . (Show a) => Int -> [a] -> ShowS

show :: forall a . (Show a) => [a] -> String

showList :: forall a . (Show a) => [[a]] -> ShowS

-}

instance Eq ()

where

(==) () () = True

(/=) = ($--/=){-()-} derived__Prelude_Eq_184_27

{-

(==) :: () -> () -> Bool

(/=) :: () -> () -> Bool

-}

instance Ord ()

where

super1_Ord

= super{-(Eq ())-} derived__Prelude_Eq_184_27

compare x y

= let cno ()

= let t1310 :: Int

t1310 = fromInteger{-Int-} inst__Prelude_Num_Int 0

{- t1310 :: Int -}

in t1310

{- cno :: () -> Int -}

in compare{-Int-} inst__Prelude_Ord_Int (cno x)

(cno y)

(<) = ($--<){-()-} derived__Prelude_Ord_184_31

(<=) = ($--<=){-()-} derived__Prelude_Ord_184_31

(>=) = ($-->=){-()-} derived__Prelude_Ord_184_31

(>) = ($-->){-()-} derived__Prelude_Ord_184_31

max = default__max{-()-} derived__Prelude_Ord_184_31

min = default__min{-()-} derived__Prelude_Ord_184_31

{-

super1_Ord :: Eq ()

compare :: () -> () -> Ordering

(<) :: () -> () -> Bool

(<=) :: () -> () -> Bool

(>=) :: () -> () -> Bool

(>) :: () -> () -> Bool

max :: () -> () -> ()

min :: () -> () -> ()

-}

instance Show ()

where

showsPrec d () = showString "()"

show

= default__show{-()-} derived__Prelude_Show_184_36

showList

= default__showList{-()-}

derived__Prelude_Show_184_36

{-

showsPrec :: Int -> () -> ShowS

show :: () -> String

showList :: [()] -> ShowS

-}

instance (Eq a, Eq b) => Eq (a, b)

where

(==) d1357 d1358 ((,){-a b-} x1 x2)

((,){-a b-} y1 y2)

= (&&) ((==){-a-} d1357 x1 y1)

((==){-b-} d1358 x2 y2)

(/=) d1362 d1363

= ($--/=){-(a, b)-} d1361

where

d1361 = derived__Prelude_Eq_188_20{-a b-} d1362 d1363

{-

d1361 :: Eq (a, b)

-}

{-

(==) ::

forall a b . (Eq a, Eq b) => (a, b) -> (a, b) -> Bool

(/=) ::

forall a b . (Eq a, Eq b) => (a, b) -> (a, b) -> Bool

-}

instance (Ord a, Ord b) => Ord (a, b)

where

super1_Ord d1369 d1370

= super{-(Eq (a, b))-} d1368

where

d1371 = super1_Ord{-a-} d1369

d1372 = super1_Ord{-b-} d1370

d1368 = derived__Prelude_Eq_188_20{-a b-} d1371 d1372

{-

d1371 :: Eq a

d1372 :: Eq b

d1368 :: Eq (a, b)

-}

compare d1386 d1387 ((,){-a b-} x1 x2)

((,){-a b-} y1 y2)

= lexOrder (compare{-a-} d1386 x1 y1)

(compare{-b-} d1387 x2 y2)

(<) d1391 d1392

= ($--<){-(a, b)-} d1390

where

d1390

= derived__Prelude_Ord_188_24{-a b-} d1391 d1392

{-

d1390 :: Ord (a, b)

-}

(<=) d1398 d1399

= ($--<=){-(a, b)-} d1397

where

d1397

= derived__Prelude_Ord_188_24{-a b-} d1398 d1399

{-

d1397 :: Ord (a, b)

-}

(>=) d1405 d1406

= ($-->=){-(a, b)-} d1404

where

d1404

= derived__Prelude_Ord_188_24{-a b-} d1405 d1406

{-

d1404 :: Ord (a, b)

-}

(>) d1412 d1413

= ($-->){-(a, b)-} d1411

where

d1411

= derived__Prelude_Ord_188_24{-a b-} d1412 d1413

{-

d1411 :: Ord (a, b)

-}

max d1419 d1420

= default__max{-(a, b)-} d1418

where

d1418

= derived__Prelude_Ord_188_24{-a b-} d1419 d1420

{-

d1418 :: Ord (a, b)

-}

min d1426 d1427

= default__min{-(a, b)-} d1425

where

d1425

= derived__Prelude_Ord_188_24{-a b-} d1426 d1427

{-

d1425 :: Ord (a, b)

-}

{-

super1_Ord ::

forall a b . (Ord a, Ord b) => Eq (a, b)

compare ::

forall a b .

(Ord a, Ord b) => (a, b) -> (a, b) -> Ordering

(<) ::

forall a b .

(Ord a, Ord b) => (a, b) -> (a, b) -> Bool

(<=) ::

forall a b .

(Ord a, Ord b) => (a, b) -> (a, b) -> Bool

(>=) ::

forall a b .

(Ord a, Ord b) => (a, b) -> (a, b) -> Bool

(>) ::

forall a b .

(Ord a, Ord b) => (a, b) -> (a, b) -> Bool

max ::

forall a b .

(Ord a, Ord b) => (a, b) -> (a, b) -> (a, b)

min ::

forall a b .

(Ord a, Ord b) => (a, b) -> (a, b) -> (a, b)

-}

instance (Show a, Show b) => Show (a, b)

where

showsPrec d1446 d1447 d ((,){-a b-} x1 x2)

= showParenArg d

((.){-String String String-} (showString "(,)")

((.){-String String String-}

(showArgument{-a-} d1446 x1)

(showArgument{-b-} d1447 x2)))

show d1451 d1452

= default__show{-(a, b)-} d1450

where

d1450

= derived__Prelude_Show_188_14{-a b-} d1451 d1452

{-

d1450 :: Show (a, b)

-}

showList d1458 d1459

= default__showList{-(a, b)-} d1457

where

d1457

= derived__Prelude_Show_188_14{-a b-} d1458 d1459

{-

d1457 :: Show (a, b)

-}

{-

showsPrec ::

forall a b .

(Show a, Show b) => Int -> (a, b) -> ShowS

show ::

forall a b . (Show a, Show b) => (a, b) -> String

showList ::

forall a b . (Show a, Show b) => [(a, b)] -> ShowS

-}

instance (Eq a, Eq b, Eq c) => Eq (a, b, c)

where

(==) d1481 d1482 d1483 ((,,){-a b c-} x1 x2 x3)

((,,){-a b c-} y1 y2 y3)

= (&&) ((==){-a-} d1481 x1 y1)

((&&) ((==){-b-} d1482 x2 y2)

((==){-c-} d1483 x3 y3))

(/=) d1487 d1488 d1489

= ($--/=){-(a, b, c)-} d1486

where

d1486

= derived__Prelude_Eq_192_20{-a b c-} d1487 d1488

d1489

{-

d1486 :: Eq (a, b, c)

-}

{-

(==) ::

forall a b c .

(Eq a, Eq b, Eq c) => (a, b, c) -> (a, b, c) -> Bool

(/=) ::

forall a b c .

(Eq a, Eq b, Eq c) => (a, b, c) -> (a, b, c) -> Bool

-}

instance (Ord a, Ord b, Ord c) => Ord (a, b, c)

where

super1_Ord d1496 d1497 d1498

= super{-(Eq (a, b, c))-} d1495

where

d1499 = super1_Ord{-a-} d1496

d1500 = super1_Ord{-b-} d1497

d1501 = super1_Ord{-c-} d1498

d1495

= derived__Prelude_Eq_192_20{-a b c-} d1499 d1500

d1501

{-

d1499 :: Eq a

d1500 :: Eq b

d1501 :: Eq c

d1495 :: Eq (a, b, c)

-}

compare d1521 d1522 d1523 ((,,){-a b c-} x1 x2 x3)

((,,){-a b c-} y1 y2 y3)

= lexOrder (compare{-a-} d1521 x1 y1)

(lexOrder (compare{-b-} d1522 x2 y2)

(compare{-c-} d1523 x3 y3))

(<) d1527 d1528 d1529

= ($--<){-(a, b, c)-} d1526

where

d1526

= derived__Prelude_Ord_192_24{-a b c-} d1527 d1528

d1529

{-

d1526 :: Ord (a, b, c)

-}

(<=) d1536 d1537 d1538

= ($--<=){-(a, b, c)-} d1535

where

d1535

= derived__Prelude_Ord_192_24{-a b c-} d1536 d1537

d1538

{-

d1535 :: Ord (a, b, c)

-}

(>=) d1545 d1546 d1547

= ($-->=){-(a, b, c)-} d1544

where

d1544

= derived__Prelude_Ord_192_24{-a b c-} d1545 d1546

d1547

{-

d1544 :: Ord (a, b, c)

-}

(>) d1554 d1555 d1556

= ($-->){-(a, b, c)-} d1553

where

d1553

= derived__Prelude_Ord_192_24{-a b c-} d1554 d1555

d1556

{-

d1553 :: Ord (a, b, c)

-}

max d1563 d1564 d1565

= default__max{-(a, b, c)-} d1562

where

d1562

= derived__Prelude_Ord_192_24{-a b c-} d1563 d1564

d1565

{-

d1562 :: Ord (a, b, c)

-}

min d1572 d1573 d1574

= default__min{-(a, b, c)-} d1571

where

d1571

= derived__Prelude_Ord_192_24{-a b c-} d1572 d1573

d1574

{-

d1571 :: Ord (a, b, c)

-}

{-

super1_Ord ::

forall a b c . (Ord a, Ord b, Ord c) => Eq (a, b, c)

compare ::

forall a b c .

(Ord a, Ord b, Ord c) =>

(a, b, c) -> (a, b, c) -> Ordering

(<) ::

forall a b c .

(Ord a, Ord b, Ord c) =>

(a, b, c) -> (a, b, c) -> Bool

(<=) ::

forall a b c .

(Ord a, Ord b, Ord c) =>

(a, b, c) -> (a, b, c) -> Bool

(>=) ::

forall a b c .

(Ord a, Ord b, Ord c) =>

(a, b, c) -> (a, b, c) -> Bool

(>) ::

forall a b c .

(Ord a, Ord b, Ord c) =>

(a, b, c) -> (a, b, c) -> Bool

max ::

forall a b c .

(Ord a, Ord b, Ord c) =>

(a, b, c) -> (a, b, c) -> (a, b, c)

min ::

forall a b c .

(Ord a, Ord b, Ord c) =>

(a, b, c) -> (a, b, c) -> (a, b, c)

-}

instance (Show a, Show b, Show c) => Show (a, b, c)

where

showsPrec d1601 d1602 d1603 d

((,,){-a b c-} x1 x2 x3)

= showParenArg d

((.){-String String String-} (showString "(,,)")

((.){-String String String-}

(showArgument{-a-} d1601 x1)

((.){-String String String-}

(showArgument{-b-} d1602 x2)

(showArgument{-c-} d1603 x3))))

show d1607 d1608 d1609

= default__show{-(a, b, c)-} d1606

where

d1606

= derived__Prelude_Show_192_14{-a b c-} d1607 d1608

d1609

{-

d1606 :: Show (a, b, c)

-}

showList d1616 d1617 d1618

= default__showList{-(a, b, c)-} d1615

where

d1615

= derived__Prelude_Show_192_14{-a b c-} d1616 d1617

d1618

{-

d1615 :: Show (a, b, c)

-}

{-

showsPrec ::

forall a b c .

(Show a, Show b, Show c) => Int -> (a, b, c) -> ShowS

show ::

forall a b c .

(Show a, Show b, Show c) => (a, b, c) -> String

showList ::

forall a b c .

(Show a, Show b, Show c) => [(a, b, c)] -> ShowS

-}

instance (Eq a, Eq b, Eq c, Eq d) => Eq (a, b, c, d)

where

(==) d1647 d1648 d1649 d1650

((,,,){-a b c d-} x1 x2 x3 x4)

((,,,){-a b c d-} y1 y2 y3 y4)

= (&&) ((==){-a-} d1647 x1 y1)

((&&) ((==){-b-} d1648 x2 y2)

((&&) ((==){-c-} d1649 x3 y3)

((==){-d-} d1650 x4 y4)))

(/=) d1654 d1655 d1656 d1657

= ($--/=){-(a, b, c, d)-} d1653

where

d1653

= derived__Prelude_Eq_196_20{-a b c d-} d1654 d1655

d1656

d1657

{-

d1653 :: Eq (a, b, c, d)

-}

{-

(==) ::

forall a b c d .

(Eq a, Eq b, Eq c, Eq d) =>

(a, b, c, d) -> (a, b, c, d) -> Bool

(/=) ::

forall a b c d .

(Eq a, Eq b, Eq c, Eq d) =>

(a, b, c, d) -> (a, b, c, d) -> Bool

-}

instance (Ord a, Ord b, Ord c, Ord d) =>

Ord (a, b, c, d)

where

super1_Ord d1665 d1666 d1667 d1668

= super{-(Eq (a, b, c, d))-} d1664

where

d1669 = super1_Ord{-a-} d1665

d1670 = super1_Ord{-b-} d1666

d1671 = super1_Ord{-c-} d1667

d1672 = super1_Ord{-d-} d1668

d1664

= derived__Prelude_Eq_196_20{-a b c d-} d1669 d1670

d1671

d1672

{-

d1669 :: Eq a

d1670 :: Eq b

d1671 :: Eq c

d1672 :: Eq d

d1664 :: Eq (a, b, c, d)

-}

compare d1698 d1699 d1700 d1701

((,,,){-a b c d-} x1 x2 x3 x4)

((,,,){-a b c d-} y1 y2 y3 y4)

= lexOrder (compare{-a-} d1698 x1 y1)

(lexOrder (compare{-b-} d1699 x2 y2)

(lexOrder (compare{-c-} d1700 x3 y3)

(compare{-d-} d1701 x4 y4)))

(<) d1705 d1706 d1707 d1708

= ($--<){-(a, b, c, d)-} d1704

where

d1704

= derived__Prelude_Ord_196_24{-a b c d-} d1705

d1706

d1707

d1708

{-

d1704 :: Ord (a, b, c, d)

-}

(<=) d1716 d1717 d1718 d1719

= ($--<=){-(a, b, c, d)-} d1715

where

d1715

= derived__Prelude_Ord_196_24{-a b c d-} d1716

d1717

d1718

d1719

{-

d1715 :: Ord (a, b, c, d)

-}

(>=) d1727 d1728 d1729 d1730

= ($-->=){-(a, b, c, d)-} d1726

where

d1726

= derived__Prelude_Ord_196_24{-a b c d-} d1727

d1728

d1729

d1730

{-

d1726 :: Ord (a, b, c, d)

-}

(>) d1738 d1739 d1740 d1741

= ($-->){-(a, b, c, d)-} d1737

where

d1737

= derived__Prelude_Ord_196_24{-a b c d-} d1738

d1739

d1740

d1741

{-

d1737 :: Ord (a, b, c, d)

-}

max d1749 d1750 d1751 d1752

= default__max{-(a, b, c, d)-} d1748

where

d1748

= derived__Prelude_Ord_196_24{-a b c d-} d1749

d1750

d1751

d1752

{-

d1748 :: Ord (a, b, c, d)

-}

min d1760 d1761 d1762 d1763

= default__min{-(a, b, c, d)-} d1759

where

d1759

= derived__Prelude_Ord_196_24{-a b c d-} d1760

d1761

d1762

d1763

{-

d1759 :: Ord (a, b, c, d)

-}

{-

super1_Ord ::

forall a b c d .

(Ord a, Ord b, Ord c, Ord d) => Eq (a, b, c, d)

compare ::

forall a b c d .

(Ord a, Ord b, Ord c, Ord d) =>

(a, b, c, d) -> (a, b, c, d) -> Ordering

(<) ::

forall a b c d .

(Ord a, Ord b, Ord c, Ord d) =>

(a, b, c, d) -> (a, b, c, d) -> Bool

(<=) ::

forall a b c d .

(Ord a, Ord b, Ord c, Ord d) =>

(a, b, c, d) -> (a, b, c, d) -> Bool

(>=) ::

forall a b c d .

(Ord a, Ord b, Ord c, Ord d) =>

(a, b, c, d) -> (a, b, c, d) -> Bool

(>) ::

forall a b c d .

(Ord a, Ord b, Ord c, Ord d) =>

(a, b, c, d) -> (a, b, c, d) -> Bool

max ::

forall a b c d .

(Ord a, Ord b, Ord c, Ord d) =>

(a, b, c, d) -> (a, b, c, d) -> (a, b, c, d)

min ::

forall a b c d .

(Ord a, Ord b, Ord c, Ord d) =>

(a, b, c, d) -> (a, b, c, d) -> (a, b, c, d)

-}

instance (Show a, Show b, Show c, Show d) =>

Show (a, b, c, d)

where

showsPrec d1798 d1799 d1800 d1801 d

((,,,){-a b c d-} x1 x2 x3 x4)

= showParenArg d

((.){-String String String-} (showString "(,,,)")

((.){-String String String-}

(showArgument{-a-} d1798 x1)

((.){-String String String-}

(showArgument{-b-} d1799 x2)

((.){-String String String-}

(showArgument{-c-} d1800 x3)

(showArgument{-d-} d1801 x4)))))

show d1805 d1806 d1807 d1808

= default__show{-(a, b, c, d)-} d1804

where

d1804

= derived__Prelude_Show_196_14{-a b c d-} d1805

d1806

d1807

d1808

{-

d1804 :: Show (a, b, c, d)

-}

showList d1816 d1817 d1818 d1819

= default__showList{-(a, b, c, d)-} d1815

where

d1815

= derived__Prelude_Show_196_14{-a b c d-} d1816

d1817

d1818

d1819

{-

d1815 :: Show (a, b, c, d)

-}

{-

showsPrec ::

forall a b c d .

(Show a, Show b, Show c, Show d) =>

Int -> (a, b, c, d) -> ShowS

show ::

forall a b c d .

(Show a, Show b, Show c, Show d) =>

(a, b, c, d) -> String

showList ::

forall a b c d .

(Show a, Show b, Show c, Show d) =>

[(a, b, c, d)] -> ShowS

-}