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
☆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
Sorting:
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 2 months ago
- ☆29Updated 2 years ago
- A bottom-up approach to a verified implementation of MLTT☆20Updated this week
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 8 months ago
- Meta-programming utilities for Agda.☆19Updated 3 weeks ago
- ☆19Updated 3 years ago
- being a particular fragment of Haskell, extended to a proof system☆32Updated 3 months ago
- Mechanizations of Type Theories☆29Updated 3 months ago
- ☆29Updated 2 years ago
- Experiments with Realizability in Univalent Type Theory☆18Updated 7 months ago
- Algebraic proof discovery in Agda☆33Updated 3 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- Notes (and implementation) of unification with binders☆14Updated 3 weeks ago
- Research material of Erik Palmgren (1963–2019)☆20Updated last month
- ☆23Updated 11 months ago
- Set up a specific version of Agda for your GitHub Actions workflow.☆27Updated 2 weeks ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆45Updated last year
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- ☆15Updated last year
- A formalization of the theory behind the mugen library☆19Updated 11 months ago
- Synthetic geometry. Probably mostly algebraic geometry.☆24Updated last year
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆19Updated last month
- formalization of an equivariant cartesian cubical set model of type theory☆20Updated 4 months ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated 8 months ago
- An attempt towards univalent classical mathematics in Cubical Agda.☆29Updated last year
- Syntax for Virtual Equipments: a natural syntax for doing synthetic and internal category theory☆32Updated 2 years ago
- Partial combinatory algebras and realizability interpretations of arithmetic, in Coq.☆13Updated 8 years ago
- Using Forester, We are attempting to resurrect and grow the since deleted model theory wiki and give it a better foundation for future gr…☆16Updated 3 months ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 4 months ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago