It is common knowledge that lazy datastructures can lead to space-leaks.
This problem is particularly prominent, when using lazy datastructures to
store the state of a long-running application in memory. The easiest
solution to this problem is to use fully strict types to store such state
values. By "fully strict types" we mean types for whose values it holds
that, if they are in weak-head normal form, then they are also in normal
form. Intuitively, this means that values of fully strict types cannot
contain unevaluated thunks.

To define a fully strict datatype, one typically uses the following recipe.

Make all fields of every constructor strict; i.e., add a bang to
all fields.

Use only strict types for the fields of the constructors.

The second requirement is problematic as it rules out the use of
the standard Haskell Maybe, Either, and pair types. This library
solves this problem by providing strict variants of these types and their
corresponding standard support functions and type-class instances.

Note that this library does currently not provide fully strict lists.
They can be added if they are really required. However, in many cases one
probably wants to use unboxed or strict boxed vectors from the vector
library (http://hackage.haskell.org/package/vector) instead of strict
lists. Moreover, instead of Strings one probably wants to use strict
Text values from the text library
(http://hackage.haskell.org/package/text).