Sciweavers

15 search results - page 1 / 3
» Higher-Order Hierarchies
Sort
View
ECOOP
2003
Springer
13 years 10 months ago
Higher-Order Hierarchies
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...
Erik Ernst
FCT
2009
Springer
13 years 8 months ago
Parametrized Regular Infinite Games and Higher-Order Pushdown Strategies
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...
Paul Hänsch, Michaela Slaats, Wolfgang Thomas
MFCS
2005
Springer
13 years 10 months ago
The Complexity of Model Checking Higher Order Fixpoint Logic
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...
Martin Lange, Rafal Somla
FOSSACS
2007
Springer
13 years 11 months ago
Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems
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...
Matthew Hague, C.-H. Luke Ong
ADC
2008
Springer
146views Database» more  ADC 2008»
13 years 11 months ago
A Typed Higher-Order Calculus for Querying XML Databases
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 ...
Qing Wang, Klaus-Dieter Schewe