research
∙
07/25/2023
Higher-Order LCTRSs and Their Termination
Logically constrained term rewriting systems (LCTRSs) are a program anal...
share
research
∙
07/25/2023
Complexity Analysis for Call-by-Value Higher-Order Rewriting
In this short paper, we consider a form of higher-order rewriting with a...
research
∙
02/23/2023
Certifying Higher-Order Polynomial Interpretations
Higher-order rewriting is a framework in which one can write higher-orde...
research
∙
06/30/2022
Tuple Interpretations and Applications to Higher-Order Runtime Complexity
Tuple interpretations are a class of algebraic interpretation that subsu...
research
∙
05/03/2021
Tuple Interpretations for Higher-Order Rewriting
We develop a class of algebraic interpretations for many-sorted and high...
research
∙
08/07/2020
Cons-free Programs and Complexity Classes between LOGSPACE and PTIME
Programming language concepts are used to give some new perspectives on ...
research
∙
04/22/2019
Polymorphic Higher-order Termination
We generalise the termination method of higher-order polynomial interpre...
research
∙
02/15/2019
A static higher-order dependency pair framework
We revisit the static dependency pair method for proving termination of ...
research
∙
05/23/2018
The unified higher-order dependency pair framework
In recent years, two higher-order extensions of the powerful dependency ...
research
∙
11/09/2017
h: A Plank for Higher-order Attribute Contraction Schemes
We present and formalize h, a core (or "plank") calculus that can serve ...
research
∙
11/09/2017
Cons-free Programming with Immutable Functions
We investigate the power of non-determinism in purely functional program...
research
∙
11/09/2017
Non-deterministic Characterisations
In this paper, we extend Jones' result -- that cons-free programming wit...
research
∙
11/09/2017
Higher-order Cons-free Interpreters
Constructor rewriting systems are said to be cons-free if any constructo...
research
∙
11/09/2017
