Sciweavers

498 search results - page 7 / 100
» Term Rewriting
Sort
View
AGP
1994
IEEE
15 years 1 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í...
WADT
1998
Springer
15 years 1 months ago
Complete Strategies for Term Graph Narrowing
Abstract. Narrowing is a method for solving equations in the equational theories of term rewriting systems. Unification and rewriting, the central operations in narrowing, are ofte...
Annegret Habel, Detlef Plump
143
Voted
ICLP
2009
Springer
15 years 10 months ago
Demand-Driven Normalisation for ACD Term Rewriting
ACD Term Rewriting (ACDTR) is term rewriting modulo associativity, commutativity, and a limited form of distributivity called conjunctive context. Previous work presented an implem...
Leslie De Koninck, Gregory J. Duck, Peter J. Stuck...
68
Voted
CORR
2006
Springer
132views Education» more  CORR 2006»
14 years 9 months ago
ACD Term Rewriting
ACD Term Rewriting (ACDTR) is term rewriting modulo associativity, commutativity, and a limited form of distributivity called conjunctive context. Previous work presented an implem...
Gregory J. Duck, Peter J. Stuckey, Sebastian Brand
FSTTCS
2008
Springer
14 years 10 months ago
A Hierarchy of Semantics for Non-deterministic Term Rewriting Systems
ABSTRACT. Formalisms involving some degree of nondeterminism are frequent in computer science. In particular, various programming or specification languages are based on term rewr...
Juan Rodríguez-Hortalá