Higher-order unCurrying

DOI10.1023/A:1010006229549MaRDI QIDQ5926073zbMATH OpenFDO

Authors John Hannan, Patrick Hicks

Publication date 12 March 2001

Published in Higher-Order and Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/A:1010006229549

zbMATH Keywords

functional languagessemantics-based program analysisunCurrying

Mathematics Subject Classification ID

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

Recommendations

• A verified framework for higher-order uncurrying optimizations
• Generalized and formalized uncurrying
• Comparing curried and uncurried rewriting
• Uncurrying for Termination
• Specification and correctness of lambda lifting This material is based upon work supported by the National Science Foundation under Grant No. 9900918.

Cited in

(5)

• CPS transformation of beta-redexes
• Generalized and formalized uncurrying
• Making a fast Curry: push/enter vs. eval/apply for higher-order languages
• Making a fast curry: push/enter vs. eval/apply for higher-order languages
• A verified framework for higher-order uncurrying optimizations

This page was built for publication: Higher-order unCurrying

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