adamgundry / type-inferenceLinks
Unification and type inference algorithms
☆125Updated 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☆112Updated 3 months ago
- System F-omega normalization by hereditary substitution in Agda☆60Updated 6 years ago
- Where my everyday research happens☆55Updated last month
- Benchmarks for capture-avoiding substitution☆120Updated 5 months ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆73Updated 6 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated 3 months ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- ☆51Updated 2 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
- Normalization by Evaluation for Martin-Löf Type Theory☆129Updated last year
- Minimalistic dependent type theory with syntactic metaprogramming☆58Updated last year
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- yacctt: Yet Another Cartesian Cubical Type Theory☆75Updated 7 years ago
- Implementation for ICFP 2020 paper☆54Updated 4 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆61Updated 3 months ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆85Updated 5 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆78Updated 2 months ago
- Proof automation – for Agda, in Agda.☆44Updated 5 years ago
- A TACtic library for Agda☆50Updated last year
- being the materials for Summer 2013's course☆113Updated 2 years ago
- being bits and pieces I'm inclined to leave lying around☆54Updated 4 months ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- ☆84Updated 8 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago