andrejbauer / what-is-algebraic-about-algebraic-effects
☆46Updated 5 years ago
Related projects ⓘ
Alternatives and complementary repositories for what-is-algebraic-about-algebraic-effects
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated 2 years ago
- Self-contained repository for the eponymous paper☆29Updated 5 years ago
- Where my everyday research happens☆53Updated last week
- A Specification for Dependent Types in Haskell (Core)☆65Updated 2 years ago
- ☆82Updated 7 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- The Evolution of a Typechecker☆54Updated 5 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Work on type class deriving with elaboration reflection☆31Updated 6 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- being the materials for Summer 2013's course☆110Updated last year
- being bits and pieces I'm inclined to leave lying around☆46Updated last month
- Automatically exported from code.google.com/p/trellys☆46Updated 5 years ago
- Agda programming with holes☆26Updated 3 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- Implementing grep in Agda☆32Updated 3 years ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- Relative Monad Library for Agda☆24Updated 5 years ago
- Prototype implementations of systems based on setoid type theory☆64Updated 3 years ago
- A library for doing generic programming in Agda☆28Updated 3 years ago
- being a thing I build on a Saturday☆28Updated 6 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated 8 months ago
- Adding linear types to Haskell in the style of Linear/Non-Linear (LNL) logic☆35Updated 6 years ago
- System F implemented in Haskell☆24Updated 12 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- Bidirectional programming in Haskell with monadic profunctors☆44Updated 2 years ago
- ☆21Updated 4 months ago
- Haskell implementation of the Edinburgh Logical Framework☆26Updated last month
- A showcase of interesting code and proof developments in Cedille☆36Updated last year
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆54Updated 5 years ago