Mode and Termination Checking for Higher-Order Logic Programs
No abstract available.
DOI 10.1007/3-540-61055-3_44
Related papers
- HFL(Z) Validity Checking for Automated Program Verification POPL 2023
- Provably correct, asymptotically efficient, higher-order reverse-mode automatic differentiation POPL 2022
- A Higher-Order Logic for Concurrent Termination-Preserving Refinement ESOP 2017
- Higher-Order LCTRSs and Their Termination ESOP 2024
- Constraint-based termination analysis of logic programs TOPLAS 1999
- Semantics and Termination of Simply-Moded Logic Programs with Dynamic Scheduling ESOP 2001
- Size-change termination as a contract: dynamically and statically enforcing termination for higher-order programs PLDI 2019
- Relatively complete refinement type system for verification of higher-order non-deterministic programs POPL 2018