Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
Behavioural differential equations: a coinductive calculus of streams, automata, and power series
Theoretical Computer Science
A coalgebraic approach to non-determinism: Applications to multilattices
Information Sciences: an International Journal
Sampling, splitting and merging in coinductive stream calculus
MPC'10 Proceedings of the 10th international conference on Mathematics of program construction
Stream processing coalgebraically
Science of Computer Programming
Hi-index | 0.00 |
Variants of causal functions on streams are defined, and the interplay between them is studied from different perspectives with attention to coalgebraic considerations. We prove that the sets of causal and bicausal functions, respectively, are closed under a certain natural coinductive construction. This closure property paves the way to constructing new final stream coalgebras over finite alphabets. This result is used to show that the 2-adic version of the Collatz function yields a final bit-stream coalgebra.