5499 search results - page 782 / 1100 » Generalized Rewrite Theories |
191
click to vote
SAS
2001
Springer
15 years 12 months ago
2001
Springer
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
178
click to vote
ICNP
2000
IEEE
15 years 12 months ago
2000
IEEE
In multi-hop networks, packet schedulers at downstream nodes have an opportunity to make up for excessive latencies due to congestion at upstream nodes. Similarly, when packets in...
189
click to vote
LICS
2000
IEEE
15 years 12 months ago
2000
IEEE
We study definability and complexity issues for automatic and ω-automatic structures. These are, in general, infinite structures but they can be finitely presented by a collec...
204
click to vote
ACMDIS
2000
ACM
15 years 12 months ago
2000
ACM
To create successful interactive systems, user interface designers need to cooperate with developers and application domain experts in an interdisciplinary team. These groups, how...
197
click to vote
ICFP
2000
ACM
15 years 12 months ago
2000
ACM
We show that standard formulations of intersection type systems are unsound in the presence of computational effects, and propose a solution similar to the value restriction for ...