Termination of combined (rewrite and λ-calculus) systems

DOI10.1007/3-540-56393-8_10OpenAlexW1258827811MaRDI QIDQ5881181

Carlos Loría-Sáenz, Joachim Steinbach

Publication date: 9 March 2023

Published in: Conditional Term Rewriting Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-56393-8_10

Mathematics Subject Classification ID

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

Related Items

A termination ordering for higher order rewrite systems, A recursive path ordering for higher-order terms in η-long β-normal form, Higher order conditional rewriting and narrowing, Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility, The Computability Path Ordering: The End of a Quest, Rewrite orderings for higher-order terms in \(\eta\)-long \(\beta\)-normal form and the recursive path ordering

Cites Work

• Orderings for term-rewriting systems
• A rationale for conditional equational programming
• Polymorphic rewriting conserves algebraic strong normalization
• Unnamed Item