A sized time system for a Parallel Functional Language (Revised)

A.J. Rebón~Portillo, Kevin Hammond, H.-W. Loidl, P. Vasconcelos

Research output: Contribution to conferencePaper


This paper describes an inference system, whose purpose is to determine the cost of evaluating expressions in a strict purely functional language. Upper bounds can be derived for both computation cost and the size of data structures. We outline a static analysis based on this inference system for inferring size and cost information. The analysis is a synthesis of the sized types of Hughes et al., and the polymorphic time system of Dornic et al., which was extended to static dependent costs by Reistad and Gifford. Our main interest in cost information is for scheduling tasks in the parallel execution of functional languages. Using the GranSim parallel simulator, we show that the information provided by our analysis is sufficient to characterise relative task granularities for a simple functional program. This information can be used in the runtime-system of the Glasgow Parallel Haskell compiler to improve dynamic program performance.
Original languageEnglish
Publication statusPublished - 2003


Dive into the research topics of 'A sized time system for a Parallel Functional Language (Revised)'. Together they form a unique fingerprint.

Cite this