11588 search results - page 139 / 2318 » Will They Like This |
CAAP
1990
14 years 2 months ago
1990
act We show how to modelize concurrency between several processors in terms of automata and Markov chains; then, we define a concurrency measure which reflects more faithfully the ...
POPL
1989
ACM
14 years 2 months ago
1989
ACM
Dynamic typing can be useful in statically typed languages. We extend the simply typed λ-calculus with dynamic typing and elaborate additional features like polymorphism and subty...
ESEM
2009
ACM
14 years 2 months ago
2009
ACM
The long-term sustainability of a software product depends on more than developing features. Priorities are placed on aspects that support the development of software, like softwar...
AISC
2004
Springer
14 years 2 months ago
2004
Springer
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. We show how polynomial interpretations with negative coefficients, like x - 1 for...
ANTS
2006
Springer
14 years 2 months ago
2006
Springer
We describe methods for explicit computation of Galois groups of certain tamely ramified p-extensions. In the finite case this yields a short list of candidates for the Galois grou...