strict-list: Strict linked list with stack-safe operations

A strict linked list with stack-safe operations and reversed-order helpers.

[Skip to Readme]

Modules

For package maintainers and hackage trustees

Candidates

Versions [RSS]	0.1, 0.1.0.1, 0.1.1, 0.1.2, 0.1.3, 0.1.4, 0.1.5, 0.1.6, 0.1.7, 0.1.7.1, 0.1.7.2, 0.1.7.3, 0.1.7.4, 0.1.7.5, 0.1.7.6, 1.0.0.0
Change log	CHANGELOG.md
Dependencies	base (>=4.13 && <5), deepseq (>=1.4.3 && <2), hashable (>=1.2 && <2), QuickCheck (>=2.14 && <3), semigroupoids (>=5.3 && <7) [details]
License	MIT
Copyright	(c) 2019, Nikita Volkov
Author	Nikita Volkov <nikita.y.volkov@mail.ru>
Maintainer	Nikita Volkov <nikita.y.volkov@mail.ru>
Uploaded	by NikitaVolkov at 2026-04-04T11:49:46Z
Category	Data
Home page	https://github.com/nikita-volkov/strict-list
Bug tracker	https://github.com/nikita-volkov/strict-list/issues
Source repo	head: git clone https://github.com/nikita-volkov/strict-list
Reverse Dependencies	3 direct, 102 indirect [details]
Downloads	18941 total (17 in the last 30 days)
Rating	(no votes yet) [estimated by Bayesian average]
Your Rating	λ λ λ
Status	Docs available [build log] Last success reported on 2026-04-04 [all 1 reports]

Strict linked lists for Haskell, with stack-safe operations and reversed-order helpers for efficient intermediate work.

{-# LANGUAGE OverloadedLists #-}

import StrictList

numbers :: StrictList Int
numbers = [1, 2, 3]