Skip to main content Accessibility help
×
×
Home

Automatic useless-code elimination for HOT functional programs

  • FERRUCCIO DAMIANI (a1) and PAOLA GIANNINI (a2)
    • Published online: 01 March 2001
Abstract

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.

Copyright
Footnotes
Hide All
Partially supported by the Esprit TYPES W.G. and Cofin '99 TOSCA Project.
Footnotes
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Journal of Functional Programming
  • ISSN: 0956-7968
  • EISSN: 1469-7653
  • URL: /core/journals/journal-of-functional-programming
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed

Automatic useless-code elimination for HOT functional programs

  • FERRUCCIO DAMIANI (a1) and PAOLA GIANNINI (a2)
    • Published online: 01 March 2001
Submit a response

Discussions

No Discussions have been published for this article.

×

Reply to: Submit a response


Your details


Conflicting interests

Do you have any conflicting interests? *