A case against currying
emi-h.com
March 22, 2026
11 min read
Summary
Curried functions define n-parameter functions by applying one argument at a time, returning a new function for the subsequent parameters. This technique is common in purely functional programming languages, allowing for a more modular and flexible approach to function application.
Key Takeaways
- Curried functions define multi-parameter functions by applying one argument at a time, returning a new function for each subsequent argument.
- There are three main styles for defining multi-parameter functions: parameter list, curried, and tuple styles, each with different syntactic approaches.
- Partial application, which allows fixing one parameter of a multi-argument function, is often cited as a primary advantage of curried functions, but it is not exclusive to them.
- The types of functions in parameter list and curried styles are theoretically equivalent, meaning they can be transformed into one another without loss of functionality.
Community Sentiment
MixedPositives
- Currying allows for implicit partial application, which can lead to clearer code in certain contexts, enhancing readability and maintainability.
- In Haskell, currying can optimize function evaluations by allowing parts of a function to be reused across multiple applications, which can improve performance.
Concerns
- Currying can obscure the intent of function applications, making it less clear what the resulting function represents, which may hinder understanding.
- Some believe that currying and other functional programming concepts, like lazy evaluation, are experiments that newer languages should avoid due to potential confusion.
Source
emi-h.com
Published
March 22, 2026
Reading Time
11 minutes
Relevance Score
51/100
🔥🔥🔥🔥🔥
Why It Matters
This page is optimized for focused reading: quick context up top, a clean summary block, and a direct path to the original source when you want the full story.