71 search results - page 3 / 15 » Bisimilarity in Term Graph Rewriting |
MSCS
2007
13 years 6 months ago
2007
Introduced at the end of the nineties, the Rewriting Calculus (ρ-calculus, for short) is a simple calculus that fully integrates term-rewriting and λ-calculus. The rewrite rules...
PDP
1996
IEEE
13 years 11 months ago
1996
IEEE
MFCS
1997
Springer
13 years 11 months ago
1997
Springer
FOSSACS
2004
Springer
14 years 23 days ago
2004
Springer
Several types of term rewriting systems can be distinguished by the way their rules overlap. In particular, we define the classes of prefix, suffix, bottom-up and top-down system...
RTA
2010
Springer
13 years 11 months ago
2010
Springer
In earlier work, we have shown that for confluent term rewrite systems (TRSs for short), innermost polynomial runtime complexity induces polytime computability of the functions de...