sweirich / lambda-n-waysLinks
Benchmarks for capture-avoiding substitution
☆120Updated 4 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☆62Updated 3 months ago
- Strongly-typed System F in Haskell☆119Updated 3 years ago
- This aims to be the most pretentious implementation of stlc in existence☆65Updated 3 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆102Updated 2 months ago
- A slow-paced introduction to reflection in Agda. ---Tactics!☆104Updated 3 years ago
- SPLV20 course notes☆113Updated 2 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆129Updated last year
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- A work-in-progress core language for Agda, in Agda☆55Updated 2 weeks ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- being an operating system for typechecking processes☆130Updated 2 weeks ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- A prototypical dependently typed languages with sized types and variances☆111Updated 3 months ago
- Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆78Updated last month
- Organization and planning for the Initial Types Club☆73Updated 3 years ago
- Programming library for Agda☆133Updated last year
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated 2 months ago
- Total Parser Combinators in Agda☆132Updated 2 months ago
- Selected Papers of Dana S. Scott☆165Updated last year
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- Lecture notes on realizability☆74Updated 8 months ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆73Updated 6 years ago
- Benchmarking various normalization algorithms for the lambda calculus☆47Updated 3 years ago
- high-performance cubical evaluation☆75Updated 5 months ago
- The theory of algebraic graphs formalised in Agda☆91Updated 7 years ago
- A small implementation of higher-order unification☆192Updated 8 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆63Updated last year