andreasabel / miniagda
A prototypical dependently typed languages with sized types and variances
☆104Updated 2 years ago
Related projects ⓘ
Alternatives and complementary repositories for miniagda
- Prototype implementations of systems based on setoid type theory☆64Updated 3 years ago
- Unification and type inference algorithms☆123Updated 9 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆70Updated 5 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated 2 years ago
- System F-omega normalization by hereditary substitution in Agda☆56Updated 5 years ago
- Tiny type-checker with dependent types☆76Updated 10 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆55Updated 3 years ago
- Implementation for ICFP 2020 paper☆49Updated 3 years ago
- Benchmarks for capture-avoiding substitution☆107Updated 2 years ago
- Where my everyday research happens☆53Updated last week
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆52Updated 2 months ago
- The Evolution of a Typechecker☆54Updated 5 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- ☆47Updated last month
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆78Updated 8 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆122Updated 3 months ago
- An interactive theorem prover based on lambda-tree syntax☆90Updated this week
- ICFP tutorial☆40Updated 3 years ago
- Agda formalisation of second-order abstract syntax☆52Updated 2 years ago
- This aims to be the most pretentious implementation of stlc in existence☆60Updated 2 years ago
- Automatically exported from code.google.com/p/trellys☆46Updated 5 years ago
- A simple Depdently-Typed Language for Research and Learning☆58Updated 8 years ago
- being an operating system for typechecking processes☆121Updated last year
- Benchmarking various normalization algorithms for the lambda calculus☆43Updated 2 years ago
- SPLV20 course notes☆106Updated 2 years ago
- Agda programming with holes☆26Updated 3 years ago
- Strongly-typed System F in Haskell☆117Updated 2 years ago
- Organization and planning for the Initial Types Club☆71Updated 2 years ago