eliminators: Dependently typed elimination functions using singletons

[ bsd3, dependent-types, library ] [ Propose Tags ]

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


[Skip to Readme]

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

  • No 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, 0.9.4, 0.9.5
Change log CHANGELOG.md
Dependencies base (>=4.20 && <4.21), extra (>=1.4.2 && <1.8), singleton-nats (>=0.4.2 && <0.5), singletons-base (>=3.4 && <3.5), template-haskell (>=2.22 && <2.23), text (>=2.0.1 && <2.2), th-abstraction (>=0.4 && <0.8), th-desugar (>=1.17 && <1.18) [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 2024-05-12T23:39:03Z
Distributions LTSHaskell:0.9.3, Stackage:0.9.4
Reverse Dependencies 1 direct, 0 indirect [details]
Downloads 5990 total (48 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]

Readme for eliminators-0.9.5

[back to package description]

eliminators

Hackage Hackage Dependencies Haskell Programming Language BSD3 License Build Status

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