p

p :: Html -> Html
html Text.Html
p :: Html -> Html
xhtml Text.XHtml.Strict, xhtml Text.XHtml.Frameset, xhtml Text.XHtml.Transitional
Same as paragraph.
pi :: Floating a => a
base Prelude
pred :: Enum a => a -> a
base Prelude
print :: Show a => a -> IO ()
base Prelude, base System.IO
The print function outputs a value of any printable type to the standard output device. Printable types are those that are instances of class Show; print converts values to strings for output using the show operation and adds a newline. For example, a program to print the first 20 integers and their powers of 2 could be written as: > main = print ([(n, 2^n) | n <- [0..19]])
product :: Num a => [a] -> a
base Prelude, base Data.List
The product function computes the product of a finite list of numbers.
properFraction :: (RealFrac a, Integral b) => a -> (b, a)
base Prelude
putChar :: Char -> IO ()
base Prelude, base System.IO
Write a character to the standard output device (same as hPutChar stdout).
putStr :: String -> IO ()
base Prelude, base System.IO
Write a string to the standard output device (same as hPutStr stdout).
putStrLn :: String -> IO ()
base Prelude, base System.IO
The same as putStr, but adds a newline character.
parens :: ReadPrec a -> ReadPrec a
base Text.Read
(parens p) parses "P", "(P0)", "((P0))", etc, p parses "P" in the current precedence context and parses "P0" in precedence context zero
parseVersion :: ReadP Version
base Data.Version
A parser for versions in the format produced by showVersion.
partition :: (a -> Bool) -> [a] -> ([a], [a])
base Data.List
The partition function takes a predicate a list and returns the pair of lists of elements which do and do not satisfy the predicate, respectively; i.e., > partition p xs == (filter p xs, filter (not . p) xs)
partitionEithers :: [Either a b] -> ([a], [b])
base Data.Either
Partitions a list of Either into two lists All the Left elements are extracted, in order, to the first component of the output. Similarly the Right elements are extracted to the second component of the output.
patError :: Addr# -> a
base Control.Exception.Base
peek :: Storable a => Ptr a -> IO a
base Foreign.Storable
peekArray :: Storable a => Int -> Ptr a -> IO [a]
base Foreign.Marshal.Array
Convert an array of given length into a Haskell list. The implementation is tail-recursive and so uses constant stack space.
peekArray0 :: (Storable a, Eq a) => a -> Ptr a -> IO [a]
base Foreign.Marshal.Array
Convert an array terminated by the given end marker into a Haskell list
peekByteOff :: Storable a => Ptr b -> Int -> IO a
base Foreign.Storable
peekCAString :: CString -> IO String
base Foreign.C.String
Marshal a NUL terminated C string into a Haskell string.

Show more results