eliminators: Dependently typed elimination functions using singletons

This library provides eliminators for inductive data types, leveraging the power of the singletons library to allow dependently typed elimination.

[Skip to Readme]

Modules

For package maintainers and hackage trustees

Candidates

Versions [RSS]	0.1, 0.2, 0.3, 0.4, 0.4.1, 0.5, 0.5.1, 0.6, 0.7, 0.8, 0.9, 0.9.1, 0.9.2, 0.9.3
Change log	CHANGELOG.md
Dependencies	base (>=4.18 && <4.19), extra (>=1.4.2 && <1.8), singleton-nats (>=0.4.2 && <0.5), singletons-base (>=3.2 && <3.3), template-haskell (>=2.20 && <2.21), text (>=2.0.1 && <2.1), th-abstraction (>=0.4 && <0.6), th-desugar (>=1.15 && <1.16) [details]
License	BSD-3-Clause
Copyright	(C) 2017 Ryan Scott
Author	Ryan Scott
Maintainer	Ryan Scott <ryan.gl.scott@gmail.com>
Category	Dependent Types
Home page	https://github.com/RyanGlScott/eliminators
Bug tracker	https://github.com/RyanGlScott/eliminators/issues
Source repo	head: git clone https://github.com/RyanGlScott/eliminators
Uploaded	by ryanglscott at 2023-03-12T19:14:55Z
Distributions	LTSHaskell:0.9, NixOS:0.9, Stackage:0.9.2
Reverse Dependencies	1 direct, 0 indirect [details]
Downloads	5608 total (36 in the last 30 days)
Rating	(no votes yet) [estimated by Bayesian average]
Your Rating	λ λ λ
Status	Docs not available [build log] All reported builds failed as of 2023-03-12 [all 2 reports]

This library provides eliminators for inductive data types, leveraging the power of the singletons library to allow dependently typed elimination.