Stream processors and comodels

DOI10.46298/lmcs-19(1:2)2023OpenAlexW3168996112MaRDI QIDQ5883748

Richard Garner

Publication date: 22 March 2023

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2106.05473v5

zbMATH Keywords

tracestreamscomodelsbimodelsresidual comodelsstream processors

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Notions of computation and monads
• Induced functors on categories of algebras
• Algebraic and coalgebraic perspectives on interaction laws
• Combining effects: sum and tensor
• Stateful runners of effectful computations
• Adjunction Models For Call-By-Push-Value With Stacks
• Characterising Behavioural Equivalence: Three Sides of One Coin
• Representations of Stream Processors Using Nested Fixed Points
• Program Equivalence is Coinductive
• Runners in Action
• The costructure–cosemantics adjunction for comodels for computational effects
• Toward a Uniform Theory of Effectful State Machines
• Interaction Laws of Monads and Comonads
• Linear usage of state
• Tensors of Comodels and Models for Operational Semantics
• Generic Trace Semantics via Coinduction
• Algebra valued functors in general and tensor products in particular
• Representable Functors and Operations on Rings
• Sound and complete equational reasoning over comodels

This page was built for publication: Stream processors and comodels