adamgundry / type-inference
Unification and type inference algorithms
☆123Updated 9 years ago
Related projects ⓘ
Alternatives and complementary repositories for type-inference
- A prototypical dependently typed languages with sized types and variances☆104Updated 2 years ago
- Prototype implementations of systems based on setoid type theory☆64Updated 3 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆70Updated 5 years ago
- Where my everyday research happens☆53Updated last week
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- System F-omega normalization by hereditary substitution in Agda☆56Updated 5 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated 2 years ago
- Agda formalisation of second-order abstract syntax☆52Updated 2 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆78Updated 8 years ago
- ☆80Updated 6 months ago
- Agda programming with holes☆26Updated 3 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated last year
- 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
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated 8 months ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆122Updated 3 months ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆54Updated 5 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆45Updated 3 months ago
- An interactive theorem prover based on lambda-tree syntax☆90Updated this week
- Lambda normalization and conversion checking benchmarks for various implementations☆55Updated 3 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆95Updated last month
- Benchmarks for capture-avoiding substitution☆107Updated 2 years ago
- being the materials for Summer 2013's course☆110Updated last year
- The Penn Locally Nameless Metatheory Library☆71Updated 4 months ago
- Self-contained repository for the eponymous paper☆29Updated 5 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆30Updated 3 weeks ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 4 years ago
- ☆47Updated last month