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
☆29Updated 3 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☆36Updated 9 months ago
- being a particular fragment of Haskell, extended to a proof system☆43Updated last month
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Updated 4 months ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Meta-programming utilities for Agda.☆20Updated 5 months ago
- Building A Correct-By-Construction Proof Checkers For Type Theories☆29Updated 3 weeks ago
- Algebraic proof discovery in Agda☆35Updated 4 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- my phd thesis☆26Updated last year
- Simple conversion from Agda text to literate Agda text.☆14Updated 2 weeks ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆48Updated 3 weeks ago
- # A simple variable binding library based on well-scoped indices and environments☆28Updated 3 months ago
- A Unifying Cartesian Cubical Set Model☆35Updated 6 years ago
- ☆38Updated 4 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- Mechanizations of Type Theories☆32Updated this week
- Generalized syntax & semantics for universe hierarchies☆32Updated 2 years ago
- A LaTeX-typeset reproduction of Reynolds' "Types, Abstraction and Parametric Polymorphism"☆32Updated last year
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 8 months ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated 2 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 2 months ago
- A type theory with native support for Polynomial Functors.☆41Updated 2 years ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 8 months ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- Implementation of Nuprl's type theory in Coq☆46Updated last year
- antifunext☆38Updated last year
- Congruence Closure Procedure in Cubical Agda☆18Updated 5 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 4 years ago