10 search results - page 1 / 2 » Higher-Order Matching, Games and Automata |
83
Voted
CORR
2007
Springer
15 years 24 days ago
2007
Springer
Abstract. We prove an n-exptime lower bound for the problem of deciding the winner in a reachability game on Higher Order Pushdown Automata (HPDA) of level n. This bound matches th...
111
Voted
LICS
2007
IEEE
15 years 7 months ago
2007
IEEE
Higher-order matching is the problem given t = u where t, u are terms of simply typed λ-calculus and u is closed, is there a substitution θ such that tθ and u have the same nor...
121
click to vote
LICS
2008
IEEE
15 years 7 months ago
2008
IEEE
In this paper we consider parity games defined by higher-order pushdown automata. These automata generalise pushdown automata by the use of higher-order stacks, which are nested ...
120
click to vote
ESOP
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. We survey recent developments in an approach to the verification of higher-order computation based on game semantics. Higherorder recursion schemes are in essence (progra...
116
Voted
FCT
2009
Springer
15 years 4 months ago
2009
Springer
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...