Partitioning Non-strict Functional Languages for Multi-threaded Code Generation (1995)
| Venue: | In Proceedings of Static Analysis Symposium '95 |
| Citations: | 3 - 0 self |
BibTeX
@INPROCEEDINGS{Coorg95partitioningnon-strict,
author = {Satyan R. Coorg and Satyan R. Coorg},
title = {Partitioning Non-strict Functional Languages for Multi-threaded Code Generation},
booktitle = {In Proceedings of Static Analysis Symposium '95},
year = {1995},
publisher = {MIT Masters Thesis. Unpublished}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper, we present a new approach to partitioning, the problem of generating sequential threads for programs written in a non-strict functional language. The goal of partitioning is to generate threads as large as possible, while retaining the non-strict semantics of the program. We define partitioning as a program transformation and design algorithms for basic block partitioning and inter-procedural partitioning. The inter-procedural algorithm presented here is more powerful than the ones previously known and is based on abstract interpretation, enabling the algorithm to handle recursion in a straightforward manner. We prove the correctness of these algorithms in a denotational semantic framework. Keywords: Partitioning, abstract interpretation, demand and tolerance sets, inter-procedural analysis, non-strict functional languages. 1 Introduction Functional programming languages can be divided into two classes: strict and non-strict. In a non-strict language, functions may r...
