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
☆23Updated 2 years ago
Related projects ⓘ
Alternatives and complementary repositories for church-rosser
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆33Updated 5 years ago
- formalization of an equivariant cartesian cubical set model of type theory☆19Updated 3 months ago
- Notes (and implementation) of unification with binders☆14Updated 3 weeks ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated 9 months ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆14Updated 11 years ago
- Simple conversion from Agda text to literate Agda text.☆14Updated 6 months ago
- ☆28Updated 2 years ago
- A bottom-up approach to a verified implementation of MLTT☆15Updated this week
- A Logical Relation for Martin-Löf Type Theory in Agda☆45Updated last month
- Mechanizations of Type Theories☆27Updated 2 weeks ago
- A tutorial on how Agda infers things☆34Updated 3 years ago
- Generalized syntax & semantics for universe hierarchies☆28Updated 10 months ago
- Experiments with higher-order abstract syntax in Agda☆19Updated 2 years ago
- Extensions to the cubical stdlib category theory for categorical logic/type theory☆25Updated this week
- being a particular fragment of Haskell, extended to a proof system☆20Updated this week
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated last year
- Congruence Closure Procedure in Cubical Agda☆16Updated 4 years ago
- ☆16Updated 7 months ago
- Algebraic proof discovery in Agda☆32Updated 2 years ago
- Let's rethink how we interact with Agda☆18Updated last year
- An attempt towards univalent classical mathematics in Cubical Agda.☆29Updated last year
- ☆46Updated last month
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 6 years ago
- ☆27Updated last year
- antifunext☆28Updated 4 months ago
- Compiler backend for generating Scheme code☆25Updated 11 months ago
- my phd thesis☆26Updated 3 months ago
- A formalization of the theory behind the mugen library☆15Updated 4 months ago
- Set up a specific version of Agda for your GitHub Actions workflow.☆26Updated 3 weeks ago
- Spartan implementation of H.O.T.T.☆25Updated 2 years ago