615 search results - page 1 / 123 » Completeness of Combinations of Constructor Systems |
RTA
1991
Springer
13 years 8 months ago
1991
Springer
A term rewriting system is called complete if it is both confluent and strongly norrealizing. Barendregt and Klop showed that the disjoint union of complete term rewriting systems...
PPDP
2001
Springer
13 years 9 months ago
2001
Springer
We define a transformation from a left-linear constructor-based conditional rewrite system into an overlapping inductively sequential rewrite system. This transformation is sound...
RTA
1997
Springer
13 years 8 months ago
1997
Springer
Abstract. We investigate conditions under which con uence and or termination are preserved for constructor-sharing and hierarchical combinations of rewrite systems, one of which is...
FROCOS
2000
Springer
13 years 8 months ago
2000
Springer
In this paper we extend the applicability of our combination method for decision procedures for the word problem to theories sharing non-collapse-free constructors. This extension ...
ENTCS
2007
13 years 4 months ago
2007
We present a technique for inducing functional programs from few, well chosen input/output-examples (I/Oexamples). Potential applications for automatic program or algorithm induct...