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 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:
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 2 months ago
- being a particular fragment of Haskell, extended to a proof system☆42Updated 3 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 7 months ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆47Updated last year
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 6 months ago
- Building A Correct-By-Construction Proof Checkers For Type Theories☆29Updated last month
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆15Updated last year
- Algebraic proof discovery in Agda☆35Updated 3 years ago
- ☆36Updated 4 years ago
- Lecture notes on realizability☆74Updated 8 months ago
- Synthetic geometry. Probably mostly algebraic geometry.☆25Updated last year
- Meta-programming utilities for Agda.☆20Updated 3 months ago
- formalization of an equivariant cartesian cubical set model of type theory☆20Updated 10 months ago
- # A simple variable binding library based on well-scoped indices and environments☆27Updated 3 weeks ago
- A Unifying Cartesian Cubical Set Model☆34Updated 6 years ago
- Formal Topology in Univalent Foundations (WIP).☆36Updated 3 years ago
- A graduate course on formalized mathematics at the Faculty of Mathematics and Physics, University of Ljubljana, Fall semester 2024/25☆27Updated 10 months ago
- Congruence Closure Procedure in Cubical Agda☆17Updated 5 years ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated 2 years ago
- A work-in-progress core language for Agda, in Agda☆59Updated this week
- An attempt towards univalent classical mathematics in Cubical Agda.☆32Updated 2 years ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- A LaTeX-typeset reproduction of Reynolds' "Types, Abstraction and Parametric Polymorphism"☆31Updated last year
- ☆21Updated 3 years ago
- Extensions to cubical for categorical logic/type theory☆34Updated this week
- A cost-aware logical framework, embedded in Agda.☆67Updated this week
- An implementation of a simple Neural network in Idris using category theory.☆23Updated last year
- being an implementation of the calculus of constructions☆17Updated 2 years ago
- antifunext☆34Updated last year