functional-programming

Immutable, pure functions form the foundation of functional programming in Lea. Prefer immutable bindings and functions without side effects—they take input and return output predictably. This ensures code is easier to test, reason about, and compose into larger pipelines.

Compose small, single-purpose functions into pipelines where data flows through sequential transformations. In Lea, pipelines prepend operators, allowing you to chain functions for stateless computation. This approach keeps logic modular and maintains data immutability throughout.

Higher-order functions accept other functions as arguments or return functions as results. In Lea, use them to abstract patterns, reduce code duplication, and build reusable transformation logic. They work seamlessly with composition and pure functions for flexible data handling.

Lea enforces no currying, pipelines prepend, optional mutation via maybe, no monads, and opt-in typing with :: Type :> ReturnType syntax. These constraints ensure predictable data flow, explicit type safety, and functional purity across your codebase.

Use functional programming for data transformations, stateless computation, and complex logic pipelines where immutability and pure functions reduce bugs. It's ideal when you need predictable, testable code that avoids hidden state and side effects.