Similar Items: Modular coinduction up-to for higher-order languages via first-order transition systems
- Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo
- Higher Order Automatic Differentiation of Higher Order Functions
- Separating Regular Languages with First-Order Logic
- On the Expressive Power of Higher-Order Pushdown Systems
- Positive Supercompilation for a Higher-Order Call-By-Value Language
- On Higher-Order Probabilistic Subrecursion