Termination analysis for functional programs
From MaRDI portal
Recommendations
- Programming Languages and Systems
- Termination analysis for partial functions
- Termination analysis and call graph construction for higher-order functional programs
- scientific article; zbMATH DE number 1438809
- Termination analysis for offline partial evaluation of a higher order functional language
- Automatic Termination Verification for Higher-Order Functional Programs
- Control-flow analysis of functional programs
- scientific article; zbMATH DE number 65743
- Termination analysis of linear loop programs
- scientific article; zbMATH DE number 2018591
Cited in
(17)- An ordinal measure based procedure for termination of functions
- Termination Analysis of C Programs Using Compiler Intermediate Languages
- All-Termination(T)
- Automatic termination analysis for functional and imperative programs (Thesis, TU Darmstadt)
- Syntax-guided termination analysis
- Termination Proofs for Recursive Functions in FoCaLiZe
- Context dependent procedures and computed types in \texttt{VeriFun}
- scientific article; zbMATH DE number 4072437 (Why is no real title available?)
- Termination analysis for partial functions
- Termination of algorithms over non-freely generated data types
- Termination Analysis with Calling Context Graphs
- Automatic Termination Verification for Higher-Order Functional Programs
- scientific article; zbMATH DE number 1405455 (Why is no real title available?)
- scientific article; zbMATH DE number 2086511 (Why is no real title available?)
- Automated termination analysis for programs with second-order recursion
- Proving termination of normalization functions for conditional expressions
- Finding Lexicographic Orders for Termination Proofs in Isabelle/HOL
This page was built for publication: Termination analysis for functional programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2702599)
