Story
A case against currying
1 report
1 website
1 discussion
Latest report
Overview
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.
Summary from emi-h.com.
Reports
One report so far. Additional coverage will appear here when it is linked to this story.
emi-h.com
A case against currying
Read report →
Community reactions
Each reaction summarizes sampled comments from the linked discussion.
Hacker News · emi-h.com
Hacker News discussion ↗
Historical count: 5 · 5 saved in sample · Historical sample
Analysis ready
Read this discussion’s reaction
Based on 5 sampled comments from this thread. Analyzed 2026-03-22.
- Praise: Currying allows for implicit partial application, which can lead to clearer code in certain contexts, enhancing readability and maintainability.
- Praise: In Haskell, currying can optimize function evaluations by allowing parts of a function to be reused across multiple applications, which can improve performance.
- Concern: Currying can obscure the intent of function applications, making it less clear what the resulting function represents, which may hinder understanding.
- Concern: Some believe that currying and other functional programming concepts, like lazy evaluation, are experiments that newer languages should avoid due to potential confusion.