Termination of nested and mutually recursive algorithms

DOI10.1023/A:1005797629953zbMath0882.68019OpenAlexW2123640792MaRDI QIDQ1367078

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)

Related Items (10)

Semantic subtyping with an SMT solver ⋮ Size-based termination of higher-order rewriting ⋮ Dependency Triples for Improving Termination Analysis of Logic Programs with Cut ⋮ Termination of term rewriting using dependency pairs ⋮ On automating the extraction of programs from proofs using product types ⋮ Termination checking with types ⋮ Partiality and recursion in interactive theorem provers – an overview ⋮ Partial and nested recursive function definitions in higher-order logic ⋮ An ordinal measure based procedure for termination of functions ⋮ Adapting functional programs to higher order logic

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