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: extended proofs
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.
2008 (English)Report (Other academic)
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
Luleå: Luleå tekniska universitet, 2008. , p. 19
Series
Research report / Luleå University of Technology, ISSN 1402-1528 ; 2008:17
National Category
Computer Sciences
Research subject
Dependable Communication and Computation Systems
Identifiers
URN: urn:nbn:se:ltu:diva-24943Local ID: d25dc2a0-a92f-11dd-97e4-000ea68e967bOAI: oai:DiVA.org:ltu-24943DiVA, id: diva2:997995
Projects
ESIS
Note
Godkänd; 2008; 20081102 (pj)Available from: 2016-09-29 Created: 2016-09-29 Last updated: 2018-01-10Bibliographically approved

Open Access in DiVA

fulltext(320 kB)6 downloads
File information
File name FULLTEXT01.pdfFile size 320 kBChecksum SHA-512
178c646dd49fc5a2c24bcf13eef4e18e2c5fc8b58aba81747c4bf6079d88b3fa6580cca72175f2a0212e94dd3c59c7a25b11fd759e75c69d16c11a508a5e76d8
Type fulltextMimetype application/pdf

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: 6 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

urn-nbn

Altmetric score

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