93 search results - page 1 / 19 » A Hierarchy of Semantics for Non-deterministic Term Rewritin... |
ENTCS
2007
13 years 4 months ago
2007
We define a rewrite strategy for a class of non-confluent constructor-based term graph rewriting systems and discuss its correctness. Our strategy and its extension to narrowing...
FSTTCS
2008
Springer
13 years 5 months ago
2008
Springer
ABSTRACT. Formalisms involving some degree of nondeterminism are frequent in computer science. In particular, various programming or specification languages are based on term rewr...
CTCS
1997
Springer
13 years 8 months ago
1997
Springer
Monads can be used to model term rewriting systems by generalising the well-known equivalence between universal algebra and monads on the category Set. In [L¨u96], this semantics ...
AGP
1994
IEEE
13 years 8 months ago
1994
IEEE
This paper considers compositions of conditional term rewriting systems as a basis for a modular approach to the design and analysis of equational logic programs. In this context,...
TCS
2010
12 years 11 months ago
2010
