bollu / minittLinks
bollu learns implementation of dependent typing
☆30Updated 2 years ago
Alternatives and similar repositories for minitt
Users that are interested in minitt are comparing it to the libraries listed below
Sorting:
- System F-omega normalization by hereditary substitution in Agda☆59Updated 5 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 11 months ago
- A pure type system implemented in OCaml☆77Updated 4 years ago
- A prototypical dependently typed languages with sized types and variances☆108Updated 2 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆58Updated 4 years ago
- ♾️ A library for universe levels and universe polymorphism☆34Updated 5 months ago
- Low-overhead effect management for concrete monads☆37Updated 3 years ago
- ☆47Updated this week
- Implementation for ICFP 2020 paper☆50Updated 3 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆30Updated 4 years ago
- high-performance cubical evaluation☆72Updated last month
- A tutorial on how Agda infers things☆42Updated 4 years ago
- Setoid type theory implementation☆38Updated last year
- Benchmarks for capture-avoiding substitution☆114Updated this week
- ☆36Updated 3 years ago
- 🪆 A Staged Type Theory☆35Updated last year
- Haskell implementation of a version of cubical type theory developed for my master thesis☆16Updated 2 years ago
- Session Types with Priority in Linear Haskell☆26Updated 11 months ago
- being an operating system for typechecking processes☆126Updated 2 years ago
- A verified compiler for a lazy functional language☆36Updated 3 weeks ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Duo - A research language exploring duality in programming language design☆57Updated 2 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Benchmarking various normalization algorithms for the lambda calculus☆45Updated 2 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆38Updated 4 years ago
- This aims to be the most pretentious implementation of stlc in existence☆63Updated 3 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated 10 months ago
- An experimental Haskell library for programming with effectful runners.☆29Updated 5 years ago