Automatic autoprojection of higher order recursive equations

DOI10.1016/0167-6423(91)90035-VMaRDI QIDQ1183551zbMATH OpenFDO

Authors Anders Bondorf

Publication date 28 June 1992

Published in Science of Computer Programming (Search for Journal in Brave)

zbMATH Keywords

interpretersbinding time analysisautoprojectorclosure analysisself-applicable partial evaluationsimilix

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Theory of compilers and interpreters (68N20)

Recommendations

• scientific article; zbMATH DE number 1438809
• Automatic autoprojection of recursive equations with global variables and abstract data types
• The second Futamura projection for type-directed partial evaluation
• Projection Factorisations in Partial Evaluation

Cited in

(7)

• Representing Control: a Study of the CPS Transformation
• Generating action compilers by partial evaluation
• Automatic autoprojection of recursive equations with global variables and abstract data types
• scientific article; zbMATH DE number 177776 (Why is no real title available?)
• Representing Control: a Study of the CPS Transformation
• On-line and off-line partial evaluation: semantic specifications and correctness proofs
• Comparing flow-based binding-time analyses

This page was built for publication: Automatic autoprojection of higher order recursive equations

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