adamgundry / type-inferenceLinks
Unification and type inference algorithms
☆127Updated 10 years ago
Alternatives and similar repositories for type-inference
Users that are interested in type-inference are comparing it to the libraries listed below
Sorting:
- A prototypical dependently typed languages with sized types and variances☆115Updated this week
- Normalization by Evaluation for Martin-Löf Type Theory☆131Updated last year
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆85Updated 9 years ago
- An experimental type checker for a modal dependent type theory.☆116Updated 5 years ago
- System F-omega normalization by hereditary substitution in Agda☆62Updated 6 years ago
- An interactive theorem prover based on lambda-tree syntax☆98Updated last week
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 5 years 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
- Toy typechecker for Insanely Dependent Types☆82Updated 3 months ago
- Benchmarks for capture-avoiding substitution☆121Updated 7 months ago
- SPLV20 course notes☆114Updated 3 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆85Updated 4 years ago
- Where my everyday research happens☆55Updated last week
- being the materials for a paper I have in mind to write about the bidirectional discipline☆54Updated 5 months ago
- Programming library for Agda☆134Updated last year
- Replib: generic programming & Unbound: generic treatment of binders☆46Updated 3 years ago
- Tiny type-checker with dependent types☆78Updated 12 years ago
- Implementation for ICFP 2020 paper☆54Updated 4 years ago
- ☆51Updated 5 months ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆80Updated 4 months ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆86Updated 5 years ago
- Dependently Typed Lambda Calculus in Haskell☆116Updated 4 years ago
- apkg - package manager for Agda☆38Updated 4 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆55Updated 8 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Updated 6 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆60Updated last year
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- being the materials for Summer 2013's course☆113Updated 2 years ago