Sciweavers

498 search results - page 5 / 100
» Term Rewriting
Sort
View
CADE
2008
Springer
15 years 10 months ago
Modularity of Confluence
We present a novel proof of Toyama's famous modularity of confluence result for term rewriting systems. Apart from being short and intuitive, the proof is modular itself in th...
Vincent van Oostrom
FLOPS
2010
Springer
14 years 8 months ago
Proving Injectivity of Functions via Program Inversion in Term Rewriting
Injectivity is one of the important properties for functions while it is undecidable in general and decidable for linear treeless functions. In this paper, we show new sufficient c...
Naoki Nishida, Masahiko Sakai
IANDC
2008
131views more  IANDC 2008»
14 years 9 months ago
Termination of just/fair computations in term rewriting
The main goal of this paper is to apply rewriting termination technology --enjoying a quite mature set of termination results and tools-- to the problem of proving automatically t...
Salvador Lucas, José Meseguer
FLOPS
2010
Springer
15 years 4 months ago
Complexity Analysis by Graph Rewriting
Recently, many techniques have been introduced that allow the (automated) classification of the runtime complexity of term rewrite systems (TRSs for short). In this paper we show ...
Martin Avanzini, Georg Moser
BIBE
2005
IEEE
121views Bioinformatics» more  BIBE 2005»
15 years 3 months ago
RNA Pseudoknot Prediction Using Term Rewriting
RNA plays a critical role in mediating every step of cellular information transfer from genes to functional proteins. Pseudoknots are widely occurring structural motifs found in a...
Xuezheng Fu, Hao Wang, William L. Harrison, Robert...