Causality of optimized Haskell: what is burning our cycles?

Authors:
Peter M. Wortmann;David Duke
Affiliations:
University of Leeds, Leeds, United Kingdom;University of Leeds, Leeds, United Kingdom
Venue:
Proceedings of the 2013 ACM SIGPLAN symposium on Haskell
Year:
2013

Citing 21
Cited 0

A new approach to debugging optimized code

PLDI '92 Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation
The essence of functional programming

POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A natural semantics for lazy evaluation

POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A short cut to deforestation

FPCA '93 Proceedings of the conference on Functional programming languages and computer architecture
Let-floating: moving bindings to give faster programs

Proceedings of the first ACM SIGPLAN international conference on Functional programming
Lag, drag, void and use—heap profiling and space-efficient compilation revisited

Proceedings of the first ACM SIGPLAN international conference on Functional programming
Formally based profiling for higher-order functional languages

ACM Transactions on Programming Languages and Systems (TOPLAS)
A transformation-based optimiser for Haskell

Science of Computer Programming - Special issue on the 6th European symposium on programming
Profiling Optimized Code: A Profiling System for an HPF Compiler

IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
The nofib Benchmark Suite of Haskell Programs

Proceedings of the 1992 Glasgow Workshop on Functional Programming
C-: A Portable Assembly Language

IFL '97 Selected Papers from the 9th International Workshop on Implementation of Functional Languages
Gprof: A call graph execution profiler

SIGPLAN '82 Proceedings of the 1982 SIGPLAN symposium on Compiler construction
Secrets of the Glasgow Haskell Compiler inliner

Journal of Functional Programming
Deriving a lazy abstract machine

Journal of Functional Programming
LLVM: A Compilation Framework for Lifelong Program Analysis & Transformation

Proceedings of the international symposium on Code generation and optimization: feedback-directed and runtime optimization
Stream fusion: from lists to streams to nothing at all

ICFP '07 Proceedings of the 12th ACM SIGPLAN international conference on Functional programming
Haskell program coverage

Haskell '07 Proceedings of the ACM SIGPLAN workshop on Haskell workshop
The worker/wrapper transformation

Journal of Functional Programming
Parallel performance tuning for Haskell

Proceedings of the 2nd ACM SIGPLAN symposium on Haskell
An llVM backend for GHC

Proceedings of the third ACM Haskell symposium on Haskell
Functional programs that explain their work

Proceedings of the 17th ACM SIGPLAN international conference on Functional programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Profiling real-world Haskell programs is hard, as compiler optimizations make it tricky to establish causality between the source code and program behavior. In this paper we attack the root issue by performing a causality analysis of functional programs under optimization. We apply our findings to build a novel profiling infrastructure on top of the Glasgow Haskell Compiler, allowing for performance analysis even of aggressively optimized programs.