AN EXTENSION OF AN AUTOMATED TERMINATION METHOD OF RECURSIVE FUNCTIONS

DOI10.1142/S0129054102001163zbMath1066.68118WikidataQ129356504 ScholiaQ129356504MaRDI QIDQ3021959

Fairouz Kamareddine, François Monin

Publication date: 22 June 2005

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

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• Orderings for term-rewriting systems
• Automating inductionless induction using test sets
• Proofs by induction in equational theories with constructors
• Recursive programming with proofs
• On proving the termination of algorithms by machine
• Automatizing termination proofs of recursively defined functions
• Typing and computational properties of lambda expressions
• Implicit induction in conditional theories
• An ordinal measure based procedure for termination of functions

This page was built for publication: AN EXTENSION OF AN AUTOMATED TERMINATION METHOD OF RECURSIVE FUNCTIONS