david-christiansen / derive-all-the-instancesLinks
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
Sorting:
- being a thing I build on a Saturday☆28Updated 7 years ago
- Where my everyday research happens☆54Updated last month
- Replib: generic programming & Unbound: generic treatment of binders☆45Updated 2 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- An extensible IO-like monad-like thing for Idris, with support for including linear subprograms☆22Updated 5 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq☆36Updated 4 years ago
- Bidirectional programming in Haskell with monadic profunctors☆46Updated 3 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆124Updated last year
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- A library for doing generic programming in Agda☆32Updated 4 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 4 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- being bits and pieces I'm inclined to leave lying around☆53Updated last month
- second-order abstract syntax☆31Updated 3 years ago
- Implementing grep in Agda☆33Updated 4 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- Compositional type checking for Haskell☆37Updated 14 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated last week
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 8 months ago
- Observational Type Theory as an Agda library☆54Updated 8 years ago
- Profunctor optics for the endofunctor category on Hask☆27Updated 4 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated last month
- System F implemented in Haskell☆24Updated 13 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Generic functions for single-sorted first-order structural unification☆46Updated 3 months ago
- being the materials for Summer 2013's course☆112Updated 2 years ago