488
click to vote
RTA
9 years 8 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...
485
click to vote
RTA
9 years 8 months ago
2015 Springer
We refine matrix interpretations for proving termination and complexity bounds of term rewrite systems we restricting them to domains that satisfy a system of linear inequalities...
423
click to vote
RTA
9 years 8 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...
421
click to vote
RTA
9 years 8 months 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...
412
click to vote
RTA
9 years 8 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...
|
Theoretical Computer Science