strict-list

Strict linked list with stack-safe operations

MIT licensed and maintained by Nikita Volkov

This version can be pinned in stack with:strict-list-1.0.0.1@sha256:6c3960c7c1ef5e0f907ac7811cfc119337e330b13af5c0301e5d28013ad7fc97,1795

Depends on 5 packages(full list with versions):

Used by 2 packages in nightly-2026-04-07(full list with versions):

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

Example

{-# LANGUAGE OverloadedLists #-}

import StrictList

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

The strict list type was renamed from List to StrictList throughout the API to avoid confusion with the List type alias from base.
Ord for StrictList now matches the standard lazy list ordering, so empty lists compare smaller than non-empty lists and lexicographic comparison follows the usual [] semantics.