76 search results - page 7 / 16 » Subtyping Recursive Games |
130
Voted
ESOP
2008
Springer
15 years 3 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...
109
click to vote
FPCA
1989
15 years 5 months ago
1989
Bounded quantification was introduced by Cardelli and Wegner as a means of typing functions that operate uniformly over all subtypes of a given type. They defined a simple “ob...
144
click to vote
ATVA
2010
Springer
15 years 2 months ago
2010
Springer
We study recursive timed automata that extend timed automata with recursion. Timed automata, as introduced by Alur and Dill, are finite automata accompanied by a finite set of real...
124
click to vote
LICS
2008
IEEE
15 years 8 months ago
2008
IEEE
Collapsible pushdown automata (CPDA) are a new kind of higher-order pushdown automata in which every symbol in the stack has a link to a stack situated somewhere below it. In addi...
122
click to vote
ATAL
2010
Springer
15 years 2 months ago
2010
Springer
Recursive reasoning of the form what do I think that you think that I think (and so on) arises often while acting rationally in multiagent settings. Several multiagent decision-ma...