vmchale / permutationsLinks
Provides a type-safe way of working with permutations in Idris
☆37Updated 4 years ago
Alternatives and similar repositories for permutations
Users that are interested in permutations are comparing it to the libraries listed below
Sorting:
- Recursion schemes for Idris☆64Updated 7 years ago
- Codo notation for programming with comonads in Haskell☆25Updated 4 years ago
- An experiment in functional interface design☆24Updated 9 years ago
- GRIN backend for Idris☆50Updated 5 years ago
- Free Algebras in Haskell☆37Updated last year
- Provides free functors that are adjoint to functors that forget class constraints.☆29Updated last year
- Agda-style equational reasoning in Haskell☆54Updated 8 months ago
- A port of the gloss library from Haskell to Idris☆23Updated 7 years ago
- Dependently typed elimination functions using singletons☆28Updated last year
- Generic functions for single-sorted first-order structural unification☆45Updated 7 months ago
- Idris tactics for (commutative) monoids☆20Updated 5 years ago
- a little category theory in Idris☆10Updated 9 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- Where my everyday research happens☆55Updated last week
- classical sequent calculus, embedded in Haskell☆21Updated 4 months ago
- Bidirectional programming in Haskell with monadic profunctors☆48Updated 3 years ago
- using Data and Typeable to get a direct reflection system for free, when we're implementing a toy language in Haskell☆15Updated 5 years ago
- Haskell embedding of PlusCal☆62Updated 3 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 7 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- Small implementation of OutsideIn(X) type checking algorithm☆31Updated 10 years ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A monadic approach to static analysis following the methodology of AAM☆18Updated 10 years ago
- Simple Haskell package for efficiently indexable finite and infinite enumerations.☆12Updated 8 months ago
- Deep embedding of imperative programs with code generation☆23Updated 3 years ago
- Invertible parsing for S-expressions☆34Updated 8 months ago
- A terminal UI for inspecting steps taken by a rewriting process. Useful for the optimization phase of a compiler, or even evaluators of s…☆21Updated 6 years ago
- A library for doing generic programming in Agda☆35Updated 4 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago