sweirich / lambda-n-ways
Benchmarks for capture-avoiding substitution
☆109Updated 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☆117Updated 2 years ago
- being an operating system for typechecking processes☆123Updated last year
- A prototypical dependently typed languages with sized types and variances☆107Updated 2 years ago
- SPLV20 course notes☆108Updated 2 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- A slow-paced introduction to reflection in Agda. ---Tactics!☆98Updated 2 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆80Updated 8 years ago
- high-performance cubical evaluation☆69Updated 2 months ago
- This aims to be the most pretentious implementation of stlc in existence☆61Updated 2 years ago
- A tutorial on how Agda infers things☆41Updated 4 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆122Updated 8 months ago
- Total Parser Combinators in Agda☆126Updated last year
- Agda bindings to SMT-LIB2 compatible solvers.☆96Updated 4 months ago
- Unification and type inference algorithms☆124Updated 10 years ago
- Agda formalisation of the Introduction to Homotopy Type Theory☆124Updated 3 years ago
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 3 years ago
- Agda formalisation of second-order abstract syntax☆53Updated 2 years ago
- Fast equality saturation in Haskell☆82Updated 9 months ago
- A work-in-progress core language for Agda, in Agda☆44Updated 3 months ago
- Example implementation of Algorithm W for Hindley-Milner type inference☆79Updated 3 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆52Updated 7 years ago
- Organization and planning for the Initial Types Club☆72Updated 2 years ago
- Language Server for Agda☆106Updated 2 months ago
- Horn Clause Constraint Solving for Liquid Types☆144Updated 2 weeks ago
- Compiling Agda code to readable Haskell☆181Updated this week
- Fast parsing from bytestrings☆156Updated last month
- Selected Papers of Dana S. Scott☆158Updated 8 months ago
- Lecture notes on realizability☆67Updated 4 months ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- The theory of algebraic graphs formalised in Agda☆89Updated 6 years ago