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
| Project Name | Stars | Downloads | Repos Using This | Packages Using This | Most Recent Commit | Total Releases | Latest Release | Open Issues | License | Language |
|---|---|---|---|---|---|---|---|---|---|---|
| Hol | 572 | 3 months ago | 159 | other | Standard ML | |||||
| Canonical sources for HOL4 theorem-proving system. Branch develop is where “mainline development” occurs; when develop passes our regression tests, master is merged forward to catch up. | ||||||||||
| Pomagma | 15 |  | 5 | a year ago | 13 | July 23, 2015 | 12 | other | C++ | |
| An inference engine for extensional untyped λ-calculus | ||||||||||
| Math O Matic | 6 | 8 months ago | 26 | mit | TypeScript | |||||
| Computerized proof system on the web | ||||||||||
| Church Rosser | 6 | 2 years ago | mit | Agda | ||||||
| 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 | ||||||||||
Alternatives To Church RosserSelect To Compare
Alternative Project Comparisons
Popular Theorem Proving Projects
Popular Lambda Calculus Projects
Popular Mathematics Categories
Related Searches
Get A Weekly Email With Trending Projects For These Categories
No Spam. Unsubscribe easily at any time.
Lambda Calculus
Theorem Proving