207
click to vote
CALCO
2015
Springer
9 years 11 months ago
2015
Springer
A format for well-behaved translations between structural operational specifications is derived from a notion of distributive law morphism, previously studied by Power and Watana...
106
click to vote
CALCO
2015
Springer
9 years 11 months ago
2015
Springer
More than a decade has passed since Herbrand’s theorem was first generalized to arbitrary institutions, enabling in this way the development of the logic-programming paradigm o...
124
click to vote
CALCO
2015
Springer
9 years 11 months ago
2015
Springer
We extend earlier work on linear time fixpoint logics for coalgebras with branching, by showing how propositional operators arising from the choice of branching monad can be cano...
113
click to vote
CALCO
2015
Springer
9 years 11 months ago
2015
Springer
We give a technique to construct a final coalgebra in which each element is a set of formulas of modal logic. The technique works for both the finite and the countable powerset ...