Termination of nested and mutually recursive algorithms

DOI10.1023/A:1005797629953MaRDI QIDQ1367078zbMATH OpenOpenAlexFDO

Authors Jürgen Giesl

Publication date 4 February 1998

Published in Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1005797629953

zbMATH Keywords

functional programsautomated termination analysis

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Recommendations

• Termination analysis for functional programs
• scientific article; zbMATH DE number 1670762
• scientific article; zbMATH DE number 4072437
• Proving mutual termination

Cited in

(15)

• Adapting functional programs to higher order logic
• AN EXTENSION OF AN AUTOMATED TERMINATION METHOD OF RECURSIVE FUNCTIONS
• Size-based termination of higher-order rewriting
• Termination of term rewriting using dependency pairs
• Automated termination analysis for programs with second-order recursion
• Dependency triples for improving termination analysis of logic programs with cut
• Termination checking with types
• Inductive invariants for nested recursion
• Semantic subtyping with an SMT solver
• scientific article; zbMATH DE number 1670762 (Why is no real title available?)
• Partiality and recursion in interactive theorem provers -- an overview
• An ordinal measure based procedure for termination of functions
• Partial and nested recursive function definitions in higher-order logic
• On automating the extraction of programs from proofs using product types
• Proving mutual termination

This page was built for publication: Termination of nested and mutually recursive algorithms

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