123
click to vote
RTA
2010
Springer
15 years 8 months ago
2010
Springer
The K framework, based on rewriting logic semantics, provides a powerful logic for defining the semantics of programming languages. While most work in this area has focused on de...
150
click to vote
RTA
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. In this paper we present our formalization of two important termination techniques for term rewrite systems: the subterm criterion and the reduction pair processor in com...
149
click to vote
RTA
2010
Springer
15 years 8 months ago
2010
Springer
We show that, contrary to the situation in first-order term rewriting, almost none of the usual properties of rewriting are modular for higher-order rewriting, irrespective of the...
RTA
2010
Springer
15 years 8 months ago
2010
Springer
124
click to vote
RTA
2010
Springer
15 years 8 months ago
2010
Springer
For the whole class of linear term rewriting systems and for each integer k, we define k-bounded rewriting as a restriction of the usual notion of rewriting. We show that the k-bo...