2014/08/07 by Bartek Klin, Beata Nachyła
Computer Science · #cs.PL
paper · pdf · doi:10.4204/eptcs.160.8
published as EPTCS 160, 2014, pp. 79-93 · In Proceedings EXPRESS/SOS 2014, arXiv:1408.1271
arxiv created 2014/08/07 · arxiv updated 2014/08/08
Some formats of well-behaved operational specifications, correspond to natural transformations of certain types (for example, GSOS and coGSOS laws). These transformations have a common generalization: distributive laws of monads over comonads. We prove that this elegant theoretical generalization has limited practical benefits: it does not translate to any concrete rule format that would be complete for specifications that contain both GSOS and coGSOS rules. This is shown for the case of labeled transition systems and deterministic stream systems.