Sciweavers

1000 search results - page 72 / 200
» Nominal rewriting systems
Sort
View
AAECC
2005
Springer
128views Algorithms» more  AAECC 2005»
13 years 7 months ago
The size-change principle and dependency pairs for termination of term rewriting
Abstract In [24], a new size-change principle was proposed to verify termination of functional programs automatically. We extend this principle in order to prove termination and in...
René Thiemann, Jürgen Giesl
ICDE
2006
IEEE
119views Database» more  ICDE 2006»
14 years 9 months ago
Laws for Rewriting Queries Containing Division Operators
Relational division, also known as small divide, is a derived operator of the relational algebra that realizes a many-to-one set containment test, where a set is represented as a ...
Ralf Rantzau, Christoph Mangold
ICDE
1997
IEEE
136views Database» more  ICDE 1997»
14 years 9 months ago
Delegation: Efficiently Rewriting History
Transaction delegation, as introduced in ACTA, allows a transaction to transfer responsibility for the operations that it has performed on an object to another transaction. Delega...
Cris Pedregal Martin, Krithi Ramamritham
RTA
2007
Springer
14 years 1 months ago
Adjunction for Garbage Collection with Application to Graph Rewriting
We investigate garbage collection of unreachable parts of rooted graphs from a categorical point of view. First, we define this task as the right adjoint of an inclusion functor. ...
Dominique Duval, Rachid Echahed, Fréd&eacut...
PPDP
2005
Springer
14 years 1 months ago
Program transformation by templates based on term rewriting
Huet and Lang (1978) presented a framework of automated program transformation based on lambda calculus in which programs are transformed according to a given program transformati...
Yuki Chiba, Takahito Aoto, Yoshihito Toyama