CALCO
2015
Springer
8 years 8 months ago
2015
Springer
CALCO
2015
Springer
8 years 8 months ago
2015
Springer
The syntactic monoid of a language is generalized to the level of a symmetric monoidal closed category D. This allows for a uniform treatment of several notions of syntactic algeb...
CALCO
2015
Springer
8 years 8 months ago
2015
Springer
Models of concurrent systems employ a wide variety of semantics inducing various notions of process equivalence, ranging from linear-time semantics such as trace equivalence to br...
CALCO
2015
Springer
8 years 8 months ago
2015
Springer
We use the connection between automata and logic to prove that a wide class of coalgebraic fixpoint logics enjoys uniform interpolation. To this aim, first we generalize one of ...
CALCO
2015
Springer
8 years 8 months ago
2015
Springer
In the semantics of programming languages one can view programs as state transformers, or as predicate transformers. Recently the author has introduced ‘stateand-effect’ trian...