Tensors of comodels and models for operational semantics

G Plotkin, John Power

Research output: Contribution to journalArticlepeer-review

20 Citations (SciVal)
146 Downloads (Pure)


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.
Original languageEnglish
Pages (from-to)295-311
Number of pages17
JournalElectronic Notes in Theoretical Computer Science
Publication statusPublished - 22 Oct 2008

Bibliographical note

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


Dive into the research topics of 'Tensors of comodels and models for operational semantics'. Together they form a unique fingerprint.

Cite this