andreasabel / miniagdaLinks
A prototypical dependently typed languages with sized types and variances
☆108Updated 2 years ago
Alternatives and similar repositories for miniagda
Users that are interested in miniagda are comparing it to the libraries listed below
Sorting:
- Unification and type inference algorithms☆125Updated 10 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- Benchmarks for capture-avoiding substitution☆114Updated last week
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- System F-omega normalization by hereditary substitution in Agda☆59Updated 5 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- being an operating system for typechecking processes☆126Updated 2 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆82Updated 8 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- TParsec - Total Parser Combinators in Idris☆95Updated last year
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 3 years ago
- A verified compiler for a lazy functional language☆36Updated 2 weeks ago
- Hypertypes - generic programming for heterogeneous recursive types☆122Updated 4 months ago
- A simple Depdently-Typed Language for Research and Learning☆57Updated 8 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆127Updated 11 months ago
- An interactive theorem prover based on lambda-tree syntax☆95Updated last week
- Formalizations of Gradually Typed Languages in Agda☆57Updated 3 months ago
- Replib: generic programming & Unbound: generic treatment of binders☆45Updated 2 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆58Updated 4 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 9 months ago
- Implementation for ICFP 2020 paper☆50Updated 3 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- ☆84Updated 7 years ago
- Strongly-typed System F in Haskell☆117Updated 2 years ago
- Where my everyday research happens☆53Updated last month
- Toy typechecker for Insanely Dependent Types☆79Updated 11 years ago
- ICFP tutorial☆39Updated 3 years ago
- Efficient Haskell effect handlers based on evidence translation.☆82Updated 3 years ago