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

DOI10.1017/S0956796806005995zbMath1122.68023OpenAlexW2131802241MaRDI QIDQ5482279

Simon Marlow, Simon L. 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

Mathematics Subject Classification ID

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

Related Items (6)

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

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