RTA

2015

Springer

8 years 2 days ago
2015

Springer

We present an elementary proof of the classical result that the leftmost outermost strategy is normalizing for left-normal orthogonal rewrite systems. Our proof is local and exten...

RTA

2015

Springer

8 years 2 days ago
2015

Springer

Both operational and denotational semantics are prominent approaches for reasoning about properties of programs and programming languages. In the categorical framework developed b...

RTA

2015

Springer

8 years 2 days ago
2015

Springer

Recently, a standardization theorem has been proven for a variant of Plotkin’s call-by-value lambda-calculus extended by means of two commutation rules (sigma-reductions): this ...

RTA

2015

Springer

8 years 2 days ago
2015

Springer

We present new techniques to prove termination of cycle rewriting, that is, string rewriting on cycles, which are strings in which the start and end are connected. Our main techni...

RTA

2015

Springer

8 years 2 days ago
2015

Springer

Recently it has been observed that the set of all sound linear inference rules in propositional logic is already coNP-complete, i.e. that every boolean tautology can be written as...

RTA

2015

Springer

8 years 2 days ago
2015

Springer

Presentations of categories are a well-known algebraic tool to provide descriptions of categories by the means of generators, for objects and morphisms, and relations on morphisms...

RTA

2015

Springer

8 years 2 days ago
2015

Springer

We reﬁne matrix interpretations for proving termination and complexity bounds of term rewrite systems we restricting them to domains that satisfy a system of linear inequalities...

RTA

2015

Springer

8 years 2 days ago
2015

Springer

Bialgebras and their specialisation Hopf algebras are algebraic structures that challenge traditional mathematical notation, in that they sport two core operations that defy the b...

RTA

2015

Springer

8 years 2 days ago
2015

Springer

A contextual semantics – deﬁned in terms of successful termination and may- and shouldconvergence – is analyzed in the synchronous pi-calculus with replication and a constan...

RTA

2015

Springer

8 years 2 days ago
2015

Springer

Rewriting is a formalism widely used in computer science and mathematical logic. When using rewriting as a programming or modeling paradigm, the rewrite rules describe the transfo...