30 search results - page 3 / 6 » On Constructor Rewrite Systems and the Lambda-Calculus |
RTA
1997
Springer
15 years 1 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...
105
click to vote
CADE
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. A method based on dependency pairs for showing termination of functional programs on data structures generated by constructors with relations is proposed. A functional pr...
PPDP
2001
Springer
15 years 2 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
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Partial-inversion compilers generate programs which compute some unknown inputs of given programs from a given output and the rest of inputs whose values are already give...
RTA
1991
Springer
15 years 1 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...