bollu / minittLinks
bollu learns implementation of dependent typing
☆34Updated 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☆62Updated 6 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆86Updated 4 years ago
- A tutorial on how Agda infers things☆63Updated 6 months ago
- being an operating system for typechecking processes☆130Updated 3 months ago
- Benchmarks for capture-avoiding substitution☆121Updated 7 months ago
- A work-in-progress core language for Agda, in Agda☆63Updated this week
- ☆51Updated 5 months ago
- This aims to be the most pretentious implementation of stlc in existence☆65Updated 3 years ago
- high-performance cubical evaluation☆79Updated 9 months ago
- Normalization by Evaluation for Martin-Löf Type Theory☆131Updated last year
- A pure type system implemented in OCaml☆78Updated 5 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- Set up a specific version of Agda for your GitHub Actions workflow.☆28Updated 2 months ago
- Implementation for ICFP 2020 paper☆54Updated 4 years ago
- A prototypical dependently typed languages with sized types and variances☆115Updated 2 weeks ago
- Minimalistic dependent type theory with syntactic metaprogramming☆60Updated last year
- Language Server for Agda☆121Updated 2 months ago
- Benchmarking various normalization algorithms for the lambda calculus☆48Updated 3 years ago
- Duo - A research language exploring duality in programming language design☆61Updated 2 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆54Updated 6 months ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 4 years ago
- being a particular fragment of Haskell, extended to a proof system☆43Updated last month
- Prototype implementations of systems based on setoid type theory☆65Updated 5 years ago
- Eventually a practical 2-level TT-based compiler☆30Updated 2 weeks ago
- Unification and type inference algorithms☆127Updated 10 years ago
- Strongly-typed System F in Haskell☆120Updated 3 years ago
- Setoid type theory implementation☆38Updated 2 years ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆48Updated last month
- A verified compiler for a lazy functional language☆37Updated last week
- Total Parser Combinators in Agda☆133Updated 5 months ago