This package bundles the minified Flot code (a jQuery plotting library) into a Haskell package, so it can be depended upon by Cabal packages. The first three components of the version number match the upstream flot version. The package is designed to meet the redistribution requirements of downstream users (e.g. Debian).

This library supports full W3C XML Schema regular expressions inclusive all Unicode character sets and blocks. It is implemented by the technique of derivations of regular expressions.

Library for Parsing and formatting HTTP Date in Haskell.

This package provides a HTTP/2.0 library including frames and HPACK. Currently HTTP/2 16 framing and HPACK 10 is supported.

An HTTP client using the Snap Framework's io-streams library to handle the streaming IO. The API is optimized for ease of use for the rather common case of code needing to query web services and deal with the result.

This library allows you to write WebSocket-capable servers.

An example server: https://github.com/jaspervdj/websockets/blob/master/example/server.lhs An example client: https://github.com/jaspervdj/websockets/blob/master/example/client.hs

See also:

• The specification of the WebSocket protocol: http://www.whatwg.org/specs/web-socket-protocol/

• The JavaScript API for dealing with WebSockets: http://www.w3.org/TR/websockets/

This package provides an implementation of Cross-Origin Resource Sharing (CORS) for the Web Application Framework (WAI) that aims to be compliant with https://www.w3.org/TR/cors.

This library provides sanitizeXSS. Run untrusted HTML through Text.HTML.SanitizeXSS.sanitizeXSS to prevent XSS attacks.

HTTP cookie parsing and rendering library for Haskell.

This package provides the logging system for WAI.

HTTP multipart split out of the cgi package, for Haskell.

HTTP client library.

This library provides HTML combinators for Haskell.

Happstack Server provides an HTTP server and a rich set of functions for routing requests, handling query parameters, generating responses, working with cookies, serving files, and more.

Base types used by a variety of HTTP clients and servers. See http-streams Network.Http.Client or pipes-http Pipes.Http.Client for full documentation. You can import Network.Http.Types if you like, but both http-streams and pipes-http re-export this package's types and functions.

Snap is a simple and fast web development framework and server written in Haskell. For more information, you can visit the Snap project website at http://snapframework.com/. This library contains the core definitions and types for the Snap framework.

Easy-to-write domain-specific language (DSL) for building Scalable Vector Graphics (SVG).

D-Bus is a simple, message-based protocol for inter-process communication, which allows applications to interact with other parts of the machine and the user's session using remote procedure calls. D-Bus is a essential part of the modern Linux desktop, where it replaces earlier protocols such as CORBA and DCOP. This library is an implementation of the D-Bus protocol in Haskell. It can be used to add D-Bus support to Haskell applications, without the awkward interfaces common to foreign bindings.

A binding to libffi, allowing C functions of types only known at runtime to be called from Haskell.

This is a set of macros to be used when writing Haskell FFI. They were designed to be able to fully describe C interfaces, so that hsc2hs can extract from them all Haskell code needed to mimic such interfaces. All Haskell names used are automatically derived from C names, structures are mapped to Haskell instances of Storable, and there are also macros you can use with C code to help write bindings to inline functions or macro functions.

This package provides basic types for representing XML documents.

This is an industrial-strength monadic parser combinator library. Megaparsec is a feature-rich package that strikes a nice balance between speed, flexibility, and quality of parse errors.

This package provides a simple (but internally ugly) memoization function.

This library provides free monads, which are useful for many tree-like structures and domain specific languages. If f is a Functor then the free Monad on f is the type of trees whose nodes are labeled with the constructors of f. The word "free" is used in the sense of "unrestricted" rather than "zero-cost": Free f makes no constraining assumptions beyond those given by f and the definition of Monad.