71 search results - page 4 / 15 » Bisimilarity in Term Graph Rewriting |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We address the problem of cyclic termgraph rewriting. We propose a new framework where rewrite rules are tuples of the form (L, R, , ) such that L and R are termgraphs representing...
RTA
2011
Springer
12 years 10 months ago
2011
Springer
In [5, 15] we presented an approach to prove termination of non-recursive Java Bytecode (JBC) programs automatically. Here, JBC programs are first transformed to finite terminat...
ENTCS
2002
13 years 7 months ago
2002
We study the partial algebra of typed terms with an associative commutative and idempotent operator (typed AC-terms). The originality lies in the representation of the typing poli...
WADT
1997
Springer
13 years 11 months ago
1997
Springer
The dynamic behavior of rule-based systems (like term rewriting systems 24], process algebras 27], and so on) can be traditionally determined in two orthogonal ways. Either operati...
AGTIVE
2007
Springer
14 years 1 months ago
2007
Springer
In this paper, we will define a custom term-graph reduction system for a simplified lazy functional language. Our custom system is geared towards flexibility, which is accomplis...