Time and Space Profiling for Non-Strict, Higher-Order Functional Languages (1995)
| Venue: | In 22'nd ACM Symposium on Principles of Programming Languages |
| Citations: | 39 - 7 self |
BibTeX
@INPROCEEDINGS{Sansom95timeand,
author = {Patrick M. Sansom and Simon L. Peyton Jones},
title = {Time and Space Profiling for Non-Strict, Higher-Order Functional Languages},
booktitle = {In 22'nd ACM Symposium on Principles of Programming Languages},
year = {1995},
pages = {355--366},
publisher = {ACM Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We present the first profiler for a compiled, non-strict, higher-order, purely functional language capable of measuring time as well as space usage. Our profiler is implemented in a production-quality optimising compiler for Haskell, has low overheads, and can successfully profile large applications. A unique feature of our approach is that we give a formal specification of the attribution of execution costs to cost centres. This specification enables us to discuss our design decisions in a precise framework. Since it is not obvious how to map this specification onto a particular implementation, we also present an implementation-oriented operational semantics, and prove it equivalent to the specification. 1 Motivation and overview Everyone knows the importance of profiling tools: the best way to improve a program's performance is to concentrate on the parts of the program which are eating the lion's share of the total space and time resources. One would expect profiling tools to be ...
