437 search results - page 64 / 88 » Proving Termination by Divergence |
ICFP
2010
ACM
13 years 9 months ago
2010
ACM
A monadic parser combinator library which guarantees termination of parsing, while still allowing many forms of left recursion, is described. The library's interface is simil...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extensio...
JAR
2006
13 years 7 months ago
2006
To simplify the task of proving termination and AC-termination of term rewriting systems, elimination transformations have been vigorously studied since the 1990's. Dummy elim...
ENTCS
2007
13 years 7 months ago
2007
Programs in modern functional logic languages are rewrite systems following the constructor discipline but where confluence and termination are not required, thus defining possi...
ORL
2008
13 years 7 months ago
2008
The VPN Tree Routing Conjecture states that there always exists an optimal solution to the symmetric Virtual Private Network Design (sVPND) problem where the paths between all ter...