Pages that link to "Item:Q1367078"
From MaRDI portal
The following pages link to Termination of nested and mutually recursive algorithms (Q1367078):
Displaying 12 items.
- Proving mutual termination (Q746783) (← links)
- Partial and nested recursive function definitions in higher-order logic (Q972425) (← links)
- Adapting functional programs to higher order logic (Q1029815) (← links)
- Termination of term rewriting using dependency pairs (Q1978641) (← links)
- Semantic subtyping with an SMT solver (Q2913944) (← links)
- Dependency Triples for Improving Termination Analysis of Logic Programs with Cut (Q3003493) (← links)
- AN EXTENSION OF AN AUTOMATED TERMINATION METHOD OF RECURSIVE FUNCTIONS (Q3021959) (← links)
- Size-based termination of higher-order rewriting (Q4577817) (← links)
- Termination checking with types (Q4659886) (← links)
- On automating the extraction of programs from proofs using product types (Q4916212) (← links)
- Partiality and recursion in interactive theorem provers – an overview (Q5741556) (← links)
- An ordinal measure based procedure for termination of functions (Q5940917) (← links)