Ketema, Jeroen; Simonsen, Jakob Grue Least upper bounds on the size of confluence and Church-Rosser diagrams in term rewriting and \(\lambda\)-calculus. (English) Zbl 1354.68143 ACM Trans. Comput. Log. 14, No. 4, Article No. 31, 28 p. (2013). Cited in 4 Documents MSC: 68Q42 Grammars and rewriting systems 03B40 Combinatory logic and lambda calculus 03D20 Recursive functions and relations, subrecursive hierarchies Keywords:Church-Rosser property; term rewriting; confluence; lambda calculus; upper bounds; computable function; Grzegorczyk hierarchy PDF BibTeX XML Cite \textit{J. Ketema} and \textit{J. G. Simonsen}, ACM Trans. Comput. Log. 14, No. 4, Article No. 31, 28 p. (2013; Zbl 1354.68143) Full Text: DOI OpenURL