iwilare / church-rosser
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
☆24Updated 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
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 11 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated 5 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆49Updated 5 months 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 2 months ago
- ☆28Updated 2 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- ☆28Updated last year
- Notes (and implementation) of unification with binders☆14Updated 2 months ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆44Updated 11 months ago
- A bottom-up approach to a verified implementation of MLTT☆17Updated last month
- Eventually a practical 2-level TT-based compiler☆27Updated this week
- An extension of the NbE algorithm to produce computational traces☆21Updated 2 years ago
- Simple conversion from Agda text to literate Agda text.☆14Updated 2 months ago
- Congruence Closure Procedure in Cubical Agda☆16Updated 4 years ago
- being a particular fragment of Haskell, extended to a proof system☆26Updated last week
- An implementation of a simple Neural network in Idris using category theory.☆23Updated 4 months ago
- Compiler backend for generating Scheme code☆27Updated last year
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated last month
- Mechanizations of Type Theories☆28Updated 2 months ago
- ☆17Updated 3 years ago
- Let's rethink how we interact with Agda☆18Updated 2 years ago
- A formalization of the theory behind the mugen library☆19Updated 7 months ago
- NbE course @ Chalmers☆28Updated 4 months ago
- Extensions to the cubical stdlib category theory for categorical logic/type theory☆29Updated last week
- ☆23Updated 7 months ago
- Experiments with Realizability in Univalent Type Theory☆17Updated 3 months ago
- An attempt towards univalent classical mathematics in Cubical Agda.☆29Updated last year
- Algebraic proof discovery in Agda☆32Updated 3 years ago