Static Parallelization of Functional Programs: Elimination of Higher-Order Functions & Optimized Inlining

Authors:
Christoph A. Herrmann;Jan Laitenberger;Christian Lengauer;Christian Schaller
Affiliations:
-;-;-;-
Venue:
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Year:
1999

Citing 6
Cited 0

Lambda lifting: transforming programs to recursive equations

Proc. of a conference on Functional programming languages and computer architecture
Type-driven defunctionalization

ICFP '97 Proceedings of the second ACM SIGPLAN international conference on Functional programming
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Introduction to Functional Programming

Introduction to Functional Programming
Compiling Haskell by Program Transformation: A Report from the Trenches

ESOP '96 Proceedings of the 6th European Symposium on Programming Languages and Systems
From ML to Ada: Strongly-typed language interoperability via source translation

Journal of Functional Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Functional programs have long been recognized as attractive subjects of an implicit static parallelization because functional programming excludes artificial dependences, which would restrict parallelism. One central concept which makes functional programming a powerful paradigm is the higher-order function, which can have functions appearing in its arguments or result. We present an automatic method of eliminating higher-order functions, which is based on earlier work by Bell, Bellegarde and Hook [2]. The number of auxiliary functions added in the process is subsequently minimized by inlining transformations.