Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
423999 | Electronic Notes in Theoretical Computer Science | 2010 | 21 Pages |
Abstract
A previously introduced combination of the bialgebraic approach to structural operational semantics with coalgebraic modal logic is re-examined and improved in some aspects. Firstly, a more abstract, conceptual proof of the main compositionality theorem is given, based on an understanding of modal logic as a study of coalgebras in slice categories of adjunctions. Secondly, a more concrete understanding of the assumptions of the theorem is provided, where proving compositionality amounts to finding a syntactic distributive law between two collections of predicate liftings.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics