eliminators VS nonempty-containers

Compare eliminators vs nonempty-containers and see what are their differences.

eliminators

Dependently typed elimination functions using singletons (by RyanGlScott)

nonempty-containers

Efficient non-empty variants of containers data types, with full API (by mstksg)
Our great sponsors
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • WorkOS - The modern identity platform for B2B SaaS
  • SaaSHub - Software Alternatives and Reviews
eliminators nonempty-containers
- -
27 24
- -
4.5 3.1
about 1 month ago 4 months ago
Haskell Haskell
BSD 3-clause "New" or "Revised" License BSD 3-clause "New" or "Revised" License
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.

eliminators

Posts with mentions or reviews of eliminators. We have used some of these posts to build our list of alternatives and similar projects.

We haven't tracked posts mentioning eliminators yet.
Tracking mentions began in Dec 2020.

nonempty-containers

Posts with mentions or reviews of nonempty-containers. We have used some of these posts to build our list of alternatives and similar projects.

We haven't tracked posts mentioning nonempty-containers yet.
Tracking mentions began in Dec 2020.

What are some alternatives?

When comparing eliminators and nonempty-containers you can also consider the following projects:

Agda - Agda is a dependently typed programming language / interactive theorem prover.

igraph - Incomplete Haskell bindings to the igraph library (which is written in C)

hoq - A language based on homotopy type theory with an interval

psqueues - Priority Search Queues in three different flavors for Haskell

open-typerep - Open type representations and dynamic types

helf - Haskell implementation of the Edinburgh Logical Framework

flux-monoid - A monoid which counts changing values in a sequence

agda-snippets - Library and tool to render the snippets in literate Agda files to hyperlinked HTML, leaving the rest of the text untouched.

bookkeeper

Sit - Prototypical type checker for Type Theory with Sized Natural Numbers

bitset - A compact functional set data structure