TEA: Automatically Proving Termination of Programs in a Non-strict Higher-Order Functional Language
No abstract available.
Related papers
- Automatically disproving fair termination of higher-order functional programs ICFP 2016
- Higher-Order Strictness Analysis in Untyped Lambda Calculus POPL 1986
- Checking equivalence in a non-strict language OOPSLA 2022
- Time and Space Profiling for Non-Strict Higher-Order Functional Languages POPL 1995
- Checking equivalence in a non-strict language JFP 2025
- Temporal verification of higher-order functional programs POPL 2016
- A Relational Approach to Strictness Analysis for Higher-Order Polymorphic Functions POPL 1991
- Positive supercompilation for a higher order call-by-value language POPL 2009