Lazy-parallel function calls for automatic parallelization

Abstract

When using traditional imperative languages for parallel programming, language guarantees like order of change of program state cease to exist making it harder to reason about correctness of the program. As a result, compilers mostly cannot help with the parallel constructs. We propose a mechanism, Lazy-Parallel Function Calls, which allows programs written with lazy evaluation semantics to be automatically parallelized and retain same behavior under both sequential and parallel execution. The analysis and the transformation the compiler needs to do is presented here. © 2011 Springer-Verlag.