iwilare / church-rosser
A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) and the proof by Nagele-van Oostrom-Sternagel (2016); reuses the infrastructure for λ-terms and substitutions provided by the PLFA book
☆25Updated 2 years ago
Alternatives and similar repositories for church-rosser:
Users that are interested in church-rosser are comparing it to the libraries listed below
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated 5 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆49Updated 5 months ago
- Meta-programming utilities for Agda.☆18Updated this week
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 11 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- ☆29Updated 2 years ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated 5 months ago
- ☆29Updated last year
- Mechanizations of Type Theories☆28Updated 2 weeks ago
- A tutorial on how Agda infers things☆41Updated 4 years ago
- A formalization of the theory behind the mugen library☆19Updated 8 months ago
- Congruence Closure Procedure in Cubical Agda☆17Updated 4 years ago
- being a particular fragment of Haskell, extended to a proof system☆30Updated 2 weeks ago
- A bottom-up approach to a verified implementation of MLTT☆17Updated 2 weeks ago
- Set up a specific version of Agda for your GitHub Actions workflow.☆26Updated 4 months ago
- Eventually a practical 2-level TT-based compiler☆27Updated 3 weeks ago
- ☆18Updated 3 years ago
- Algebraic proof discovery in Agda☆32Updated 3 years ago
- An attempt towards univalent classical mathematics in Cubical Agda.☆29Updated last year
- Notes (and implementation) of unification with binders☆14Updated 3 months ago
- formalization of an equivariant cartesian cubical set model of type theory☆20Updated 2 months ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated last month
- Simple conversion from Agda text to literate Agda text.☆14Updated 2 months ago
- Organize mathematical thoughts☆19Updated last year
- ☆23Updated 8 months ago
- Agda formalisation of second-order abstract syntax☆54Updated 2 years ago
- Synthetic geometry. Probably mostly algebraic geometry.☆23Updated last year
- ☆36Updated 3 years ago
- my phd thesis☆26Updated 7 months ago