On the relationship between higher-order recursion schemes and higher-order fixpoint logic
Abstract
We study the relationship between two kinds of higher-order extensions
Related papers
- On the Relationship between Dijkstra Monads and Higher-Order Fixpoint Logic ESOP 2025
- Higher-Order Property-Directed Reachability ICFP 2023
- Algebraic Temporal Effects: Temporal Verification of Recursively Typed Higher-Order Programs POPL 2025
- Propositional Dynamic Logic for Higher-Order Functional Programs CAV 2018
- Types and Recursion Schemes for Higher-Order Program Verification APLAS 2009
- Space-Efficient Model-Checking of Higher-Order Recursion Schemes VMCAI 2025
- Practical Alternating Parity Tree Automata Model Checking of Higher-Order Recursion Schemes APLAS 2013
- Indexed Realizability for Bounded-Time Programming with References and Type Fixpoints APLAS 2012