500 search results - page 53 / 100 » ACD Term Rewriting |
118
click to vote
RTA
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. Declarative debugging is a semi-automatic technique that starts from an incorrect computation and locates a program fragment responsible for the error by building a tree ...
209
click to vote
AMW
2011
14 years 3 months ago
2011
Subqueries are a poweful feature which allows to enforce reuse, composition, rewriting and optimization in a query language. In this paper we perform a comprehensive study of the i...
LICS
2007
IEEE
15 years 6 months ago
2007
IEEE
When enriching the λ-calculus with rewriting, union types may be needed to type all strongly normalizing terms. However, with rewriting, the elimination rule (∨ E) of union typ...
ENTCS
2008
14 years 12 months ago
2008
Proofs of termination in term rewriting involve solving constraints between terms coming from (parts of) the rules of the term rewriting system. A common way to deal with such con...
109
click to vote
ACSD
2006
IEEE
15 years 6 months ago
2006
IEEE
In this paper, we show how to obtain causal semantics distinguishing ”earlier than” and ”not later than” causality between events from algebraic semantics of Petri nets. J...