TERMINATION OF ABSTRACT REDUCTION SYSTEMS

DOI10.1142/S0129054109006450MaRDI QIDQ3620615zbMATH OpenOpenAlexFDO

Authors Rajeev Goré, Jeremy E. Dawson

Publication date 14 April 2009

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054109006450

zbMATH Keywords

rewritingstrong normalisationwell-founded ordering

Mathematics Subject Classification ID

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

Recommendations

• A proof-theoretic study of abstract termination principles
• scientific article; zbMATH DE number 3930339
• scientific article; zbMATH DE number 2185669
• Computer Science Logic
• Termination of combined (rewrite and λ-calculus) systems

Cites work

• scientific article; zbMATH DE number 3557754 (Why is no real title available?)
• scientific article; zbMATH DE number 3216177 (Why is no real title available?)
• Modular termination proofs for rewriting using dependency pairs
• Narrowing, Abstraction and Constraints for Proving Properties of Reduction Relations
• Natural termination
• On the union of well-founded relations
• Proof-theoretic analysis of termination proofs
• Termination for direct sums of left-linear complete term rewriting systems

Cited in

(7)

• Jumping and escaping: modular termination and the abstract path ordering
• An insertion operator preserving infinite reduction sequences
• Finding Lexicographic Orders for Termination Proofs in Isabelle/HOL
• scientific article; zbMATH DE number 1765685 (Why is no real title available?)
• scientific article; zbMATH DE number 975697 (Why is no real title available?)
• Logic Programming
• Abstract abstract reduction

Describes a project that uses

Uses Software

• Isabelle/HOL

This page was built for publication: TERMINATION OF ABSTRACT REDUCTION SYSTEMS

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