Positive supercompilation for a higher order call-by-value language

DOI10.1145/1480881.1480916MaRDI QIDQ5261524zbMATH OpenOpenAlexFDO

Authors Peter A. Jonsson, Johan Nordlander

Publication date 3 July 2015

Published in Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-32194

zbMATH Keywords

deforestationsupercompilationcall-by-value

Mathematics Subject Classification ID

Theory of programming languages (68N15) Theory of compilers and interpreters (68N20)

Recommendations

• Positive supercompilation for a higher-order call-by-value language
• A positive supercompiler
• scientific article; zbMATH DE number 1630107
• The concept of a supercompiler
• Supercompilation for Martin-Lof's type theory

Cited in

(3)

• Positive supercompilation for a higher-order call-by-value language
• Higher-level supercompilation as a metasystem transition
• scientific article; zbMATH DE number 1630107 (Why is no real title available?)

This page was built for publication: Positive supercompilation for a higher order call-by-value language

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5261524)