Hostname: page-component-745bb68f8f-lrblm Total loading time: 0 Render date: 2025-01-12T04:25:28.425Z Has data issue: false hasContentIssue false
  • English
  • Français

The dynamic compilation of lazy functional programs

Published online by Cambridge University Press:  01 January 1998

DAVID WAKELING
DAVID WAKELING
Affiliation:
Department of Computer Science, University of Exeter, Exeter, EX4 4PT, UK (web: http://www.dcs.exeter.ac.uk/∼david)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Lazy functional languages seem to be unsuitable for programming embedded computers because their implementations require so much memory for program code and graph. In this paper we describe a new abstract machine for the implementation of lazy functional languages on embedded computers called the X-machine. The X-machine has been designed so that program code can be stored compactly as byte code, yet run quickly using dynamic compilation. Our first results are promising – programs typically require only 33% of the code space of an ordinary implementation, but run at 75% of the speed. Future work needs to concentrate on reducing the size of statically-allocated data and the run-time system, and on developing a more detailed understanding of throw-away compilation.

Type
Research Article
Information
Journal of Functional Programming , Volume 8 , Issue 1 , January 1998 , pp. 61 - 81
Copyright
© 1998 Cambridge University Press
Submit a response

Discussions

No Discussions have been published for this article.