Sökning: id:"swepub:oai:DiVA.org:ltu-32194" >
Positive supercompi...
Positive supercompilation for a higher order call-by-value language
-
- Jonsson, Peter A. (författare)
- Luleå tekniska universitet,EISLAB
-
- Nordlander, Johan (författare)
- Luleå tekniska universitet,Datavetenskap
-
(creator_code:org_t)
- 2009-01-21
- 2009
- Engelska.
-
Ingår i: Proceedings of the 36th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. - New York : ACM Digital Library. - 9781605583792 ; , s. 277-288
- Relaterad länk:
-
https://ltu.diva-por... (primary) (Raw object)
-
visa fler...
-
http://ltu.diva-port...
-
https://urn.kb.se/re...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- 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.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
Nyckelord
- Dependable Communication and Computation Systems
- Kommunikations- och beräkningssystem
Publikations- och innehållstyp
- ref (ämneskategori)
- kon (ämneskategori)
Hitta via bibliotek
Till lärosätets databas