There are 1 repository under plfa topic.
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
Solutions for PLFA (Programming Language Foundations in Agda) exercise
Answers to the exercises on the book Programming Language Foundations in Agda
Solutions to the book: Programming Language Foundations in Agda, from Wadler, Philip, Wen Kokke, and Jeremy G. Siek