Abstract
We study the construction of preorders on Set-monads by the semantic TT-lifting. We show the universal property of this construction, and characterise the class of preorders on a monad as a limit of a Cardop -chain. We apply these theoretical results to identifying preorders on some concrete monads, including the powerset monad, maybe monad, and their composite monad. We also relate the construction of preorders and coalgebraic formulation of simulations. © 2013 Springer-Verlag.
Cite
CITATION STYLE
Katsumata, S. Y., & Sato, T. (2013). Preorders on monads and coalgebraic simulations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7794 LNCS, pp. 145–160). https://doi.org/10.1007/978-3-642-37075-5_10
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
