michaelt / tagless
oleg modules
☆30Updated 12 years ago
Alternatives and similar repositories for tagless:
Users that are interested in tagless are comparing it to the libraries listed below
- A Haskell translation of Idris's original algebraic effects library☆41Updated 8 years ago
- A talk☆28Updated 3 years ago
- HoTT Note-taking action☆25Updated 6 years ago
- Recursion schemes for Idris☆64Updated 6 years ago
- Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq☆36Updated 4 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- Interactive and object-oriented programming in Agda using coinductive types☆23Updated 4 months ago
- ☆30Updated 6 years ago
- GRIN backend for Idris☆51Updated 4 years ago
- A copy of Daan Leijen's reference implementation of HMF (type inference)☆16Updated 8 years ago
- Work on type class deriving with elaboration reflection☆32Updated 6 years ago
- Generic functions for single-sorted first-order structural unification☆42Updated last month
- Haskell embedding of PlusCal☆61Updated 2 years ago
- Cofun with Cofree Comonads☆31Updated 8 years ago
- A small profunctor library for idris☆17Updated 2 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆52Updated 7 years ago
- Invertible parsing for S-expressions☆34Updated 6 months ago
- Experiments with sequent calculi☆27Updated 4 years ago
- A small bifunctor library for idris☆21Updated 4 years ago
- A well-typed symmetric-monoidal category of concurrent processes☆24Updated 6 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- Dual Traversable☆42Updated last year
- Scrap Your Reprinter - A Datatype Generic Algorithm for Layout-Preserving Refactoring☆27Updated 3 years ago
- Bidirectional programming in Haskell with monadic profunctors☆46Updated 2 years ago
- Free Algebras in Haskell☆37Updated 7 months ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 8 months ago
- IO using sized types and copatterns☆33Updated 3 years ago