Interested in automated deduction systems or functional programming? This paper introduces an extension of an automated termination method for recursive functions. Inductive proofs are commonly used for establishing the termination of recursively defined functions, but this research develops termination properties that can be shown automatically for a class of functions not previously accounted for. Unlike systems that build formal trees based on inductive proofs, the authors generate measures that satisfy an extended termination property and well-founded orderings which ensure the termination of the functions. This approach broadens the scope of functions for which termination can be automatically verified. The extended termination method can be integrated into systems for automated deduction and functional programming, increasing the efficiency and reliability of these systems. The findings contribute to the development of more robust and versatile tools for program verification and analysis, advancing the state of the art in computer science.
Published in the International Journal of Foundations of Computer Science, this paper aligns with the journal's focus on theoretical foundations and practical applications of computer science. The work's contribution to automated termination methods for recursive functions enhances the journal's coverage of core computer science principles.