This paper explains how higher-order hierarchies can be used to handle the expression problem. The expression is concerned with extending both the set of data structures and the s...
Given a set P of natural numbers, we consider infinite games where the winning condition is a regular -language parametrized by P. In this context, an -word, representing a play, h...
This paper analyses the computational complexity of the model checking problem for Higher Order Fixpoint Logic – the modal µ-calculus enriched with a typed λ-calculus. It is ha...
Higher-order pushdown systems (PDSs) generalise pushdown systems through the use of higher-order stacks, that is, a nested “stack of stacks” structure. These systems may be us...
As the eXtensible Markup Language (XML) is about to emerge as a new standard for databases, the problem of providing solid logical grounds for XML query languages arises. For the ...