Monoidal streams for dataflow programming
type: Item
instance of: scholarly article
title: Monoidal streams for dataflow programming
DOI: 10.1145/3531130.3533365
author: Elena di Lavore
author: G. de Felice
author: Mario Román
publication date: 2024-12-06T00:00:00Z
Mathematics Subject Classification ID: 68Nxx
Mathematics Subject Classification ID: 68Qxx
Mathematics Subject Classification ID: 18M05
zbMATH DE Number: 7954866
zbMATH Keywords: monoidal stream
zbMATH Keywords: stream
zbMATH Keywords: monoidal category
zbMATH Keywords: dataflow programming
zbMATH Keywords: feedback
zbMATH Keywords: signal flow graph
zbMATH Keywords: coalgebra
zbMATH Keywords: stochastic process
MaRDI profile type: MaRDI publication profile
cites work: Timely Dataflow: A Model
cites work: Categorical quantum mechanics
cites work: A final coalgebra theorem
cites work: Q4680360
cites work: Q4044767
cites work: A compositional framework for Markov processes
cites work: First steps in synthetic guarded domain theory: step-indexing in the topos of trees
cites work: Q4730757
cites work: Q5287508
cites work: Linear logic, coherence and dinaturality
cites work: Natural deduction and coherence for weakly distributive categories
cites work: Graphical Conjunctive Queries.
cites work: A Categorical Semantics of Signal Flow Graphs
cites work: Full abstraction for signal flow graphs
cites work: The algebra of stream processing functions
cites work: Foundations of Software Science and Computation Structures
cites work: Synchronous Kahn networks
cites work: Disintegration and Bayesian inversion via string diagrams
cites work: Restriction categories. I: Categories of partial maps
cites work: Weakly distributive categories
cites work: A mathematical theory of resources
cites work: DisCoPy: Monoidal Categories in Python
cites work: Q5020948
cites work: Q4086303
cites work: Coalgebras and cartesian categories
cites work: A synthetic approach to Markov kernels, conditional independence and theorems on sufficient statistics
cites work: Stream processors and comodels
cites work: Intensional and extensional semantics of dataflow programs
cites work: Linear logic
cites work: An experience in proving regular networks of processes by modular model checking
cites work: Q4936346
cites work: Structural induction and coinduction in a fibrational setting
cites work: Q4251929
cites work: Memoryful geometry of interaction
cites work: Introduction to coalgebra. Towards mathematics of states and observation
cites work: Q4222929
cites work: Traced monoidal categories
cites work: Q4138147
cites work: Concrete domains
cites work: Bicategories of processes
cites work: Q4511151
cites work: Feedback, trace and fixed-point semantics
cites work: Practical coinduction
cites work: Q2769437
cites work: A fixpoint theorem for complete categories
cites work: Q3760508
cites work: Q3400625
cites work: (Co)end Calculus
cites work: A proof of the Kahn principle for input/output automata
cites work: Q5639839
cites work: Semantic Foundations for Deterministic Dataflow and Stream Processing
cites work: A calculus of communicating systems
cites work: Calculi for synchrony and asynchrony
cites work: Q3795195
cites work: Q3907077
cites work: Premonoidal categories as categories with algebraic structure
cites work: Categories of partial maps
cites work: Q4367948
cites work: Origins of bisimulation and coinduction

Monoidal streams for dataflow programming (cites work)
cites work: A practical type theory for symmetric monoidal categories

Monoidal streams for dataflow programming (cites work)
cites work: Q4023580

Monoidal streams for dataflow programming (cites work)
cites work: On the foundations of final coalgebra semantics: non-well-founded sets, partial orders, metric spaces

Monoidal streams for dataflow programming (cites work)
cites work: Programming Languages and Systems

Monoidal streams for dataflow programming (cites work)
cites work: Comonadic notions of computation

Monoidal streams for dataflow programming (cites work)
cites work: Q3678639