A Model for Comparing the Space Usage of Lazy Evaluators (2000)
| Venue: | In Proceedings of the 2nd International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming |
| Citations: | 6 - 1 self |
BibTeX
@INPROCEEDINGS{Bakewell00amodel,
author = {Adam Bakewell and Colin Runciman},
title = {A Model for Comparing the Space Usage of Lazy Evaluators},
booktitle = {In Proceedings of the 2nd International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming},
year = {2000},
pages = {151--162},
publisher = {ACM Press}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Identifying the source of space faults in functional programs is hard. The problem is compounded as space usage can vary enormously from one implementation to another. We use a term-graph rewriting model to describe evaluators with explicit space usage. Given descriptions for two evaluators E1 and E2, if E1 never has asymptotically worse space usage than E2, we can use a bisimulation-like proof method to prove it. Conversely, if E1 is leakier than E2, we characterise a class of computations that expose the difference between them.
Citations
| 595 | Compiling with Continuations - Appel - 1992 |
| 102 | Functional programming and input/output - Gordon - 1994 |
| 53 | Proper tail recursion and space efficiency - Clinger - 1998 |
| 31 | Safety considerations for storage allocation optimizations - Chase |
| 24 | A Tutorial on Co-induction and Functional Programming - Gordon - 1995 |
| 19 | and Arvind. Properties of a first-order functional language with sharing - Ariola - 1995 |
| 18 | A foundation for space-safe transformations of call-by-need programs - Gustavsson, Sands - 1999 |
| 2 | Research Topics in Functional Programming, chapter The lazy lambda calculus - Abramsky - 1989 |
| 1 | The space usage problem: An evaluation kit for graph-reduction semantics - Bakewell, Runciman - 2000 |
