hat-2.9.0.0: The Haskell tracer, generating and viewing Haskell execution traces

Safe HaskellNone
LanguageHaskell98

Hat.PreludeBasic

Synopsis

Documentation

hyield :: R a -> R (ReadS___1 a) -> RefExp -> R (ReadS___2 a) Source

glift :: RefSrcPos -> RefExp -> R (Fun (Fun a (Fun b (ReadS c))) (Fun (ReadS a) (Fun (ReadS b) (ReadS c)))) Source

hlift :: R (Fun a (Fun b (ReadS c))) -> R (ReadS a) -> R (ReadS b) -> R (ReadS___1 c) -> RefExp -> R (ReadS___2 c) Source

gthenAp :: RefSrcPos -> RefExp -> R (Fun (ReadS (Fun a b)) (Fun (ReadS a) (ReadS b))) Source

hthenLex :: R (ReadS a) -> R String -> RefExp -> R (ReadS a) Source

galt :: RefSrcPos -> RefExp -> R (Fun (ReadS a) (Fun (ReadS a) (ReadS a))) Source

halt :: R (ReadS a) -> R (ReadS a) -> R (ReadS___1 a) -> RefExp -> R (ReadS___2 a) Source

class Eq a where Source

Minimal complete definition

(|==), (|/=)

Methods

(!==), (!/=) :: RefSrcPos -> RefExp -> R (Fun a (Fun a Bool)) Source

(|==), (|/=) :: R (Fun a (Fun a Bool)) Source

Instances

Eq Bool 
Eq Char 
Eq Double 
Eq Float 
Eq Int 
Eq Integer 
Eq Handle 
Eq HandlePosn 
Eq ClockTime 
Eq Tuple0 
Eq Ordering 
Eq Permissions 
Eq TimeLocale 
Eq ExitCode 
Eq SeekMode 
Eq BufferMode 
Eq IOMode 
Eq TimeDiff 
Eq CalendarTime 
Eq Day 
Eq Month 
Eq GeneralCategory 
Eq a => Eq (List a) 
Eq a => Eq (Ratio a) 
Eq a => Eq (Maybe a) 
Eq a => Eq (Complex a) 
(Eq a, Eq b) => Eq (Tuple2 a b) 
(Eq a, Eq b) => Eq (Either a b) 
(Ix a, Eq b) => Eq (Array a b) 
(Eq a, Eq b, Eq c) => Eq (Tuple3 a b c) 
(Eq a, Eq b, Eq c, Eq d) => Eq (Tuple4 a b c d) 
(Eq a, Eq b, Eq c, Eq d, Eq e) => Eq (Tuple5 a b c d e) 
(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f) => Eq (Tuple6 a b c d e f) 
(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g) => Eq (Tuple7 a b c d e f g) 
(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h) => Eq (Tuple8 a b c d e f g h) 
(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i) => Eq (Tuple9 a b c d e f g h i) 
(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j) => Eq (Tuple10 a b c d e f g h i j) 
(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j, Eq k) => Eq (Tuple11 a b c d e f g h i j k) 
(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j, Eq k, Eq l) => Eq (Tuple12 a b c d e f g h i j k l) 
(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j, Eq k, Eq l, Eq m) => Eq (Tuple13 a b c d e f g h i j k l m) 
(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j, Eq k, Eq l, Eq m, Eq n) => Eq (Tuple14 a b c d e f g h i j k l m n) 
(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j, Eq k, Eq l, Eq m, Eq n, Eq o) => Eq (Tuple15 a b c d e f g h i j k l m n o) 

class Eq a => Ord a where Source

Minimal complete definition

scompare, (|<), (|>), (|>=), (|<=), smax, smin

Methods

gcompare :: RefSrcPos -> RefExp -> R (Fun a (Fun a Ordering)) Source

scompare :: R (Fun a (Fun a Ordering)) Source

(!<), (!>), (!>=), (!<=) :: RefSrcPos -> RefExp -> R (Fun a (Fun a Bool)) Source

(|<), (|>), (|>=), (|<=) :: R (Fun a (Fun a Bool)) Source

gmax, gmin :: RefSrcPos -> RefExp -> R (Fun a (Fun a a)) Source

smax, smin :: R (Fun a (Fun a a)) Source

Instances

Ord Bool 
Ord Char 
Ord Double 
Ord Float 
Ord Int 
Ord Integer 
Ord ClockTime 
Ord Tuple0 
Ord Ordering 
Ord Permissions 
Ord TimeLocale 
Ord ExitCode 
Ord SeekMode 
Ord BufferMode 
Ord IOMode 
Ord TimeDiff 
Ord CalendarTime 
Ord Day 
Ord Month 
Ord GeneralCategory 
Ord a => Ord (List a) 
Integral a => Ord (Ratio a) 
Ord a => Ord (Maybe a) 
(Ord a, Ord b) => Ord (Tuple2 a b) 
(Ord a, Ord b) => Ord (Either a b) 
(Ix a, Ord b) => Ord (Array a b) 
(Ord a, Ord b, Ord c) => Ord (Tuple3 a b c) 
(Ord a, Ord b, Ord c, Ord d) => Ord (Tuple4 a b c d) 
(Ord a, Ord b, Ord c, Ord d, Ord e) => Ord (Tuple5 a b c d e) 
(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f) => Ord (Tuple6 a b c d e f) 
(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g) => Ord (Tuple7 a b c d e f g) 
(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h) => Ord (Tuple8 a b c d e f g h) 
(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i) => Ord (Tuple9 a b c d e f g h i) 
(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i, Ord j) => Ord (Tuple10 a b c d e f g h i j) 
(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i, Ord j, Ord k) => Ord (Tuple11 a b c d e f g h i j k) 
(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i, Ord j, Ord k, Ord l) => Ord (Tuple12 a b c d e f g h i j k l) 
(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i, Ord j, Ord k, Ord l, Ord m) => Ord (Tuple13 a b c d e f g h i j k l m) 
(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i, Ord j, Ord k, Ord l, Ord m, Ord n) => Ord (Tuple14 a b c d e f g h i j k l m n) 
(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i, Ord j, Ord k, Ord l, Ord m, Ord n, Ord o) => Ord (Tuple15 a b c d e f g h i j k l m n o) 

class Bounded a where Source

Minimal complete definition

gminBound, gmaxBound

Instances

Bounded Bool 
Bounded Char 
Bounded Int 
Bounded Tuple0 
Bounded Ordering 
Bounded SeekMode 
Bounded IOMode 
Bounded Day 
Bounded Month 
Bounded GeneralCategory 
(Bounded a, Bounded b) => Bounded (Tuple2 a b) 
(Bounded a, Bounded b, Bounded c) => Bounded (Tuple3 a b c) 
(Bounded a, Bounded b, Bounded c, Bounded d) => Bounded (Tuple4 a b c d) 
(Bounded a, Bounded b, Bounded c, Bounded d, Bounded e) => Bounded (Tuple5 a b c d e) 
(Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f) => Bounded (Tuple6 a b c d e f) 
(Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g) => Bounded (Tuple7 a b c d e f g) 
(Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h) => Bounded (Tuple8 a b c d e f g h) 
(Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i) => Bounded (Tuple9 a b c d e f g h i) 
(Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i, Bounded j) => Bounded (Tuple10 a b c d e f g h i j) 
(Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i, Bounded j, Bounded k) => Bounded (Tuple11 a b c d e f g h i j k) 
(Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i, Bounded j, Bounded k, Bounded l) => Bounded (Tuple12 a b c d e f g h i j k l) 
(Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i, Bounded j, Bounded k, Bounded l, Bounded m) => Bounded (Tuple13 a b c d e f g h i j k l m) 
(Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i, Bounded j, Bounded k, Bounded l, Bounded m, Bounded n) => Bounded (Tuple14 a b c d e f g h i j k l m n) 
(Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i, Bounded j, Bounded k, Bounded l, Bounded m, Bounded n, Bounded o) => Bounded (Tuple15 a b c d e f g h i j k l m n o) 

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

Minimal complete definition

(!+), (!*), (|-), snegate, gabs, gsignum, gfromInteger

Instances

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

Minimal complete definition

gtoRational

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

Minimal complete definition

squot, srem, sdiv, smod, gquotRem, sdivMod, gtoInteger

Methods

gquot, grem :: RefSrcPos -> RefExp -> R (Fun a (Fun a a)) Source

squot, srem :: R (Fun a (Fun a a)) Source

gdiv, gmod :: RefSrcPos -> RefExp -> R (Fun a (Fun a a)) Source

sdiv, smod :: R (Fun a (Fun a a)) Source

gquotRem, gdivMod :: RefSrcPos -> RefExp -> R (Fun a (Fun a (Tuple2 a a))) Source

squotRem, sdivMod :: R (Fun a (Fun a (Tuple2 a a))) Source

gtoInteger :: RefSrcPos -> RefExp -> R (Fun a Integer) Source

stoInteger :: R (Fun a Integer) Source

class Num a => Fractional a where Source

Minimal complete definition

(|/), srecip, gfromRational

gsubtract :: Num a => RefSrcPos -> RefExp -> R (Fun a (Fun a a)) Source

heven :: Integral a => R a -> RefExp -> R Bool Source

ggcd :: Integral a => RefSrcPos -> RefExp -> R (Fun a (Fun a a)) Source

hgcd :: Integral a => R a -> R a -> RefExp -> R a Source

glcm :: Integral a => RefSrcPos -> RefExp -> R (Fun a (Fun a a)) Source

hlcm :: Integral a => R a -> R a -> RefExp -> R a Source

(!^) :: (Num a, Integral b) => RefSrcPos -> RefExp -> R (Fun a (Fun b a)) Source

(*^) :: (Num a, Integral b) => R a -> R b -> RefExp -> R a Source

(!^^) :: (Fractional a, Integral b) => RefSrcPos -> RefExp -> R (Fun a (Fun b a)) Source

(*^^) :: (Fractional a, Integral b) => R a -> R b -> RefExp -> R a Source

class Functor f where Source

Minimal complete definition

gfmap

Methods

gfmap :: RefSrcPos -> RefExp -> R (Fun (Fun a b) (Fun (f a) (f b))) Source

sfmap :: R (Fun (Fun a b) (Fun (f a) (f b))) Source

Instances

class Monad m where Source

Minimal complete definition

(!>>=), (|>>), greturn, sfail

Methods

(!>>=) :: RefSrcPos -> RefExp -> R (Fun (m a) (Fun (Fun a (m b)) (m b))) Source

(|>>=) :: R (Fun (m a) (Fun (Fun a (m b)) (m b))) Source

(!>>) :: RefSrcPos -> RefExp -> R (Fun (m a) (Fun (m b) (m b))) Source

(|>>) :: R (Fun (m a) (Fun (m b) (m b))) Source

greturn :: RefSrcPos -> RefExp -> R (Fun a (m a)) Source

sreturn :: R (Fun a (m a)) Source

gfail :: RefSrcPos -> RefExp -> R (Fun String (m a)) Source

sfail :: R (Fun String (m a)) Source

Instances

gsequence :: Monad m => RefSrcPos -> RefExp -> R (Fun (List (m a)) (m (List a))) Source

gsequence_ :: Monad m => RefSrcPos -> RefExp -> R (Fun (List (m a)) (m Tuple0)) Source

gmapM :: Monad m => RefSrcPos -> RefExp -> R (Fun (Fun a (m b)) (Fun (List a) (m (List b)))) Source

hmapM :: Monad m => R (Fun a (m b)) -> R (List a) -> RefExp -> R (m (List b)) Source

gmapM_ :: Monad m => RefSrcPos -> RefExp -> R (Fun (Fun a (m b)) (Fun (List a) (m Tuple0))) Source

hmapM_ :: Monad m => R (Fun a (m b)) -> R (List a) -> RefExp -> R (m Tuple0) Source

(!=<<) :: Monad m => RefSrcPos -> RefExp -> R (Fun (Fun a (m b)) (Fun (m a) (m b))) Source

(*=<<) :: Monad m => R (Fun a (m b)) -> R (m a) -> RefExp -> R (m b) Source

gid :: RefSrcPos -> RefExp -> R (Fun a a) Source

hid :: R a -> RefExp -> R a Source

gconst :: RefSrcPos -> RefExp -> R (Fun a (Fun b a)) Source

hconst :: R a -> R b -> RefExp -> R a Source

(!.) :: RefSrcPos -> RefExp -> R (Fun (Fun b c) (Fun (Fun a b) (Fun a c))) Source

(*.) :: R (Fun b c) -> R (Fun a b) -> R a -> RefExp -> R c Source

gflip :: RefSrcPos -> RefExp -> R (Fun (Fun a (Fun b c)) (Fun b (Fun a c))) Source

hflip :: R (Fun a (Fun b c)) -> R b -> R a -> RefExp -> R c Source

(!$) :: RefSrcPos -> RefExp -> R (Fun (Fun a b) (Fun a b)) Source

(*$) :: R (Fun a b) -> R a -> RefExp -> R b Source

(!$!) :: RefSrcPos -> RefExp -> R (Fun (Fun a b) (Fun a b)) Source

(*$!) :: R (Fun a b) -> R a -> RefExp -> R b Source

data Maybe a Source

Constructors

Nothing 
Just (R a) 

Instances

Monad Maybe 
Functor Maybe 
MonadPlus Maybe 
WrapVal (Maybe a) 
Show a => Show (Maybe a) 
Read a => Read (Maybe a) 
Ord a => Ord (Maybe a) 
Eq a => Eq (Maybe a) 

gmaybe :: RefSrcPos -> RefExp -> R (Fun b (Fun (Fun a b) (Fun (Maybe a) b))) Source

hmaybe :: R b -> R (Fun a b) -> R (Maybe a) -> RefExp -> R b Source

data Either a b Source

Constructors

Left (R a) 
Right (R b) 

Instances

WrapVal (Either a b) 
(Show a, Show b) => Show (Either a b) 
(Read a, Read b) => Read (Either a b) 
(Ord a, Ord b) => Ord (Either a b) 
(Eq a, Eq b) => Eq (Either a b) 

geither :: RefSrcPos -> RefExp -> R (Fun (Fun a c) (Fun (Fun b c) (Fun (Either a b) c))) Source

heither :: R (Fun a c) -> R (Fun b c) -> R (Either a b) -> RefExp -> R c Source

hnumericEnumFromTo :: (Fractional a, Ord a) => R a -> R a -> RefExp -> R (List a) Source

hnumericEnumFromThenTo :: (Fractional a, Ord a) => R a -> R a -> R a -> RefExp -> R (List a) Source

gfst :: RefSrcPos -> RefExp -> R (Fun (Tuple2 a b) a) Source

hfst :: R (Tuple2 a b) -> RefExp -> R a Source

gsnd :: RefSrcPos -> RefExp -> R (Fun (Tuple2 a b) b) Source

hsnd :: R (Tuple2 a b) -> RefExp -> R b Source

gcurry :: RefSrcPos -> RefExp -> R (Fun (Fun (Tuple2 a b) c) (Fun a (Fun b c))) Source

hcurry :: R (Fun (Tuple2 a b) c) -> R a -> R b -> RefExp -> R c Source

guncurry :: RefSrcPos -> RefExp -> R (Fun (Fun a (Fun b c)) (Fun (Tuple2 a b) c)) Source

huncurry :: R (Fun a (Fun b c)) -> R (Tuple2 a b) -> RefExp -> R c Source

guntil :: RefSrcPos -> RefExp -> R (Fun (Fun a Bool) (Fun (Fun a a) (Fun a a))) Source

huntil :: R (Fun a Bool) -> R (Fun a a) -> R a -> RefExp -> R a Source

gasTypeOf :: RefSrcPos -> RefExp -> R (Fun a (Fun a a)) Source

g_foldr :: RefSrcPos -> RefExp -> R (Fun (Fun a (Fun b b)) (Fun (List a) (Fun b b))) Source

h_foldr :: R (Fun a (Fun b b)) -> R (List a) -> R b -> RefExp -> R b Source

g_filter :: RefSrcPos -> RefExp -> R (Fun Bool (Fun (Fun (List a) (List a)) (Fun (List a) (List a)))) Source

h_filter :: R Bool -> R (Fun (List a) (List a)) -> R (List a) -> RefExp -> R (List a) Source

gmap :: RefSrcPos -> RefExp -> R (Fun (Fun a b) (Fun (List a) (List b))) Source

hmap :: R (Fun a b) -> R (List a) -> RefExp -> R (List b) Source

(!++) :: RefSrcPos -> RefExp -> R (Fun (List a) (Fun (List a) (List a))) Source

(*++) :: R (List a) -> R (List a) -> RefExp -> R (List a) Source

gfilter :: RefSrcPos -> RefExp -> R (Fun (Fun a Bool) (Fun (List a) (List a))) Source

hfilter :: R (Fun a Bool) -> R (List a) -> RefExp -> R (List a) Source

hconcat :: R (List (List a)) -> RefExp -> R (List a) Source

ghead :: RefSrcPos -> RefExp -> R (Fun (List a) a) Source

hhead :: R (List a) -> RefExp -> R a Source

glast :: RefSrcPos -> RefExp -> R (Fun (List a) a) Source

hlast :: R (List a) -> RefExp -> R a Source

gtail :: RefSrcPos -> RefExp -> R (Fun (List a) (List a)) Source

htail :: R (List a) -> RefExp -> R (List a) Source

ginit :: RefSrcPos -> RefExp -> R (Fun (List a) (List a)) Source

hinit :: R (List a) -> RefExp -> R (List a) Source

hnull :: R (List a) -> RefExp -> R Bool Source

hlength :: R (List a) -> RefExp -> R Int Source

(!!!) :: RefSrcPos -> RefExp -> R (Fun (List a) (Fun Int a)) Source

(*!!) :: R (List a) -> R Int -> RefExp -> R a Source

gfoldl :: RefSrcPos -> RefExp -> R (Fun (Fun a (Fun b a)) (Fun a (Fun (List b) a))) Source

hfoldl :: R (Fun a (Fun b a)) -> R a -> R (List b) -> RefExp -> R a Source

gfoldl1 :: RefSrcPos -> RefExp -> R (Fun (Fun a (Fun a a)) (Fun (List a) a)) Source

hfoldl1 :: R (Fun a (Fun a a)) -> R (List a) -> RefExp -> R a Source

gscanl :: RefSrcPos -> RefExp -> R (Fun (Fun a (Fun b a)) (Fun a (Fun (List b) (List a)))) Source

hscanl :: R (Fun a (Fun b a)) -> R a -> R (List b) -> RefExp -> R (List a) Source

gscanl1 :: RefSrcPos -> RefExp -> R (Fun (Fun a (Fun a a)) (Fun (List a) (List a))) Source

hscanl1 :: R (Fun a (Fun a a)) -> R (List a) -> RefExp -> R (List a) Source

gfoldr :: RefSrcPos -> RefExp -> R (Fun (Fun a (Fun b b)) (Fun b (Fun (List a) b))) Source

hfoldr :: R (Fun a (Fun b b)) -> R b -> R (List a) -> RefExp -> R b Source

gfoldr1 :: RefSrcPos -> RefExp -> R (Fun (Fun a (Fun a a)) (Fun (List a) a)) Source

hfoldr1 :: R (Fun a (Fun a a)) -> R (List a) -> RefExp -> R a Source

gscanr :: RefSrcPos -> RefExp -> R (Fun (Fun a (Fun b b)) (Fun b (Fun (List a) (List b)))) Source

hscanr :: R (Fun a (Fun b b)) -> R b -> R (List a) -> RefExp -> R (List b) Source

gscanr1 :: RefSrcPos -> RefExp -> R (Fun (Fun a (Fun a a)) (Fun (List a) (List a))) Source

hscanr1 :: R (Fun a (Fun a a)) -> R (List a) -> RefExp -> R (List a) Source

giterate :: RefSrcPos -> RefExp -> R (Fun (Fun a a) (Fun a (List a))) Source

hiterate :: R (Fun a a) -> R a -> RefExp -> R (List a) Source

hrepeat :: R a -> RefExp -> R (List a) Source

hreplicate :: R Int -> R a -> RefExp -> R (List a) Source

gcycle :: RefSrcPos -> RefExp -> R (Fun (List a) (List a)) Source

hcycle :: R (List a) -> RefExp -> R (List a) Source

gtake :: RefSrcPos -> RefExp -> R (Fun Int (Fun (List a) (List a))) Source

htake :: R Int -> R (List a) -> RefExp -> R (List a) Source

gdrop :: RefSrcPos -> RefExp -> R (Fun Int (Fun (List a) (List a))) Source

hdrop :: R Int -> R (List a) -> RefExp -> R (List a) Source

gsplitAt :: RefSrcPos -> RefExp -> R (Fun Int (Fun (List a) (Tuple2 (List a) (List a)))) Source

hsplitAt :: R Int -> R (List a) -> RefExp -> R (Tuple2 (List a) (List a)) Source

htakeWhile :: R (Fun a Bool) -> R (List a) -> RefExp -> R (List a) Source

hdropWhile :: R (Fun a Bool) -> R (List a) -> RefExp -> R (List a) Source

gspan :: RefSrcPos -> RefExp -> R (Fun (Fun a Bool) (Fun (List a) (Tuple2 (List a) (List a)))) Source

hspan :: R (Fun a Bool) -> R (List a) -> RefExp -> R (Tuple2 (List a) (List a)) Source

gbreak :: RefSrcPos -> RefExp -> R (Fun (Fun a Bool) (Fun (List a) (Tuple2 (List a) (List a)))) Source

hbreak :: R (Fun a Bool) -> RefExp -> R (Fun (List a) (Tuple2 (List a) (List a))) Source

hany :: R (Fun a Bool) -> RefExp -> R (Fun (List a) Bool) Source

hall :: R (Fun a Bool) -> RefExp -> R (Fun (List a) Bool) Source

gelem :: Eq a => RefSrcPos -> RefExp -> R (Fun a (Fun (List a) Bool)) Source

helem :: Eq a => R a -> RefExp -> R (Fun (List a) Bool) Source

gnotElem :: Eq a => RefSrcPos -> RefExp -> R (Fun a (Fun (List a) Bool)) Source

hnotElem :: Eq a => R a -> RefExp -> R (Fun (List a) Bool) Source

glookup :: Eq a => RefSrcPos -> RefExp -> R (Fun a (Fun (List (Tuple2 a b)) (Maybe b))) Source

hlookup :: Eq a => R a -> R (List (Tuple2 a b)) -> RefExp -> R (Maybe b) Source

gsum :: Num a => RefSrcPos -> RefExp -> R (Fun (List a) a) Source

gproduct :: Num a => RefSrcPos -> RefExp -> R (Fun (List a) a) Source

gmaximum :: Ord a => RefSrcPos -> RefExp -> R (Fun (List a) a) Source

hmaximum :: Ord a => R (List a) -> RefExp -> R a Source

gminimum :: Ord a => RefSrcPos -> RefExp -> R (Fun (List a) a) Source

hminimum :: Ord a => R (List a) -> RefExp -> R a Source

gconcatMap :: RefSrcPos -> RefExp -> R (Fun (Fun a (List b)) (Fun (List a) (List b))) Source

hconcatMap :: R (Fun a (List b)) -> RefExp -> R (Fun (List a) (List b)) Source

gzip :: RefSrcPos -> RefExp -> R (Fun (List a) (Fun (List b) (List (Tuple2 a b)))) Source

gzip3 :: RefSrcPos -> RefExp -> R (Fun (List a) (Fun (List b) (Fun (List c) (List (Tuple3 a b c))))) Source

gzipWith :: RefSrcPos -> RefExp -> R (Fun (Fun a (Fun b c)) (Fun (List a) (Fun (List b) (List c)))) Source

hzipWith :: R (Fun a (Fun b c)) -> R (List a) -> R (List b) -> RefExp -> R (List c) Source

gzipWith3 :: RefSrcPos -> RefExp -> R (Fun (Fun a (Fun b (Fun c d))) (Fun (List a) (Fun (List b) (Fun (List c) (List d))))) Source

hzipWith3 :: R (Fun a (Fun b (Fun c d))) -> R (List a) -> R (List b) -> R (List c) -> RefExp -> R (List d) Source

gunzip :: RefSrcPos -> RefExp -> R (Fun (List (Tuple2 a b)) (Tuple2 (List a) (List b))) Source

gunzip3 :: RefSrcPos -> RefExp -> R (Fun (List (Tuple3 a b c)) (Tuple3 (List a) (List b) (List c))) Source

class Read a where Source

Minimal complete definition

greadsPrec

Instances

Read Bool 
Read Char 
Read Double 
Read Float 
Read Int 
Read Integer 
Read StdGen 
Read Tuple0 
Read Ordering 
Read Permissions 
Read ExitCode 
Read SeekMode 
Read BufferMode 
Read IOMode 
Read TimeDiff 
Read CalendarTime 
Read Day 
Read Month 
Read GeneralCategory 
Read a => Read (List a) 
(Read a, Integral a) => Read (Ratio a) 
Read a => Read (Maybe a) 
Read a => Read (Complex a) 
(Read a, Read b) => Read (Tuple2 a b) 
(Read a, Read b) => Read (Either a b) 
(Ix a, Read a, Read b) => Read (Array a b) 
(Read a, Read b, Read c) => Read (Tuple3 a b c) 
(Read a, Read b, Read c, Read d) => Read (Tuple4 a b c d) 
(Read a, Read b, Read c, Read d, Read e) => Read (Tuple5 a b c d e) 
(Read a, Read b, Read c, Read d, Read e, Read f) => Read (Tuple6 a b c d e f) 
(Read a, Read b, Read c, Read d, Read e, Read f, Read g) => Read (Tuple7 a b c d e f g) 
(Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h) => Read (Tuple8 a b c d e f g h) 
(Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i) => Read (Tuple9 a b c d e f g h i) 
(Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j) => Read (Tuple10 a b c d e f g h i j) 
(Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j, Read k) => Read (Tuple11 a b c d e f g h i j k) 
(Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j, Read k, Read l) => Read (Tuple12 a b c d e f g h i j k l) 
(Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j, Read k, Read l, Read m) => Read (Tuple13 a b c d e f g h i j k l m) 
(Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j, Read k, Read l, Read m, Read n) => Read (Tuple14 a b c d e f g h i j k l m n) 
(Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j, Read k, Read l, Read m, Read n, Read o) => Read (Tuple15 a b c d e f g h i j k l m n o) 

class Show a where Source

Minimal complete definition

sshowsPrec, sshow, sshowList

Instances

Show Bool 
Show Char 
Show Double 
Show Float 
Show Int 
Show Integer 
Show Handle 
Show StdGen 
Show Tuple0 
Show Ordering 
Show Permissions 
Show TimeLocale 
Show ExitCode 
Show SeekMode 
Show BufferMode 
Show IOMode 
Show TimeDiff 
Show CalendarTime 
Show Day 
Show Month 
Show GeneralCategory 
Show a => Show (List a) 
Integral a => Show (Ratio a) 
Show a => Show (Maybe a) 
Show a => Show (Complex a) 
(Show a, Show b) => Show (Tuple2 a b) 
(Show a, Show b) => Show (Either a b) 
(Ix a, Show a, Show b) => Show (Array a b) 
(Show a, Show b, Show c) => Show (Tuple3 a b c) 
(Show a, Show b, Show c, Show d) => Show (Tuple4 a b c d) 
(Show a, Show b, Show c, Show d, Show e) => Show (Tuple5 a b c d e) 
(Show a, Show b, Show c, Show d, Show e, Show f) => Show (Tuple6 a b c d e f) 
(Show a, Show b, Show c, Show d, Show e, Show f, Show g) => Show (Tuple7 a b c d e f g) 
(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h) => Show (Tuple8 a b c d e f g h) 
(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i) => Show (Tuple9 a b c d e f g h i) 
(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j) => Show (Tuple10 a b c d e f g h i j) 
(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k) => Show (Tuple11 a b c d e f g h i j k) 
(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k, Show l) => Show (Tuple12 a b c d e f g h i j k l) 
(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k, Show l, Show m) => Show (Tuple13 a b c d e f g h i j k l m) 
(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k, Show l, Show m, Show n) => Show (Tuple14 a b c d e f g h i j k l m n) 
(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k, Show l, Show m, Show n, Show o) => Show (Tuple15 a b c d e f g h i j k l m n o) 

hread :: Read a => R String -> RefExp -> R a Source

hreadParen :: R Bool -> R (ReadS a) -> RefExp -> R (ReadS a) Source

hprint :: Show a => R a -> RefExp -> R (IO Tuple0) Source

hreadIO :: Read a => R String -> RefExp -> R (IO a) Source

greadLn :: Read a => RefSrcPos -> RefExp -> R (IO a) Source

hprotectEsc :: R (Fun Char Bool) -> R (Fun (List Char) c) -> RefExp -> R (Fun (List Char) c) Source

hshowSigned :: Real a => R (Fun a ShowS) -> R Int -> R a -> RefExp -> R ShowS Source

hreadSigned :: Real a => R (ReadS a) -> RefExp -> R (ReadS a) Source

hreadInt :: Integral a => R a -> R (Fun Char Bool) -> R (Fun Char Int) -> R (ReadS___1 a) -> RefExp -> R (ReadS___2 a) Source

data Ratio a Source

Constructors

!(R a) :% !(R a) 

Instances

WrapVal (Ratio a) 
Integral a => Show (Ratio a) 
(Read a, Integral a) => Read (Ratio a) 
Integral a => RealFrac (Ratio a) 
Integral a => Fractional (Ratio a) 
Integral a => Real (Ratio a) 
Integral a => Num (Ratio a) 
Integral a => Enum (Ratio a) 
Integral a => Ord (Ratio a) 
Eq a => Eq (Ratio a) 

greduce :: Integral b => RefSrcPos -> RefExp -> R (Fun b (Fun b (Ratio b))) Source

hreduce :: Integral b => R b -> R b -> RefExp -> R (Ratio b) Source

(!%) :: Integral a => RefSrcPos -> RefExp -> R (Fun a (Fun a (Ratio a))) Source

(*%) :: Integral a => R a -> R a -> RefExp -> R (Ratio a) Source

hnumerator :: Integral a => R (Ratio a) -> RefExp -> R a Source

hdenominator :: Integral a => R (Ratio a) -> RefExp -> R a Source

data Char :: *

The character type Char is an enumeration whose values represent Unicode (or equivalently ISO/IEC 10646) characters (see http://www.unicode.org/ for details). This set extends the ISO 8859-1 (Latin-1) character set (the first 256 characters), which is itself an extension of the ASCII character set (the first 128 characters). A character literal in Haskell has type Char.

To convert a Char to or from the corresponding Int value defined by Unicode, use toEnum and fromEnum from the Enum class respectively (or equivalently ord and chr).

data Int :: *

A fixed-precision integer type with at least the range [-2^29 .. 2^29-1]. The exact range for a given implementation can be determined by using minBound and maxBound from the Bounded class.

data Float :: *

Single-precision floating point numbers. It is desirable that this type be at least equal in range and precision to the IEEE single-precision type.

data Double :: *

Double-precision floating point numbers. It is desirable that this type be at least equal in range and precision to the IEEE double-precision type.

type IOError = IOException

The Haskell 2010 type for exceptions in the IO monad. Any I/O operation may raise an IOError instead of returning a result. For a more general type of exception, including also those that arise in pure code, see Control.Exception.Exception.

In Haskell 2010, this is an opaque type.

data IO a Source

Instances

gseq :: RefSrcPos -> RefExp -> R (Fun a (Fun b b)) Source

hseq :: R a1 -> R a -> RefExp -> R a Source

gprimIOBind :: RefSrcPos -> RefExp -> R (Fun (IO a) (Fun (Fun a (IO b)) (IO b))) Source

hprimIOBind :: R (IO a) -> R (Fun a (IO b)) -> RefExp -> R (IO b) Source

hprimIOReturn :: R b -> RefExp -> R (IO b) Source

gcatch :: RefSrcPos -> RefExp -> R (Fun (IO a) (Fun (Fun IOError (IO a)) (IO a))) Source

hcatch :: R (IO b) -> R (Fun IOError (IO b)) -> RefExp -> R (IO b) Source