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
Strengthening supercompilation for call-by-value languages
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.
2010 (English)In: Proceedings of the Second International Valentin Turchin Memorial Workshop on Metacomputation in Russia: Pereslavl-Zalessky, Russia, July 1–5, 2010 / [ed] A.P. Nemytykh, Pereslavl Zalessky: Ailamazyan University of Pereslavl , 2010, 64-81 p.Conference paper, Published paper (Refereed)
Abstract [en]

A termination preserving supercompiler for a call-by-value language sometimes fails to remove intermediate structures that a supercompiler for a call-by-name language would remove. This discrepancy in power stems from the fact that many function bodies are either non-linear in use of an important variable or often start with a pattern match on their first argument and are therefore not strict in all their arguments. As a consequence, intermediate structures are left in the output program, making it slower. We present a revised supercompilation algorithm for a call-by-value language that propagates let-bindings into case-branches and uses termination analysis to remove dead code. This allows the algorithm to remove all intermediate structures for common examples where previous algorithms for call-by-value languages had to leave the intermediate structures in place.

Place, publisher, year, edition, pages
Pereslavl Zalessky: Ailamazyan University of Pereslavl , 2010. 64-81 p.
National Category
Computer Sciences
Research subject
Dependable Communication and Computation Systems
Identifiers
URN: urn:nbn:se:ltu:diva-31966Local ID: 64bebbbd-d31c-45fe-8267-b8446c9bc20dISBN: 978-5-901795-21-7 (print)OAI: oai:DiVA.org:ltu-31966DiVA: diva2:1005200
Conference
International Valentin Turchin Memorial Workshop on Metacomputation in Russia : 01/07/2010 - 05/07/2010
Projects
ESIS
Note
Godkänd; 2010; 20110214 (pj)Available from: 2016-09-30 Created: 2016-09-30 Last updated: 2017-11-25Bibliographically approved

Open Access in DiVA

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

Search in DiVA

By author/editor
Jonsson, PeterNordlander, 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

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 23 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