500 search results - page 41 / 100 » ACD Term Rewriting |
RTA
2007
Springer
15 years 3 months ago
2007
Springer
We investigate garbage collection of unreachable parts of rooted graphs from a categorical point of view. First, we define this task as the right adjoint of an inclusion functor. ...
CP
1999
Springer
15 years 2 months ago
1999
Springer
Reformulating constraint satisfaction problems (CSPs) in lower arity is a common procedure when computing consistency. Lower arity CSPs are simpler to treat than high arity CSPs. ...
110
click to vote
ENTCS
2007
14 years 9 months ago
2007
In this paper, we present a term rewriting based library for manipulating Java bytecode. We define a mapping from bytecode programs to algebraic terms, and we use Tom, an extensi...
MFCS
1997
Springer
15 years 1 months ago
1997
Springer
It is important for programs to have modular correctness properties. We look at non-deterministic programs expressed as termrewriting systems which compute normal forms of input t...
IEICET
2007
14 years 9 months ago
2007
The completeness (i.e. confluent and terminating) property is an important concept when using a term rewriting system (TRS) as a computational model of functional programming lang...