ap -bytestring -fgl

ap :: Monad m => m (a -> b) -> m a -> m b
base Control.Monad
In many situations, the liftM operations can be replaced by uses of ap, which promotes function application. > return f `ap` x1 `ap` ... `ap` xn is equivalent to > liftMn f x1 x2 ... xn
appendFile :: FilePath -> String -> IO ()
base Prelude, base System.IO
The computation appendFile file str function appends the string str, to the file file. Note that writeFile and appendFile write a literal string to a file. To write a value of any printable type, as with print, use the show function to convert the value to a string first. > main = appendFile "squares" (show [(x,x*x) | x <- [0,0.1..2]])
app :: ArrowApply a => a (a b c, b) c
base Control.Arrow
appEndo :: Endo a -> a -> a
base Data.Monoid
approxRational :: RealFrac a => a -> a -> Rational
base Data.Ratio
approxRational, applied to two real fractional numbers x and epsilon, returns the simplest rational number within epsilon of x. A rational number y is said to be simpler than another y' if * abs (numerator y) <= abs (numerator y'), and * denominator y <= denominator y'. Any real interval contains a unique simplest rational; in particular, note that 0/1 is the simplest rational of all.
package apache-md5
package
Haskell implementation of Apache HTTP server specific MD5 digest algorithm that uses OpenSSL MD5() function. README and ChangeLog can be found in source code package and on GitHub: * https://github.com/trskop/apache-md5/blob/master/README.md * https://github.com/trskop/apache-md5/blob/master/ChangeLog.md Version 0.5.0.1
package apelsin
package
A gtk2hs server and clan browser for the open source game Tremulous http://tremulous.net. Both Tremulous 1.1 and GPP are supported. Features filtering, player search, a list of online clan members, a clan list and basic perferences. Version 1.2.3
package appar
package
A simple applicative parser in Parsec style Version 0.1.4
appE :: ExpQ -> ExpQ -> ExpQ
template-haskell Language.Haskell.TH.Lib, template-haskell Language.Haskell.TH
append :: OpenFileFlags -> Bool
unix System.Posix.IO.ByteString, unix System.Posix.IO
O_APPEND
append :: Text -> Text -> Text
text Data.Text
O(n) Appends one Text to the other by copying both of them into a new Text. Subject to fusion.
append :: Text -> Text -> Text
text Data.Text.Lazy
O(n\c)/ Appends one Text to another. Subject to fusion.
appendFile :: FilePath -> Text -> IO ()
text Data.Text.IO, text Data.Text.Lazy.IO
Write a string the end of a file.
appK :: Kind -> Kind -> Kind
template-haskell Language.Haskell.TH.Lib, template-haskell Language.Haskell.TH
applet :: Html -> Html
html Text.Html, xhtml Text.XHtml.Transitional
package applicative-extras
package
Some instances for applicative functors and type-level composition. Forkable on github. Version 0.1.8
package applicative-numbers
package
Any applicative functor can be given numeric instances in a boilerplate way. The applicative-numbers package provides an include file that makes it a snap to define these instances. See Data.Numeric.Function for an example. Project wiki page: http://haskell.org/haskellwiki/applicative-numbers Copyright 2009-2013 Conal Elliott; BSD3 license. Instances of Num classes for applicative functors.  To be #include'd after defining APPLICATIVE as the applicative functor name and CONSTRAINTS as a list of constraints, which must carry its own trailing comma if non-empty. The APPLICATIVE symbol gets #undef'd at the end of the include file, so that multiple includes are convenient. For instance, @ #define INSTANCE_Ord #define INSTANCE_Enum #define APPLICATIVE Vec2 #include &quot;ApplicativeNumeric-inc.hs&quot; #define APPLICATIVE Vec3 #include &quot;ApplicativeNumeric-inc.hs&quot; #define APPLICATIVE Vec4 #include &quot;ApplicativeNumeric-inc.hs&quot; @ You'll also have to import pure and liftA2 from Control.Applicative and specify the FlexibleContexts language extension (due to an implementation hack). Some instances are generated only if a corresponding CPP symbol is defined: INSTANCE_Eq, INSTANCE_Ord, INSTANCE_Show, INSTANCE_Enum Version 0.1.2
package applicative-quoters
package
Quasiquoters taken from Matt Morrow's haskell-src-meta to implement Conor McBride's idiom brackets, and a do-notation that only requires Applicative (and is correspondingly less powerful). applicative-quoters currently has no maintainer: if it is broken and you want it to be fixed, then fix it! Version 0.1.0.8
apply :: Fun a b -> (a -> b)
QuickCheck Test.QuickCheck.Function
package approx-rand-test
package
Functions and utilities to perform paired and unpaired approximate randomization tests (Noreen, 1989). The utilities can also draw histograms of the applications of the test statistic to the randomized samples. For support for more file formats, install the package with the -withCairo flag. Version 0.2.1

Show more results