michaelt / tagless
oleg modules
☆30Updated 11 years ago
Related projects ⓘ
Alternatives and complementary repositories for tagless
- HoTT Note-taking action☆25Updated 5 years ago
- A Haskell translation of Idris's original algebraic effects library☆41Updated 8 years ago
- Work on type class deriving with elaboration reflection☆31Updated 6 years ago
- Interactive and object-oriented programming in Agda using coinductive types☆22Updated 4 years ago
- A talk☆28Updated 3 years ago
- Bidirectional programming in Haskell with monadic profunctors☆44Updated 2 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆52Updated 7 years ago
- ☆28Updated 6 years ago
- Extensible records for Idris☆26Updated 3 years ago
- Toy version of Git/Mercurial built using recursion schemes. Implements lazy diffing and merging of merkle dir trees. Solves toy versions …☆3Updated 3 years ago
- An extensible IO-like monad-like thing for Idris, with support for including linear subprograms☆22Updated 4 years ago
- Dependently-typed finite maps (partial dependent products)☆63Updated 5 months ago
- Generic functions for single-sorted first-order structural unification☆41Updated last week
- Recursion schemes for Idris☆64Updated 6 years ago
- A total recursion scheme library for Dhall☆65Updated 2 months ago
- Compositional type checking for Haskell☆36Updated 13 years ago
- Invertible parsing for S-expressions☆33Updated last month
- Paper and talk☆45Updated last year
- being the materials for a paper I have in mind to write about the bidirectional discipline☆45Updated 3 months ago
- A well-typed symmetric-monoidal category of concurrent processes☆24Updated 5 years ago
- System F implemented in Haskell☆24Updated 12 years ago
- A library for doing generic programming in Agda☆28Updated 3 years ago
- Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq☆36Updated 3 years ago
- Provides a type-safe way of working with permutations in Idris☆34Updated 3 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- Zippers based on lenses and traversals☆38Updated last year
- Wailing into the primordial ooze of category theory☆54Updated last month
- Compiling to STLC to categories in Haskell and Coq, using Conal Elliot's work☆19Updated 6 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆122Updated 3 months ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆28Updated 3 years ago