non-empty

Version 0.1 revision 0 uploaded 2013-03-26T09:33:22.000Z by HenningThielemann.

Package meta

Synopsis

List-like structures with static checks on the number of elements

Description

We provide a data type that allows to store a list-like structure with at least or exactly n elements, where n is fixed in the type in a kind of Peano encoding and is usually small. The datatype is intended to increase safety by making functions total that are partial on plain lists. E.g. on a non-empty list, head and tail are always defined.

The package uses Haskell 98.

Similar packages:

• semigroups, semigroupoids: restricted to lists, minimum number of elements: 1, provides more type classes tailored to the use of non-empty lists.

• NonEmptyList: restricted to lists, minimum number of elements: 1

• NonEmpty: restricted to lists, minimum number of elements: 1, designed for unqualified use of identifiers

• Cardinality:NeverEmptyList

• http://www.haskell.org/haskellwiki/Non-empty_list

Related packages:

• Stream: Lists that contain always infinitely many elements.

• fixed-list: Uses the same data structure as this package but is intended for fixing the number of elements in a list. Requires multi-parameter type classes with functional dependencies.

Author

Henning Thielemann <haskell@henning-thielemann.de>

Bug reports

n/a

Category

Data

Copyright

n/a

Homepage

http://code.haskell.org/~thielema/non-empty/

Maintainer

Henning Thielemann <haskell@henning-thielemann.de>

Package URL

n/a

Stability

n/a

Components

• lib:non-empty