sweirich / lambda-n-ways
Benchmarks for capture-avoiding substitution
☆113Updated this week
Alternatives and similar repositories for lambda-n-ways:
Users that are interested in lambda-n-ways are comparing it to the libraries listed below
- Strongly-typed System F in Haskell☆116Updated 2 years ago
- A prototypical dependently typed languages with sized types and variances☆107Updated 2 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆97Updated 6 months ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- being an operating system for typechecking processes☆126Updated last year
- Normalization by Evaluation for Martin-Löf Type Theory☆124Updated 10 months ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆81Updated 8 years ago
- A work-in-progress core language for Agda, in Agda☆47Updated 3 weeks ago
- Unification and type inference algorithms☆125Updated 10 years ago
- SPLV20 course notes☆108Updated 2 years ago
- A slow-paced introduction to reflection in Agda. ---Tactics!☆101Updated 2 years ago
- This aims to be the most pretentious implementation of stlc in existence☆62Updated 3 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆52Updated 7 years ago
- Total Parser Combinators in Agda☆126Updated last year
- Organization and planning for the Initial Types Club☆73Updated 2 years ago
- high-performance cubical evaluation☆71Updated 4 months ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- Horn Clause Constraint Solving for Liquid Types☆144Updated 2 weeks ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆56Updated 6 months ago
- The Software Foundations book, in GHC☆82Updated 3 months ago
- Agda formalisation of the Introduction to Homotopy Type Theory☆123Updated 3 years ago
- an implementation of stuck macros☆139Updated last month
- Fast equality saturation in Haskell☆84Updated last month
- A tutorial on how Agda infers things☆41Updated 4 years ago
- Fast parsing from bytestrings☆157Updated 3 months ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 8 months ago
- Compiling Agda code to readable Haskell☆186Updated 3 weeks ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- An interactive theorem prover based on lambda-tree syntax☆94Updated 2 months ago
- A (formalised) general definition of type theories☆57Updated 3 years ago