94 search results - page 3 / 19 » Confluence of Conditional Rewrite Systems |
WEBI
2001
Springer
13 years 12 months ago
2001
Springer
We focus on well-behaved Adaptive Hypermedia Systems, which means the adaptation engine that executes adaptation rules always terminates and produces predictable (confluent) adapta...
FSTTCS
1998
Springer
13 years 11 months ago
1998
Springer
In [NO88], a particular trace monoid M is constructed such that for the class of length
RTA
2000
Springer
13 years 11 months ago
2000
Springer
APAL
2008
13 years 7 months ago
2008
Building on previous work by Coquand and Spiwack [8] we construct a strict domaintheoretic model for the untyped -calculus with pattern matching and term rewriting which has the p...
RTA
2010
Springer
13 years 11 months ago
2010
Springer
Decreasing diagrams technique (van Oostrom, 1994) is a technique that can be widely applied to prove confluence of rewrite systems. To directly apply the decreasing diagrams techn...