The Essence of Dataflow Programming

  • Tarmo Uustalu
  • Varmo Vene
Conference paper

DOI: 10.1007/11894100_5

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4164)
Cite this paper as:
Uustalu T., Vene V. (2006) The Essence of Dataflow Programming. In: Horváth Z. (eds) Central European Functional Programming School. CEFP 2005. Lecture Notes in Computer Science, vol 4164. Springer, Berlin, Heidelberg

Abstract

We propose a novel, comonadic approach to dataflow (stream-based) computation. This is based on the observation that both general and causal stream functions can be characterized as coKleisli arrows of comonads and on the intuition that comonads in general must be a good means to structure context-dependent computation. In particular, we develop a generic comonadic interpreter of languages for context-dependent computation and instantiate it for stream-based computation. We also discuss distributive laws of a comonad over a monad as a means to structure combinations of effectful and context-dependent computation. We apply the latter to analyse clocked dataflow (partial stream based) computation.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Tarmo Uustalu
    • 1
  • Varmo Vene
    • 2
  1. 1.Inst. of Cybernetics at Tallinn Univ. of TechnologyTallinnEstonia
  2. 2.Dept. of Computer ScienceUniv. of TartuTartuEstonia

Personalised recommendations