Making a fast curry: push/enter vs. eval/apply for higher-order languages

DOI10.1017/S0956796806005995zbMATH Open1122.68023OpenAlexW2131802241MaRDI QIDQ5482279FDOQ5482279

Simon Marlow, Simon Peyton-Jones

Publication date: 28 August 2006

Published in: Journal of Functional Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0956796806005995

Recommendations

• Making a fast Curry: push/enter vs. eval/apply for higher-order languages
• More haste, less speed: lazy versus eager evaluation
• Transformations and reduction strategies for typed lambda expressions
• scientific article; zbMATH DE number 3947616
• Higher-order unCurrying

Mathematics Subject Classification ID

Theory of programming languages (68N15) Theory of compilers and interpreters (68N20) Functional programming and lambda calculus (68N18)

Cited In (6)

• From natural semantics to C: A formal derivation of two STG machines
• Coinductive big-step operational semantics
• Inter-deriving semantic artifacts for object-oriented programming
• A verified framework for higher-order uncurrying optimizations
• From reduction-based to reduction-free normalization
• Modular, higher order cardinality analysis in theory and practice

This page was built for publication: Making a fast curry: push/enter vs. eval/apply for higher-order languages

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