TY - JOUR

T1 - Tensors of comodels and models for operational semantics

AU - Plotkin, G

AU - Power, John

N1 - Proceedings of the 24th Conference on the Mathematical Foundations of Programming Semantics (MFPS XXIV)

PY - 2008/10/22

Y1 - 2008/10/22

N2 - In seeking a unified study of computational effects, one must take account of the coalgebraic structure of state in order to give a general operational semantics agreeing with the standard one for state. Axiomatically, one needs a countable Lawvere theory L, a comodel C, typically the final one, and a model M, typically free; one then seeks a previous termtensornext termC⊗M of the comodel with the model that allows operations to flow between the two. We describe such a previous termtensornext term implicit in the abstract category theoretic literature, explain its significance for computational effects, and calculate it in leading classes of examples, primarily involving state.

AB - In seeking a unified study of computational effects, one must take account of the coalgebraic structure of state in order to give a general operational semantics agreeing with the standard one for state. Axiomatically, one needs a countable Lawvere theory L, a comodel C, typically the final one, and a model M, typically free; one then seeks a previous termtensornext termC⊗M of the comodel with the model that allows operations to flow between the two. We describe such a previous termtensornext term implicit in the abstract category theoretic literature, explain its significance for computational effects, and calculate it in leading classes of examples, primarily involving state.

UR - http://www.scopus.com/inward/record.url?scp=54049145172&partnerID=8YFLogxK

UR - http://dx.doi.org/10.1016/j.entcs.2008.10.018

U2 - 10.1016/j.entcs.2008.10.018

DO - 10.1016/j.entcs.2008.10.018

M3 - Article

VL - 218

SP - 295

EP - 311

JO - Electronic Notes in Theoretical Computer Science

JF - Electronic Notes in Theoretical Computer Science

SN - 1571-0661

ER -