Orderings for innermost termination

DOI10.1007/978-3-540-32033-3_3MaRDI QIDQ5703865zbMATH OpenOpenAlexFDO

Authors Mirtha-Lina Fernández, Guillem Godoy, Albert Rubio

Publication date 11 November 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b135673

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• On proving termination by innermost termination
• Generalized innermost rewriting
• scientific article; zbMATH DE number 3930339
• Topics in termination
• Deciding Innermost Loops

Cited in

(7)

• Invariants, patterns and weights for ordering terms
• Induction using term orders
• Using context-sensitive rewriting for proving innermost termination of rewriting
• Deciding Innermost Loops
• scientific article; zbMATH DE number 493144 (Why is no real title available?)
• Analysing parallel complexity of term rewriting
• On complexity bounds and confluence of parallel term rewriting

This page was built for publication: Orderings for innermost termination

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5703865)