In 2009, Ghani, Hancock and Pattinson gave a coalgebraic characterisation of stream processors A^? ? B^? drawing on ideas of Brouwerian constructivism. Their stream processors have an intensional character; in this paper, we give a corresponding coalgebraic characterisation of extensional stream processors, i.e., the set of continuous functions A^? ? B^?. Our account sites both our result and that of op. cit. within the apparatus of comodels for algebraic effects originating with Power-Shkaravska

Garner, Richard

English

arXiv

In 2009, Hancock, Pattinson and Ghani gave a coalgebraic characterisation ofstream processors $A^\mathbb{N} \to B^\mathbb{N}$ drawing on ideas ofBrouwerian constructivism. Their stream processors have an intensionalcharacter; in this paper, we give a corresponding coalgebraic characterisationof extensional stream processors, i.e., the set of continuous functions$A^\mathbb{N} \to B^\mathbb{N}$. Our account sites both our result and that ofop. cit. within the apparatus of comodels for algebraic effects originatingwith Power-Shkaravska. Within this apparatus, the distinction betweenintensional and extensional equivalence for stream processors arises in thesame way as the the distinction between bisimulation and trace equivalence forlabelled transition systems and probabilistic generative systems

Episciences.org

Stream processors and comodels

In 2009, Hancock, Pattinson and Ghani gave a coalgebraic characterisation of
stream processors $A^\mathbb{N} \to B^\mathbb{N}$ drawing on ideas of
Brouwerian constructivism. Their stream processors have an intensional
character; in this paper, we give a corresponding coalgebraic characterisation
of extensional stream processors, i.e., the set of continuous functions
$A^\mathbb{N} \to B^\mathbb{N}$. Our account sites both our result and that of
op. cit. within the apparatus of comodels for algebraic effects originating
with Power-Shkaravska. Within this apparatus, the distinction between
intensional and extensional equivalence for stream processors arises in the
same way as the the distinction between bisimulation and trace equivalence for
labelled transition systems and probabilistic generative systems.Comment: 24 pages; v4: final accepted versio

arXiv.org e-Print Archive

Dagstuhl Research Online Publication Server

Stream Processors and Comodels

https://drops.dagstuhl.de/opus/volltexte/2021/15370/pdf/LIPIcs-CALCO-2021-15.pdf

Stream Processors and Comodels

Abstract

Similar works

Full text

Available Versions

Episciences.org

arXiv.org e-Print Archive

Dagstuhl Research Online Publication Server