Category31 packages

Data

OneTuple0.4.3Singleton Tuplehackage
StateVar1.2.2State variableshackage
assoc1.1.1swap and assoc: Symmetric and Semigroupy Bifunctorshackage
atomic-primops0.8.8A safe approach to CAS and other atomic ops in Haskell.hackage
bifunctors5.6.3Bifunctorshackage
binary0.8.9.3Binary serialisation for Haskell values using lazy ByteStringsboot
boring0.2.2.1Boring and Absurd typeshackage
bytestring0.12.2.0Fast, compact, strict and lazy byte strings with a list interfaceboot
character-ps0.1Pattern synonyms for ASCII characters for Word8, Word16 etchackage
colour2.3.7A model for human colour/color perceptionhackage
data-fix0.3.4Fixpoint data typeshackage
dlist1.0Difference listshackage
ghc-compact0.1.0.0In memory storage of deeply evaluated data structureboot
hashable1.5.1.0A class for types that can be converted to a hash valuehackage
indexed-traversable0.1.5FunctorWithIndex, FoldableWithIndex, TraversableWithIndexhackage
indexed-traversable-instances0.1.2.1More instances of FunctorWithIndex, FoldableWithIndex, TraversableWithIndexhackage
integer-conversion0.1.1Conversion from strings to Integerhackage
primitive0.9.1.0Primitive memory-related operationshackage
resourcet1.3.0Deterministic allocation and freeing of scarce resources.hackage
scientific0.3.9.0Numbers represented using scientific notationhackage
semialign1.4Align and Zip type-classes from the common Semialign ancestor.hackage
strict0.5.1Strict data types and String IO.hackage
tagged0.8.11Haskell 98 phantom types to avoid unsafely passing dummy argumentshackage
text2.1.4An efficient packed Unicode text type.boot
text-short0.1.6.1Memory-efficient representation of Unicode text stringshackage
these1.2.1An either-or-both data type.hackage
unordered-containers0.2.21Efficient hashing-based container typeshackage
uuid-types1.0.6.1Type definitions for Universally Unique Identifiershackage
vector0.13.2.0Efficient Arrayshackage
vector-stream0.1.0.1Efficient Streamshackage
witherable0.5filterable traversablehackage