498 search results - page 8 / 100 » Term Rewriting |
AAECC
2007
Springer
14 years 9 months ago
2007
Springer
We enhance the dependency pair method in order to prove termination using recursive structure analysis in simply-typed term rewriting systems, which is one of the computational mod...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
– We present a methodology for proving termination of left-linear term rewriting systems (TRSs) by using Albert Burroni’s polygraphs, a kind of rewriting systems on algebraic c...
100
click to vote
TCS
2008
14 years 9 months ago
2008
In this paper, we present a fully automatizable approach to detecting loops in standard term rewriting. Our method is based on semi-unification and an unfolding operation which pr...
AB
2007
Springer
15 years 3 months ago
2007
Springer
Abstract The classical attenuation regulation of gene expression in bacteria is considered. We propose to represent the secondary RNA structure in the leader region of a gene or an...
ICALP
1990
Springer
15 years 1 months ago
1990
Springer
Termrewritingsystemsare importantfor computabilitytheoryof abstractdata types,for automatictheorem proving, and for the foundationsof functionalprogramming.In this shortsurveywe pr...