8 search results - page 1 / 2 » Uniqueness of Normal Forms is Decidable for Shallow Term Rew... |
FSTTCS
2010
Springer
13 years 2 months ago
2010
Springer
Uniqueness of normal forms (UN= ) is an important property of term rewrite systems. UN= is decidable for ground (i.e., variable-free) systems and undecidable in general. Recently ...
AAECC
2010
Springer
13 years 5 months ago
2010
Springer
CTRS
1992
13 years 9 months ago
1992
ded abstract of this paper is published in the proceedings of the 3rd International Workshop on Conditional Term Rewriting Systems, Pont- -Mousson, 1992 1
BIRTHDAY
2005
Springer
13 years 10 months ago
2005
Springer
Huet and L´evy (1979) showed that needed reduction is a normalizing strategy for orthogonal (i.e., left-linear and non-overlapping) term rewriting systems. In order to obtain a de...
MFCS
1997
Springer
13 years 9 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...