vmchale / recursion_schemesLinks
Recursion schemes for Idris
☆65Updated 6 years ago
Alternatives and similar repositories for recursion_schemes
Users that are interested in recursion_schemes are comparing it to the libraries listed below
Sorting:
- Dual Traversable☆42Updated 2 years ago
- GRIN backend for Idris☆50Updated 5 years ago
- Type Safe LLVM IR ( Experimental )☆49Updated 7 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago
- A port of QuickCheck to Idris☆59Updated 7 years ago
- A Haskell translation of Idris's original algebraic effects library☆41Updated 8 years ago
- Zippers based on lenses and traversals☆40Updated last year
- Various data structures for use in the Idris Language.☆95Updated 5 years ago
- Type provider library for Idris☆94Updated 7 years ago
- Provides a type-safe way of working with permutations in Idris☆36Updated 3 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆124Updated 11 months ago
- A syntax for unions of constraints in Haskell☆70Updated 8 years ago
- Bidirectional programming in Haskell with monadic profunctors☆46Updated 3 years ago
- Template for Hindley-Milner based languages☆39Updated 3 years ago
- JHC Haskell compiler split into reusable components☆58Updated 6 years ago
- Kan extensions, Kan lifts, the Yoneda lemma, and (co)monads generated by a functor☆80Updated 3 weeks ago
- Haskell 98 contravariant functors☆73Updated 8 months ago
- Demonstrating comonad transformers.☆37Updated 8 years ago
- Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq☆36Updated 4 years ago
- A smart A* search monad transformer which supports backtracking user-state!☆81Updated 3 years ago
- Haskell library for simple, concise and fast generic operations.☆81Updated last year
- An extensible IO-like monad-like thing for Idris, with support for including linear subprograms☆22Updated 5 years ago
- Work on type class deriving with elaboration reflection☆32Updated 6 years ago
- A haskell numeric prelude, providing a clean structure for numbers and operations that combine them.☆69Updated this week
- A well-typed symmetric-monoidal category of concurrent processes☆24Updated 6 years ago
- TParsec - Total Parser Combinators in Idris☆95Updated last year
- Type-level sets for Haskell (with value-level counterparts and various operations)☆66Updated last year
- Dependently-typed finite maps (partial dependent products)☆66Updated 5 months ago
- A total recursion scheme library for Dhall☆66Updated last month
- A port of the gloss library from Haskell to Idris☆23Updated 7 years ago