Similar Items: Theory of higher order interpretations and application to Basic Feasible Functions
- A Characterization of Basic Feasible Functionals Through Higher-Order Rewriting and Tuple Interpretations
- Higher Order Automatic Differentiation of Higher Order Functions
- Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo
- Logical Reasoning for Higher-Order Functions with Local State
- A categorical framework for congruence of applicative bisimilarity in higher-order languages
- Coalgebraic Automata Theory: Basic Results