pa-ba / equivalenceLinks
☆12Updated last month
Alternatives and similar repositories for equivalence
Users that are interested in equivalence are comparing it to the libraries listed below
Sorting:
- classical sequent calculus, embedded in Haskell☆20Updated 3 years ago
- ☆29Updated 3 years ago
- Compiler backend for generating Scheme code☆26Updated last year
- being bits and pieces I'm inclined to leave lying around☆50Updated 6 months ago
- Generic functions for single-sorted first-order structural unification☆46Updated last month
- A language-generic implementation of equality saturation in Haskell☆21Updated 6 years ago
- The Prettiest Printer☆35Updated last year
- Haskell implementation of the Edinburgh Logical Framework☆30Updated last month
- being a particular fragment of Haskell, extended to a proof system☆32Updated 4 months ago
- CS410 "Advanced Functional Programming"☆24Updated last month
- being a collection of Agda-facilitated ramblings☆33Updated 5 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆24Updated 5 months ago
- NbE course @ Chalmers☆28Updated 9 months ago
- A tutorial on how Agda infers things☆43Updated 4 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- An efficient graph library for Haskell☆39Updated last month
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Denotational Semantics of the Untyped Lambda Calculus☆17Updated 4 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 3 months ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 3 years ago
- Invertible parsing for S-expressions☆34Updated 2 months ago
- ☆22Updated 9 years ago
- Regular expressions of types☆16Updated 6 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- Haskell library for doing category theory with a central role for profunctors☆21Updated this week
- Relational algebra implementation in Agda with simple bindings to SQLITE☆13Updated last year
- IO using sized types and copatterns☆35Updated 4 years ago
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆27Updated 2 years ago
- Material for the Agda course at the EUTYPES Summer School '19 in Ohrid☆23Updated 5 years ago