DanBurton / system-f
System F implemented in Haskell
☆24Updated 13 years ago
Alternatives and similar repositories for system-f:
Users that are interested in system-f are comparing it to the libraries listed below
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- Type-Theory in Sequent Calculus☆13Updated 9 years ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- Folds for recursive types with GHC Generics☆26Updated 5 years ago
- Diploma work (if this is still here contact me if you need details)☆13Updated 7 years ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- "Programs that explain their effects" talk material☆17Updated 6 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 8 years ago
- Tools for functors from Hask^k to Hask☆23Updated 5 years ago
- This a type-checker plugin to rule all type checker plugins involving type-equality reasoning using smt solvers.☆21Updated 3 years ago
- Category theory formalized in cubical agda☆20Updated 5 years ago
- A copy of Daan Leijen's reference implementation of HMF (type inference)☆16Updated 8 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 3 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- van Laarhoven lenses for Idris☆20Updated 7 years ago
- Interpreter for functional pure type systems.☆21Updated 7 years ago
- what I did on my holidays☆12Updated 6 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 6 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- Category theory and algebra☆28Updated 8 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- Safe web routing in haskell☆30Updated last year
- Work on type class deriving with elaboration reflection☆32Updated 6 years ago
- ☆14Updated 7 years ago
- Dependently typed elimination functions using singletons☆28Updated 3 months ago
- An implementation of the Haskell ByteString library using the Fiat system from MIT☆32Updated 3 years ago
- Demonstration for how to build "traverse" using GHC.Generics efficiently☆22Updated 6 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago