1650 search results - page 75 / 330 » The HOM problem is decidable |
ICFP
2004
ACM
14 years 10 months ago
2004
ACM
We study a type system equipped with universal types and equirecursive types, which we refer to as F?. We show that type equality may be decided in time O(n log n), an improvement...
SOFSEM
2009
Springer
14 years 7 months ago
2009
Springer
We prove NP-hardness of pure Nash equilibrium for some problems of scheduling games and connection games. The technique is standard: first, we construct a gadget without the desir...
SAC
2010
ACM
14 years 5 months ago
2010
ACM
Analysis of systems containing both discrete and continuous dynamics, hybrid systems, is a difficult issue. Most problems have been shown to be undecidable in general, and decidab...
FOSSACS
2010
Springer
14 years 4 months ago
2010
Springer
Depth-bounded processes form the most expressive known fragment of the π-calculus for which interesting verification problems are still decidable. In this paper we develop an ade...
FOSSACS
2009
Springer
14 years 4 months ago
2009
Springer
We introduce a new kind of tree automaton, a dependency tree automaton, that is suitable for deciding properties of classes of terms with binding. Two kinds of such automaton are d...