Plotkin, G. and Power, J., 2008. Tensors of comodels and models for operational semantics. Electronic Notes in Theoretical Computer Science, 218, pp. 295-311.
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.
|Item Type ||Articles|
|Creators||Plotkin, G.and Power, J.|
|Departments||Faculty of Science > Computer Science|
|Publisher Statement||Power_ENTCS_2008_218_295.pdf: NOTICE: this is the author’s version of a work that was accepted for publication in Electronic Notes in Theoretical Computer Science. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Electronic Notes in Theoretical Computer Science, Vol 218, 2008, DOI 10.1016/j.entcs.2008.10.018|
|Additional Information||Proceedings of the 24th Conference on the Mathematical Foundations of Programming Semantics (MFPS XXIV)|
Actions (login required)