1458 search results - page 51 / 292 » Extended Term Rewriting Systems |
ENTCS
2008
14 years 9 months ago
2008
Proofs of termination in term rewriting involve solving constraints between terms coming from (parts of) the rules of the term rewriting system. A common way to deal with such con...
FMCO
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. Many distributed applications can be understood in terms of components interacting in an open environment. This interaction is not always uniform as the network may consi...
TACS
1994
Springer
15 years 1 months ago
1994
Springer
In the A-calculus, there is a standard notion of what terms should be considered to be "undefined": the unsolvable terms. There are various equivalent characterisations o...
CADE
2010
Springer
14 years 8 months ago
2010
Springer
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. In an automated setting, termination tools are concerned with parametric polynomi...
CORR
2011
Springer
14 years 1 months ago
2011
Springer
—Fitts’ law is a fundamental tool in measuring the capacity of the human motor system. It measures information throughput in terms of the tradeoff between the speed and accurac...