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

DOI10.1145/1016850.1016856zbMATH Open1323.68080OpenAlexW4248456324MaRDI QIDQ5178017FDOQ5178017

Authors: Simon Marlow, Simon Peyton-Jones 

Publication date: 9 March 2015

Published in: Proceedings of the ninth ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1016850.1016856

Recommendations

• Making a fast curry: push/enter vs. eval/apply for higher-order languages
• More haste, less speed: lazy versus eager evaluation
• scientific article; zbMATH DE number 988749
• Transformations and reduction strategies for typed lambda expressions
• 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 (4)

• Making a fast curry: push/enter vs. eval/apply for higher-order languages
• A syntactic correspondence between context-sensitive calculi and abstract machines
• On the equivalence between small-step and big-step abstract machines: a simple application of lightweight fusion
• Inter-deriving Semantic Artifacts for Object-Oriented Programming

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 Q5178017)