10871 search results - page 8 / 2175 » A stable programming language |
FOSSACS
2004
Springer
14 years 27 days ago
2004
Springer
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpretations over the real numbers. Monotonicity (another usual requirement in termi...
TOOLS
2000
IEEE
13 years 12 months ago
2000
IEEE
POS
1990
Springer
13 years 11 months ago
1990
Springer
FOSSACS
2000
Springer
13 years 11 months ago
2000
Springer
We relate several models of concurrency introduced in the literature in order to extend classical Mazurkiewicz traces. These are mainly Droste's concurrent automata and Arnold...
ICDT
1995
ACM
13 years 11 months ago
1995
ACM
