Least Upper Bounds on the Size of Church-Rosser Diagrams in Term Rewriting and λ-Calculus

DOI10.1007/978-3-642-12251-4_20zbMath1284.68327OpenAlexW2077032343MaRDI QIDQ3558344

Jakob Grue Simonsen, Jeroen Ketema

Publication date: 4 May 2010

Published in: Functional and Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-12251-4_20

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40)

Cites Work

• Models of computation. An introduction to computability theory
• The typed lambda-calculus is not elementary recursive
• Classical recursion theory. Vol. II
• Degrees of Undecidability in Term Rewriting
• A direct proof of the finite developments theorem
• Upper bounds for standardizations and an application
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Least Upper Bounds on the Size of Church-Rosser Diagrams in Term Rewriting and λ-Calculus