Termination Analysis for Functional Programs using Term Orderings
No abstract available.
Related papers
- Automated termination proofs for haskell by term rewriting TOPLAS 2011
- Higher-Order LCTRSs and Their Termination ESOP 2024
- Ranking functions for size-change termination TOPLAS 2009
- Automatic Termination Analysis for Partial Functions Using Polynomial Orderings SAS 1997
- Termination Analysis of Higher-Order Functional Programs APLAS 2005
- Termination Analysis for Offline Partial Evaluation of a Higher Order Functional Language SAS 1996
- Termination analysis and call graph construction for higher-order functional programs ICFP 2007
- Certified ACKBO CPP 2019