sweirich / lambda-n-ways
Benchmarks for capture-avoiding substitution
☆113Updated last month
Alternatives and similar repositories for lambda-n-ways:
Users that are interested in lambda-n-ways are comparing it to the libraries listed below
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆80Updated 8 years ago
- Strongly-typed System F in Haskell☆117Updated 2 years ago
- being an operating system for typechecking processes☆125Updated last year
- This aims to be the most pretentious implementation of stlc in existence☆62Updated 3 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- A prototypical dependently typed languages with sized types and variances☆107Updated 2 years ago
- A slow-paced introduction to reflection in Agda. ---Tactics!☆100Updated 2 years ago
- Total Parser Combinators in Agda☆126Updated last year
- SPLV20 course notes☆108Updated 2 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆123Updated 9 months ago
- Agda bindings to SMT-LIB2 compatible solvers.☆96Updated 5 months ago
- Lecture notes on realizability☆73Updated last month
- Selected Papers of Dana S. Scott☆158Updated 9 months ago
- high-performance cubical evaluation☆70Updated 3 months ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- A tutorial on how Agda infers things☆41Updated 4 years ago
- Organization and planning for the Initial Types Club☆73Updated 2 years ago
- Agda formalisation of the Introduction to Homotopy Type Theory☆124Updated 3 years ago
- Agda formalisation of second-order abstract syntax☆54Updated 2 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- Compiling Agda code to readable Haskell☆183Updated last week
- Fast equality saturation in Haskell☆84Updated last month
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆75Updated 4 months ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆52Updated 7 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆55Updated 3 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆56Updated 11 months ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 9 months 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 2 months ago