Stream processors and comodels

06/10/2021
by   Richard Garner, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/21/2022

Continuous Functions on Final Comodels of Free Algebraic Theories

In 2009, Ghani, Hancock and Pattinson gave a tree-like representation of...
research
03/05/2022

Worst-Case Analysis of LPT Scheduling on Small Number of Non-Identical Processors

The approximation ratio of the longest processing time (LPT) scheduling ...
research
12/22/2021

An algebraic attack on stream ciphers with application to nonlinear filter generators and WG-PRNG

In this paper, we propose a new algebraic attack on stream ciphers. Star...
research
05/14/2017

Application of the Computer Capacity to the Analysis of Processors Evolution

The notion of computer capacity was proposed in 2012, and this quantity ...
research
03/01/2019

Parallel Index-based Stream Join on a Multicore CPU

There is increasing interest in using multicore processors to accelerate...
research
12/05/2022

Low Power Mesh Algorithms for Image Problems

We analyze a physically motivated fine-grained mesh-connected computer m...
research
09/25/2017

Stream VByte: Faster Byte-Oriented Integer Compression

Arrays of integers are often compressed in search engines. Though there ...

Please sign up or login with your details

Forgot password? Click here to reset