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
☆27Updated 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 last month
- Meta-programming utilities for Agda.☆19Updated 3 weeks ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆52Updated 7 months ago
- formalization of an equivariant cartesian cubical set model of type theory☆20Updated 4 months ago
- A bottom-up approach to a verified implementation of MLTT☆18Updated 2 months ago
- ☆29Updated 2 years ago
- Mechanizations of Type Theories☆28Updated 2 months ago
- ☆29Updated 2 years ago
- Organize mathematical thoughts☆20Updated last year
- ☆19Updated 3 years ago
- Experiments with higher-order abstract syntax in Agda☆21Updated 2 years ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆19Updated last week
- An attempt towards univalent classical mathematics in Cubical Agda.☆29Updated last year
- Synthetic geometry. Probably mostly algebraic geometry.☆23Updated last year
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- ☆17Updated last year
- Notes (and implementation) of unification with binders☆14Updated last month
- ☆15Updated last year
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- A formalization of the theory behind the mugen library☆19Updated 10 months ago
- ☆23Updated 10 months ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆44Updated last year
- A tutorial on how Agda infers things☆41Updated 4 years ago
- Simple conversion from Agda text to literate Agda text.☆14Updated last month
- my phd thesis☆26Updated 8 months ago
- An extension of the NbE algorithm to produce computational traces☆21Updated 3 years ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated 7 months ago
- Set up a specific version of Agda for your GitHub Actions workflow.☆27Updated 6 months ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago