Adding algebraic rewriting to the untyped lambda calculus
- 1 December 1992
- journal article
- Published by Elsevier in Information and Computation
- Vol. 101 (2) , 251-267
- https://doi.org/10.1016/0890-5401(92)90064-m
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- On termination of the direct sum of term-rewriting systemsInformation Processing Letters, 1987
- Termination of rewritingJournal of Symbolic Computation, 1987
- On the Church-Rosser property for the direct sum of term rewriting systemsJournal of the ACM, 1987
- The Church-Rosser theorem for the typed $\lambda$-calculus with surjective pairing.Notre Dame Journal of Formal Logic, 1981
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980