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