Hostname: page-component-586b7cd67f-2plfb Total loading time: 0 Render date: 2024-11-24T03:00:04.069Z Has data issue: false hasContentIssue false
  • English
  • Français

Automatic useless-code elimination for HOT functional programs

Published online by Cambridge University Press:  01 March 2001

FERRUCCIO DAMIANI  and
PAOLA GIANNINI
FERRUCCIO DAMIANI
Affiliation:
Dipartimento di Informatica, Università di Torino, Corso Svizzera 185, 10149 Torino, Italy (e-mail: [email protected])
PAOLA GIANNINI
Affiliation:
DISTA, Università del Piemonte Orientale, Corso Borsalino 54, 15100 Alessandria, Italy (e-mail: [email protected])
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.

In this paper we present two type inference systems for detecting useless-code in higher-order typed functional programs. Type inference can be performed in an efficient and complete way, by reducing it to the solution of a system of constraints. We also give a useless-code elimination algorithm which is based on a combined use of these type inference systems. The main application of the technique is the optimization of programs extracted from proofs in logical frameworks, but it could be used as well in the elimination of useless-code determined by program transformations.

Type
Research Article
Information
Journal of Functional Programming , Volume 10 , Issue 6 , November 2000 , pp. 509 - 559
Copyright
© 2000 Cambridge University Press

Footnotes

Partially supported by the Esprit TYPES W.G. and Cofin '99 TOSCA Project.
Submit a response

Discussions

No Discussions have been published for this article.