iwilare / church-rosserLinks
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
☆28Updated 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
Sorting:
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 5 months ago
- Meta-programming utilities for Agda.☆19Updated 2 weeks ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆46Updated last year
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 11 months ago
- formalization of an equivariant cartesian cubical set model of type theory☆20Updated 7 months ago
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆14Updated last year
- being a particular fragment of Haskell, extended to a proof system☆33Updated 2 weeks ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆20Updated 3 months ago
- A Unifying Cartesian Cubical Set Model☆34Updated 5 years ago
- my phd thesis☆26Updated last year
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- ☆36Updated 3 years ago
- Building A Correct-By-Construction Proof Checkers For Type Theories☆25Updated this week
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Extensions to cubical for categorical logic/type theory☆31Updated this week
- A LaTeX-typeset reproduction of Reynolds' "Types, Abstraction and Parametric Polymorphism"☆30Updated last year
- ☆29Updated 3 years ago
- Congruence Closure Procedure in Cubical Agda☆17Updated 5 years ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated last year
- ☆21Updated 3 years ago
- antifunext☆34Updated last year
- An agda2hs-compatible library for well-scoped syntax☆11Updated 3 months ago
- Algebraic proof discovery in Agda☆34Updated 3 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Formal Topology in Univalent Foundations (WIP).☆36Updated 3 years ago
- A work-in-progress core language for Agda, in Agda☆55Updated 2 months ago
- ☆25Updated 11 months ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago