Plugging a Space Leak with an Arrow

Authors:
Hai Liu;Paul Hudak
Affiliations:
Department of Computer Science, Yale University, New Haven, CT 06511, U.S.A.;Department of Computer Science, Yale University, New Haven, CT 06511, U.S.A.
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2007

Citing 20
Cited 8

Fixing some space leaks with a garbage collector

Software—Practice & Experience
An algorithm for optimal lambda calculus reduction

POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Compiling with continuations

Compiling with continuations
A natural semantics for lazy evaluation

POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A call-by-need lambda calculus

POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Functional reactive animation

ICFP '97 Proceedings of the second ACM SIGPLAN international conference on Functional programming
Proper tail recursion and space efficiency

PLDI '98 Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation
The optimal implementation of functional programming languages

The optimal implementation of functional programming languages
The Haskell school of expression: learning functional programming through multimedia

The Haskell school of expression: learning functional programming through multimedia
Generalising monads to arrows

Science of Computer Programming - Special issue on mathematics of program construction
A model for comparing the space usage of lazy evaluators

Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
Real-time FRP

Proceedings of the sixth ACM SIGPLAN international conference on Functional programming
A new notation for arrows

Proceedings of the sixth ACM SIGPLAN international conference on Functional programming
Possibilities and limitations of call-by-need space improvement

Proceedings of the sixth ACM SIGPLAN international conference on Functional programming
Functional reactive programming, continued

Proceedings of the 2002 ACM SIGPLAN workshop on Haskell
Deforestation: Transforming Programs to Eliminate Trees

ESOP '88 Proceedings of the 2nd European Symposium on Programming
Functional Implementations of Continuous Modeled Animation

PLILP '98/ALP '98 Proceedings of the 10th International Symposium on Principles of Declarative Programming
The Yampa arcade

Haskell '03 Proceedings of the 2003 ACM SIGPLAN workshop on Haskell
The call-by-need lambda calculus

Journal of Functional Programming
HPorter: using arrows to compose parallel processes

PADL'07 Proceedings of the 9th international conference on Practical Aspects of Declarative Languages

Opis: reliable distributed systems in OCaml

Proceedings of the 4th international workshop on Types in language design and implementation
Causal commutative arrows and their optimization

Proceedings of the 14th ACM SIGPLAN international conference on Functional programming
An ode to arrows

PADL'10 Proceedings of the 12th international conference on Practical Aspects of Declarative Languages
Causal commutative arrows

Journal of Functional Programming - Dedicated to ICFP 2009
Wormholes: introducing effects to FRP

Proceedings of the 2012 Haskell Symposium
Asynchronous functional reactive programming for GUIs

Proceedings of the 34th ACM SIGPLAN conference on Programming language design and implementation
Leaking space

Communications of the ACM
Leaking Space

Queue - Quality Assurance

Quantified Score

Hi-index	0.02

Visualization

Abstract

The implementation of conceptually continuous signals in functional reactive programming (FRP) is studied in detail. We show that recursive signals in standard implementations using streams and continuations lead to potentially serious time and space leaks under conventional call-by-need evaluation. However, by moving to the level of signal functions, and structuring the design around arrows, this class of time and space leaks can be avoided. We further show that the use of optimal reduction can also avoid the problem, at the expense of a much more complex evaluator.