adamgundry / type-inference
Unification and type inference algorithms
☆124Updated 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
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- A prototypical dependently typed languages with sized types and variances☆107Updated 2 years ago
- Agda formalisation of second-order abstract syntax☆53Updated 2 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆49Updated 6 months ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 8 months ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆80Updated 8 years ago
- Where my everyday research happens☆52Updated last week
- Implementation for ICFP 2020 paper☆49Updated 3 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated 2 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 6 months ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- System F-omega normalization by hereditary substitution in Agda☆57Updated 5 years ago
- A TACtic library for Agda☆48Updated 5 months ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated 11 months ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆54Updated 3 years ago
- An interactive theorem prover based on lambda-tree syntax☆92Updated 3 weeks ago
- Benchmarking various normalization algorithms for the lambda calculus☆44Updated 2 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆54Updated 5 months ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆96Updated 4 months ago
- A simple Depdently-Typed Language for Research and Learning☆57Updated 8 years ago
- ☆82Updated 9 months ago
- Formalizations of Gradually Typed Languages in Agda☆57Updated 2 weeks ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- A formalized proof of a version of the initiality conjecture☆41Updated 4 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆70Updated 5 years ago