Termination of nested and mutually recursive algorithms
From MaRDI portal
Publication:1367078
DOI10.1023/A:1005797629953zbMATH Open0882.68019OpenAlexW2123640792MaRDI QIDQ1367078FDOQ1367078
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
Recommendations
Cited In (15)
- Proving mutual termination
- AN EXTENSION OF AN AUTOMATED TERMINATION METHOD OF RECURSIVE FUNCTIONS
- On automating the extraction of programs from proofs using product types
- Adapting functional programs to higher order logic
- Termination checking with types
- Dependency triples for improving termination analysis of logic programs with cut
- Inductive invariants for nested recursion
- Size-based termination of higher-order rewriting
- Termination of term rewriting using dependency pairs
- Title not available (Why is that?)
- Partiality and recursion in interactive theorem provers -- an overview
- Automated termination analysis for programs with second-order recursion
- Partial and nested recursive function definitions in higher-order logic
- Semantic subtyping with an SMT solver
- An ordinal measure based procedure for termination of functions
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)
