sweirich / lambda-n-waysLinks
Benchmarks for capture-avoiding substitution
☆114Updated 3 weeks 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 work-in-progress core language for Agda, in Agda☆52Updated last week
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Strongly-typed System F in Haskell☆117Updated 2 years ago
- A prototypical dependently typed languages with sized types and variances☆109Updated 2 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- A slow-paced introduction to reflection in Agda. ---Tactics!☆101Updated 3 years ago
- SPLV20 course notes☆110Updated 2 years ago
- Total Parser Combinators in Agda☆129Updated 2 years ago
- being an operating system for typechecking processes☆126Updated 2 years ago
- This aims to be the most pretentious implementation of stlc in existence☆63Updated 3 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆99Updated 8 months ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆59Updated 9 months ago
- Agda formalisation of the Introduction to Homotopy Type Theory☆124Updated 3 years ago
- high-performance cubical evaluation☆73Updated last month
- A tutorial on how Agda infers things☆42Updated 4 years ago
- Programming library for Agda☆128Updated 10 months ago
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 8 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- A simple Depdently-Typed Language for Research and Learning☆57Updated 8 years ago
- Organization and planning for the Initial Types Club☆73Updated 2 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- A "implementation" of Girard's paradox in OCaml☆108Updated 10 years ago
- Efficient Haskell effect handlers based on evidence translation.☆82Updated 3 years ago
- A non-interactive proof assistant using the Haskell type system☆37Updated 5 years ago
- System F-omega normalization by hereditary substitution in Agda☆59Updated 5 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 10 months ago
- An interactive theorem prover based on lambda-tree syntax☆95Updated last month
- A small implementation of higher-order unification☆188Updated 7 years ago