Strict -containers -base

Strict RWS monad. Inspired by the paper Functional Programming with Overloading and Higher-Order Polymorphism, Mark P Jones (http://web.cecs.pdx.edu/~mpj/) Advanced School of Functional Programming, 1995.

module Control.Monad.State.Strict

mtl Control.Monad.State.Strict

Strict state monads. This module is inspired by the paper Functional Programming with Overloading and Higher-Order Polymorphism, Mark P Jones (http://web.cecs.pdx.edu/~mpj/) Advanced School of Functional Programming, 1995.

module Control.Monad.Trans.RWS.Strict

transformers Control.Monad.Trans.RWS.Strict

A monad transformer that combines ReaderT, WriterT and StateT. This version is strict; for a lazy version, see Control.Monad.Trans.RWS.Lazy, which has the same interface.

module Control.Monad.Trans.State.Strict

transformers Control.Monad.Trans.State.Strict

Strict state monads, passing an updatable state through a computation. See below for examples. In this version, sequencing of computations is strict. For a lazy version, see Control.Monad.Trans.State.Lazy, which has the same interface. Some computations may not require the full power of state transformers: * For a read-only state, see Control.Monad.Trans.Reader. * To accumulate a value without using it on the way, see Control.Monad.Trans.Writer.

module Control.Monad.Trans.Writer.Strict

transformers Control.Monad.Trans.Writer.Strict

The strict WriterT monad transformer, which adds collection of outputs (such as a count or string output) to a given monad. This version builds its output strictly; for a lazy version, see Control.Monad.Trans.Writer.Lazy, which has the same interface. This monad transformer provides only limited access to the output during the computation. For more general access, use Control.Monad.Trans.State instead.

module Control.Monad.Writer.Strict

mtl Control.Monad.Writer.Strict

Strict writer monads. Inspired by the paper Functional Programming with Overloading and Higher-Order Polymorphism, Mark P Jones (http://web.cecs.pdx.edu/~mpj/pubs/springschool.html) Advanced School of Functional Programming, 1995.

data Strict

template-haskell Language.Haskell.TH.Syntax, template-haskell Language.Haskell.TH

package strict

package

This package provides strict versions of some standard Haskell data types (pairs, Maybe and Either). It also contains strict IO operations. Version 0.3.2

package strict-concurrency

package

This package provides head normal form strict versions of some standard Haskell concurrency abstractions (MVars,Chans), which provide control over where evaluation takes place not offered by the default lazy types. This may be useful for deciding when and where evaluation occurs, leading to improved time or space use, depending on the circumstances. Version 0.2.4.1

package strict-io

package

This library is a thin layer on top standard IO modules like System.IO and Data.IORef that re-expose these functions under a different type, namely SIO. Version 0.2.1

package StrictBench

package

A benchmarking library with a simple purpose: to strictly evaluate a value and report how long it takes. Can be useful to identify the slow part of an algorithm, since Haskell's lazy evaluation can make it hard to see where the bottleneck lies. Version 0.1.1

strictBufferOp :: BufferOp ByteString

HTTP Network.BufferType

strictBufferOp is the BufferOp definition over ByteStrings, the non-lazy kind.

strictDecode :: OnDecodeError

text Data.Text.Encoding.Error

Throw a UnicodeException if decoding fails.

strictEncode :: OnEncodeError

text Data.Text.Encoding.Error

Throw a UnicodeException if encoding fails.

package strictify

package

Find a local optimum of strictness annotations. Version 0.1