sweirich / lambda-n-waysLinks
Benchmarks for capture-avoiding substitution
☆119Updated 3 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:
- A tutorial on how Agda infers things☆61Updated 2 months ago
- This aims to be the most pretentious implementation of stlc in existence☆64Updated 3 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆129Updated last year
- A slow-paced introduction to reflection in Agda. ---Tactics!☆103Updated 3 years ago
- A prototypical dependently typed languages with sized types and variances☆111Updated last month
- SPLV20 course notes☆112Updated 2 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆102Updated last month
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Strongly-typed System F in Haskell☆118Updated 2 years ago
- high-performance cubical evaluation☆75Updated 4 months ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated last month
- A small implementation of higher-order unification☆190Updated 8 years ago
- Benchmarking various normalization algorithms for the lambda calculus☆47Updated 3 years ago
- Organization and planning for the Initial Types Club☆73Updated 2 years ago
- A work-in-progress core language for Agda, in Agda☆55Updated 2 weeks ago
- Selected Papers of Dana S. Scott☆162Updated last year
- being an operating system for typechecking processes☆128Updated 2 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- A "implementation" of Girard's paradox in OCaml☆109Updated 10 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆76Updated 2 weeks ago
- Total Parser Combinators in Agda☆132Updated last month
- Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
- Lecture notes on realizability☆74Updated 6 months ago
- ☆48Updated 3 weeks ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 3 years ago
- Efficient Haskell effect handlers based on evidence translation.☆84Updated 4 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago