Efficient and compositional higher-order streams

Authors:
Gergely Patai
Affiliations:
Budapest University of Technology and Economics, Budapest, Hungary
Venue:
WFLP'10 Proceedings of the 19th international conference on Functional and constraint logic programming
Year:
2010

Citing 8
Cited 1

Functional reactive animation

ICFP '97 Proceedings of the second ACM SIGPLAN international conference on Functional programming
The Yampa arcade

Haskell '03 Proceedings of the 2003 ACM SIGPLAN workshop on Haskell
Value recursion in monadic computations

Value recursion in monadic computations
Towards a higher-order synchronous data-flow language

Proceedings of the 4th ACM international conference on Embedded software
Applicative programming with effects

Journal of Functional Programming
Causal commutative arrows and their optimization

Proceedings of the 14th ACM SIGPLAN international conference on Functional programming
Push-pull functional reactive programming

Proceedings of the 2nd ACM SIGPLAN symposium on Haskell
Embedding dynamic dataflow in a call-by-value language

ESOP'06 Proceedings of the 15th European conference on Programming Languages and Systems

Keeping calm in the face of change

Higher-Order and Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Stream-based programming has been around for a long time, but it is typically restricted to static data-flow networks. By introducing first-class streams that implement the monad interface, we can describe arbitrary dynamic networks in an elegant and consistent way using only two extra primitives besides the monadic operations. This paper presents an efficient stream implementation and demonstrates the compositionality of the constructs by mapping them to functions over natural numbers.