76 search results - page 6 / 16 » Subtyping Recursive Games |
FOSSACS
2009
Springer
15 years 4 months ago
2009
Springer
Higher-order recursion schemes are systems of rewrite rules on typed non-terminal symbols, which can be used to define infinite trees. The Global Modal Mu-Calculus Model Checking...
LICS
1998
IEEE
15 years 1 months ago
1998
IEEE
CORR
2008
Springer
14 years 9 months ago
2008
Springer
POPL
1995
ACM
15 years 1 months ago
1995
ACM
Flow-based safety analysis of higher-order languages has been studied by Shivers, and Palsberg and Schwartzbach. Open until now is the problem of finding a type system that accep...
ATAL
2009
Springer
15 years 4 months ago
2009
Springer
Two-player games of billiards, of the sort seen in recent Computer Olympiads held by the International Computer Games Association, are an emerging area with unique challenges for ...