Dependently typed elimination functions using singletons https://github.com/RyanGlScott/eliminators

Version on this page:0.6@rev:1
LTS Haskell 16.20:0.6@rev:1
Stackage Nightly 2020-10-26:0.7@rev:1
Latest on Hackage:0.7@rev:1

See all snapshots eliminators appears in

BSD-3-Clause licensed by Ryan Scott
Maintained by Ryan Scott

Module documentation for 0.6

This version can be pinned in stack with:eliminators-0.6@sha256:6dceb85ab9b2ed44fbbaee15c6d8991e58bef3358b150bccbddc6745001bf80d,2643


Hackage Hackage Dependencies Haskell Programming Language BSD3 License Build

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


0.6 [2019.08.27]

  • Require singletons-2.6 and GHC 8.8.

0.5.1 [2019.04.26]

  • Support th-abstraction- or later.

0.5 [2018.09.18]

  • Require singletons-2.5 and GHC 8.6.

0.4.1 [2018.02.13]

  • Add elimVoid to Data.Eliminator.

0.4 [2018.01.09]

  • Require singletons-2.4 and GHC 8.4.

0.3 [2017-11-07]

  • Migrate the old elimNat from Data.Eliminator (which worked over the Nat from GHC.TypeNats) to Data.Eliminator.TypeNats. There elimNat that now lives in Data.Eliminator is for an unrelated Nat data type from the singleton-nats package (which is a proper, inductively defined, Peano natural number type).

0.2 [2017-07-22]

  • Introduce the Data.Eliminator.TH module, which provides functionality for generating eliminator functions using Template Haskell. Currently, only simple algebraic data types that do not use polymorphic recursion are supported.
  • All eliminators now use predicates with (~>).

0.1 [2017-07-02]

  • Initial release.