Integer constraints to stop deforestation

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

Deforestation is a transformation of functional programs to remove intermediate data structures. It is based on outermost unfolding of function calls where folding is introduced to avoid repeated unfolding of the same expression. Since unrestricted unfolding may encounter arbitrarily many terms, a termination analysis has to determine those subterms where unfolding is possibly dangerous. We show that such an analysis can be obtained from a control flow analysis by an extension with integer constraints — essentially at no loss in efficiency.

Original languageEnglish
Title of host publicationProgramming Languages and Systems - ESOP 1996 - 6th European Symposium on Programming, Proceedings
EditorsHanne Riis Nielson
PublisherSpringer Verlag
Pages326-340
Number of pages15
ISBN (Print)3540610553, 9783540610557
DOIs
StatePublished - 1996
Externally publishedYes
Event6th European Symposium on Programming Languages and Systems, ESOP 1996 - Linkoping, Sweden
Duration: 22 Apr 199624 Apr 1996

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1058
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference6th European Symposium on Programming Languages and Systems, ESOP 1996
Country/TerritorySweden
CityLinkoping
Period22/04/9624/04/96

Fingerprint

Dive into the research topics of 'Integer constraints to stop deforestation'. Together they form a unique fingerprint.

Cite this