Similar Items: A Characterization of Basic Feasible Functionals Through Higher-Order Rewriting and Tuple Interpretations
- Theory of higher order interpretations and application to Basic Feasible Functions
- From nominal to higher-order rewriting and back again
- Complexity Hierarchies and Higher-order Cons-free Term Rewriting
- The Shapley Value of Tuples in Query Answering
- Cartesian closed 2-categories and permutation equivalence in higher-order rewriting
- Higher Order Automatic Differentiation of Higher Order Functions