441
click to vote
RTA
2015
Springer
9 years 11 months 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...
514
click to vote
RTA
2015
Springer
9 years 11 months 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...
422
click to vote
RTA
2015
Springer
9 years 11 months 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 ...
419
click to vote
RTA
2015
Springer
9 years 11 months 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...
461
click to vote
RTA
2015
Springer
9 years 11 months 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...