Abstract
We formally characterize partial evaluation of functional programs<br /> as a normalization problem in an equational theory, and derive<br />a type-based normalization-by-evaluation algorithm for computing<br />normal forms in this setting. We then establish the correctness<br /> of this algorithm using a semantic argument based on Kripke<br />logical relations. For simplicity, the results are stated for a non-<br />strict, purely functional language; but the methods are directly<br />applicable to stating and proving correctness of type-directed partial<br />evaluation in ML-like languages as well.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
