david-christiansen / derive-all-the-instances
Work on type class deriving with elaboration reflection
☆32Updated 6 years ago
Alternatives and similar repositories for derive-all-the-instances:
Users that are interested in derive-all-the-instances are comparing it to the libraries listed below
- being a thing I build on a Saturday☆28Updated 7 years ago
- An extensible IO-like monad-like thing for Idris, with support for including linear subprograms☆22Updated 5 years ago
- Where my everyday research happens☆52Updated last week
- being bits and pieces I'm inclined to leave lying around☆49Updated 4 months ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- A library for doing generic programming in Agda☆31Updated 4 years ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- IO using sized types and copatterns☆33Updated 4 years ago
- Bidirectional programming in Haskell with monadic profunctors☆46Updated 2 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆50Updated 8 months ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 3 years ago
- ☆45Updated 5 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- being the materials for Summer 2013's course☆112Updated 2 years ago
- Concurrent IO language with Uniqueness Types☆9Updated 9 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq☆36Updated 4 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 8 months ago
- STLC-related snippets in Agda☆16Updated 11 years ago
- NbE course @ Chalmers☆28Updated 7 months ago
- Desc'n crunch: Descriptions, levitation, and reflecting the elaborator.☆11Updated 6 years ago
- what I did on my holidays☆12Updated 6 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 3 months ago
- Recursion schemes for Idris☆64Updated 6 years ago
- classical sequent calculus, embedded in Haskell☆20Updated 3 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 6 months ago
- A Haskell translation of Idris's original algebraic effects library☆41Updated 8 years ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- being a programming language for sequential circuits☆20Updated 5 months ago