pa-ba / equivalenceLinks
☆13Updated 2 months ago
Alternatives and similar repositories for equivalence
Users that are interested in equivalence are comparing it to the libraries listed below
Sorting:
- Compiler backend for generating Scheme code☆27Updated 2 years ago
- being a particular fragment of Haskell, extended to a proof system☆42Updated 3 months ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated 3 months ago
- CS410 "Advanced Functional Programming"☆27Updated 6 months ago
- The Prettiest Printer☆35Updated last year
- Denotational Semantics of the Untyped Lambda Calculus☆17Updated 9 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 8 months ago
- Generic functions for single-sorted first-order structural unification☆45Updated 6 months ago
- A LaTeX-typeset reproduction of Reynolds' "Types, Abstraction and Parametric Polymorphism"☆31Updated last year
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 4 months ago
- my phd thesis☆26Updated last year
- being bits and pieces I'm inclined to leave lying around☆54Updated 4 months ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 years ago
- classical sequent calculus, embedded in Haskell☆21Updated 2 months ago
- ☆29Updated 3 years ago
- Eventually a practical 2-level TT-based compiler☆29Updated last week
- Implementing a small functional language with a combinator based graph-reduction machine☆36Updated 2 months ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆28Updated 3 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated last month
- Miller/pattern unification in Agda☆67Updated 3 weeks ago
- NbE course @ Chalmers☆28Updated last year
- Constructive Galois connections☆35Updated 7 years ago
- A monadic approach to static analysis following the methodology of AAM☆18Updated 10 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 2 months ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Sturdy is a library for developing sound static analyses in Haskell.☆62Updated 2 years ago