448
click to vote
RTA
2015
Springer
9 years 11 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...
512
click to vote
RTA
2015
Springer
9 years 11 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...
388
click to vote
RTA
2015
Springer
9 years 11 months 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...
376
click to vote
RTA
2015
Springer
9 years 11 months ago
2015
Springer
A contextual semantics – defined in terms of successful termination and may- and shouldconvergence – is analyzed in the synchronous pi-calculus with replication and a constan...
398
click to vote
RTA
2015
Springer
9 years 11 months 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...