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

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.

Modules

[Index]

Downloads

• non-empty-0.1.tar.gz [browse] (Cabal source package)
• Package description (as included in the package)

Maintainer's Corner

Package maintainers

• HenningThielemann

For package maintainers and hackage trustees

• edit package information

Candidates

• 0.3.0.1, 0.3.1, 0.3.2, 0.3.3