Nat and Fin: peano naturals and finite numbers
|Version on this page:||0.2|
|LTS Haskell 20.23:||0.2.1@rev:1|
|Stackage Nightly 2023-05-30:||0.3@rev:1|
|Latest on Hackage:||0.3@rev:1|
Module documentation for 0.2
This package provides two simple types, and some tools to work with them.
Also on type level as
-- Peano naturals data Nat = Z | S Nat -- Finite naturals data Fin (n :: Nat) where Z :: Fin ('S n) S :: Fin n -> Fin ('Nat.S n)
vec implements length-indexed (sized) lists using this package for indexes.
Data.Fin.Enum module let's work generically with enumerations.
See Hasochism: the pleasure and pain of dependently typed haskell programming by Sam Lindley and Conor McBride for answers to how and why. Read APLicative Programming with Naperian Functors by Jeremy Gibbons for (not so) different ones.
finite-typelits . Is a great package, but uses
type-natural depends on
finwill try to stay light on the dependencies, and support as many GHC versions as practical.
peano is very incomplete
nat as well.
PeanoWitnesses doesn't use
type-combinators is big package too.
SNatis now what was called
InlineInduction. To migrate code from
fin-0.2it’s often enough to replace
- Explicitly mark all modules as Safe or Trustworthy.
- Explicitly derive
Son GHC-7.8 explicitly
FS. Now you can have both
Finimported unqualified in a single module.
(Enum a, Enum b) => Enum (Either a b)instance
- GHC-8.4.1 / base-4.11 support
- First version. Released on an unsuspecting world.