Automatic autoprojection of higher order recursive equations

DOI10.1016/0167-6423(91)90035-VzbMath0745.68039MaRDI QIDQ1183551

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

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

Related Items (5)

Representing Control: a Study of the CPS Transformation ⋮ Comparing flow-based binding-time analyses ⋮ On-line and off-line partial evaluation: semantic specifications and correctness proofs ⋮ Generating action compilers by partial evaluation ⋮ Representing Control: a Study of the CPS Transformation

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