Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Positive supercompilation for a higher order call-by-value language
Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Embedded Internet Systems Lab.
Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
2009 (English)In: Proceedings of the 36th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages: POPL'09 ; Savannah, Georgia, USA, January 21 - 23, 2009 / [ed] Benjamin C. Pierce, New York: ACM Digital Library, 2009, p. 277-288Conference paper, Published paper (Refereed)
Abstract [en]

Previous deforestation and supercompilation algorithms may introduce accidental termination when applied to call-by-value programs. This hides looping bugs from the programmer, and changes the behavior of a program depending on whether it is optimized or not. We present a supercompilation algorithm for a higher-order call-by-value language and we prove that the algorithm both terminates and preserves termination properties. This algorithm utilizes strictness information for deciding whether to substitute or not and compares favorably with previous call-by-name transformations.

Place, publisher, year, edition, pages
New York: ACM Digital Library, 2009. p. 277-288
Series
SIGPLAN notices ; 1
National Category
Computer Sciences
Research subject
Dependable Communication and Computation Systems
Identifiers
URN: urn:nbn:se:ltu:diva-32194DOI: 10.1145/1480881.1480916Local ID: 69de8be0-011f-11de-a8bd-000ea68e967bISBN: 978-1-60558-379-2 (print)OAI: oai:DiVA.org:ltu-32194DiVA: diva2:1005428
Conference
Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages : 21/01/2009 - 23/01/2009
Projects
ESIS
Note
Godkänd; 2009; 20090222 (pj)Available from: 2016-09-30 Created: 2016-09-30 Last updated: 2018-01-14Bibliographically approved

Open Access in DiVA

fulltext(234 kB)8 downloads
File information
File name FULLTEXT01.pdfFile size 234 kBChecksum SHA-512
bf5f669838f86e537f64a7b2f4ebd767bbaba3ffb3eb99a50c2911491177b1dfbbf37a31967ebaa60d27b35c5189774d91aacbfb69e066c811093acb56fb6ccf
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Search in DiVA

By author/editor
Jonsson, Peter A.Nordlander, Johan
By organisation
Embedded Internet Systems LabComputer Science
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar
Total: 8 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 13 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf