Skip to main content

Automatic Termination Verification for Higher-Order Functional Programs

Takuya Kuwahara, Tachio Terauchi, Hiroshi Unno, Naoki Kobayashi

PDF DOI 10.1007/978-3-642-54833-8_21 dblp BibTeX

No abstract available.

Related papers

Automatically disproving fair termination of higher-order functional programs ICFP 2016
TEA: Automatically Proving Termination of Programs in a Non-strict Higher-Order Functional Language SAS 1997
Temporal verification of higher-order functional programs POPL 2016
Termination analysis and call graph construction for higher-order functional programs ICFP 2007
HFL(Z) Validity Checking for Automated Program Verification POPL 2023
Relatively complete refinement type system for verification of higher-order non-deterministic programs POPL 2018
A Static Higher-Order Dependency Pair Framework ESOP 2019
Termination Analysis of Higher-Order Functional Programs APLAS 2005