sweirich / lambda-n-waysLinks
Benchmarks for capture-avoiding substitution
☆119Updated 2 months ago
Alternatives and similar repositories for lambda-n-ways
Users that are interested in lambda-n-ways are comparing it to the libraries listed below
Sorting:
- This aims to be the most pretentious implementation of stlc in existence☆63Updated 3 years ago
- Strongly-typed System F in Haskell☆118Updated 2 years ago
- A tutorial on how Agda infers things☆59Updated 3 weeks ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆101Updated 9 months ago
- SPLV20 course notes☆112Updated 2 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆128Updated last year
- A slow-paced introduction to reflection in Agda. ---Tactics!☆103Updated 3 years ago
- being an operating system for typechecking processes☆128Updated 2 years ago
- A work-in-progress core language for Agda, in Agda☆55Updated last month
- A prototypical dependently typed languages with sized types and variances☆111Updated last week
- Selected Papers of Dana S. Scott☆162Updated last year
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated last week
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 3 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- high-performance cubical evaluation☆74Updated 3 months ago
- Agda formalisation of the Introduction to Homotopy Type Theory☆125Updated 3 years ago
- An interactive theorem prover based on lambda-tree syntax☆96Updated 2 months ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆75Updated this week
- Lecture notes on realizability☆74Updated 5 months ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- Compiling Agda code to readable Haskell☆190Updated this week
- Total Parser Combinators in Agda☆131Updated 2 years ago
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆60Updated 2 weeks ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago
- Agda lecture notes for the Functional Programming course at TU Delft☆128Updated 2 weeks ago
- Library of the ##dependent distributed research support group☆115Updated last year
- ☆48Updated 2 months ago