Sciweavers

94 search results - page 6 / 19
» Confluence of Conditional Rewrite Systems
Sort
View
JFLP
2002
101views more  JFLP 2002»
13 years 7 months ago
Complete Selection Functions for a Lazy Conditional Narrowing Calculus
In this paper we extend the lazy narrowing calculus lnc of Middeldorp, Okui, and Ida [26] to conditional rewrite systems. The resulting lazy conditional narrowing calculus lcnc is...
Aart Middeldorp, Taro Suzuki, Mohamed Hamada
AGP
1994
IEEE
13 years 11 months ago
A Compositional Semantics for Conditional Term Rewriting Systems
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,...
María Alpuente, Moreno Falaschi, Marí...
CORR
2006
Springer
113views Education» more  CORR 2006»
13 years 7 months ago
Combining typing and size constraints for checking the termination of higher-order conditional rewrite systems
In a previous work, the first author extended to higher-order rewriting and dependent types the use of size annotations in types, a termination proof technique called type or size ...
Frédéric Blanqui, Colin Riba
RTA
1997
Springer
13 years 11 months ago
Innocuous Constructor-Sharing Combinations
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...
Nachum Dershowitz