882 search results - page 132 / 177 » A Taste of Rewrite Systems |
107
click to vote
ENTCS
2008
15 years 18 days ago
2008
Towards a unifying model of concurrency, we have designed and implemented LMNtal (pronounced "elemental"), a model and language based on hierarchical graph rewriting tha...
112
click to vote
IANDC
2006
15 years 16 days ago
2006
It is well-known that stable models (as dI-domains, qualitative domains and coherence are not fully abstract for the language PCF. This fact is related to the existence of stable ...
114
Voted
JAR
2006
15 years 15 days ago
2006
The dependency pair technique [1, 11, 12] is a powerful method for automated termination and innermost termination proofs of term rewrite systems (TRSs). For any TRS, it generates ...
82
Voted
SIAMCOMP
2008
15 years 14 days ago
2008
Abstract. Monadic second-order unification is second-order unification where all function constants occurring in the equations are unary. Here we prove that the problem of deciding...
117
Voted
TOG
2008
15 years 13 days ago
2008
This paper addresses the problem of interactively modeling large street networks. We introduce a modeling framework that uses tensor fields to guide the generation of a street gra...