On perfect supercompilation

DOI10.1007/3-540-46562-6_10MaRDI QIDQ2729913zbMATH OpenFDO

Authors Jens Peter Secher, M. H. B. Sørensen

Publication date 23 October 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-46562-6_10

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Computing methodologies and applications (68U99)

Recommendations

• A positive supercompiler
• The concept of a supercompiler
• Positive supercompilation for a higher order call-by-value language
• scientific article; zbMATH DE number 3943000
• Positive supercompilation for a higher-order call-by-value language

Cited in

(10)

• On the dynamics of Pérez Laraudogoitia's supertask
• Supercompilation for Martin-Lof's type theory
• Supercompilation for datatypes
• scientific article; zbMATH DE number 3943000 (Why is no real title available?)
• The concept of a supercompiler
• A positive supercompiler
• Reverse universal resolving algorithm and inverse driving
• Positive supercompilation for a higher order call-by-value language
• Program specialization as a tool for solving word equations
• Superefficiency from the vantage point of computability

This page was built for publication: On perfect supercompilation

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