1 We add the option -fno-implicit-prelude here to tell the reader that
2 special names such as () and -> shouldn't be resolved to Prelude.()
3 and Prelude.-> (as they are normally). -- SDM 8/10/97
6 {-# OPTIONS -fno-implicit-prelude #-}
10 -- Everything corresponding to the Report's PreludeList
12 lines, words, unlines, unwords,
15 -- Everything corresponding to the Report's PreludeText
17 Read(readsPrec, readList),
18 Show(showsPrec, showList, show),
19 reads, shows, read, lex,
20 showChar, showString, readParen, showParen,
22 -- Everything corresponding to the Report's PreludeIO
24 ioError, userError, catch,
25 putChar, putStr, putStrLn, print,
26 getChar, getLine, getContents, interact,
27 readFile, writeFile, appendFile, readIO, readLn,
33 Char, String, Int, Integer, Float, Double, IO,
38 -- Includes tuple types + fst, snd, curry, uncurry
39 ()(..), -- The unit type
46 Num((+), (-), (*), negate, abs, signum, fromInteger),
47 -- The fromInt method is exposed only by GlaExts
49 Integral(quot, rem, div, mod, quotRem, divMod, toInteger),
50 -- The toInt method is exposed only by GlaExts
56 -- Monad stuff, from PrelBase, and defined here
59 mapM, mapM_, sequence, sequence_, (=<<),
62 (&&), (||), not, otherwise,
63 subtract, even, odd, gcd, lcm, (^), (^^),
64 fromIntegral, realToFrac,
65 --exported by PrelTup: fst, snd, curry, uncurry,
66 id, const, (.), flip, ($), until,
67 asTypeOf, error, undefined,
74 #ifndef USE_REPORT_PRELUDE
75 hiding ( takeUInt_append )
89 import PrelErr ( error )
96 %*********************************************************
98 \subsection{Miscellaneous functions}
100 %*********************************************************
103 ($!) :: (a -> b) -> a -> b
106 -- It is expected that compilers will recognize this and insert error
107 -- messages which are more appropriate to the context in which undefined
111 undefined = error "Prelude.undefined"
115 %*********************************************************
117 \subsection{List sum and product}
119 %*********************************************************
121 List sum and product are defined here because PrelList is too far
122 down the compilation chain to "see" the Num class.
125 -- sum and product compute the sum or product of a finite list of numbers.
126 {-# SPECIALISE sum :: [Int] -> Int #-}
127 {-# SPECIALISE sum :: [Integer] -> Integer #-}
128 {-# SPECIALISE product :: [Int] -> Int #-}
129 {-# SPECIALISE product :: [Integer] -> Integer #-}
130 sum, product :: (Num a) => [a] -> a
131 #ifdef USE_REPORT_PRELUDE
133 product = foldl (*) 1
138 sum' (x:xs) a = sum' xs (a+x)
142 prod (x:xs) a = prod xs (a*x)
147 %*********************************************************
149 \subsection{Prelude monad functions}
151 %*********************************************************
154 {-# SPECIALISE (=<<) :: (a -> [b]) -> [a] -> [b] #-}
155 (=<<) :: Monad m => (a -> m b) -> m a -> m b
158 sequence :: Monad m => [m a] -> m [a]
159 {-# INLINE sequence #-}
160 sequence ms = foldr k (return []) ms
162 k m m' = do { x <- m; xs <- m'; return (x:xs) }
164 sequence_ :: Monad m => [m a] -> m ()
165 {-# INLINE sequence_ #-}
166 sequence_ ms = foldr (>>) (return ()) ms
168 mapM :: Monad m => (a -> m b) -> [a] -> m [b]
170 mapM f as = sequence (map f as)
172 mapM_ :: Monad m => (a -> m b) -> [a] -> m ()
174 mapM_ f as = sequence_ (map f as)
178 %*********************************************************
180 \subsection{Coercions}
182 %*********************************************************
185 {-# SPECIALIZE fromIntegral ::
195 Integer -> Double #-}
196 fromIntegral :: (Integral a, Num b) => a -> b
197 fromIntegral = fromInteger . toInteger
199 {-# SPECIALIZE realToFrac ::
204 Rational -> Rational,
209 realToFrac :: (Real a, Fractional b) => a -> b
210 realToFrac = fromRational . toRational