Functional Programming — Explained with Examples

Functional programming (FP) is a declarative programming paradigm where programs are constructed by applying and composing pure functions. A pure function’s output depends only on its inputs and causes no side effects (no mutation, no I/O, no state changes). FP emphasizes immutability, first-class functions, and referential transparency.

Core FP concepts include: higher-order functions (functions that take or return other functions), map/filter/reduce (transform data without loops), function composition, recursion (instead of iteration), and lazy evaluation. Languages like Haskell, Elixir, and Clojure are purely functional. Many multi-paradigm languages (JavaScript, Python, Scala, Kotlin) support FP features. FP is excellent for concurrent/parallel systems because immutable data eliminates race conditions.

Real-world analogy. Functional programming is like a factory assembly line with no warehouse. Each station takes a part, transforms it, and passes it to the next station. No station ever modifies a part that another station is working on. The input flows through a pipeline of pure transformations to produce the output.

Example (JavaScript — imperative vs functional):

// Imperative
let sum = 0;
for (let i = 0; i < numbers.length; i++) {
  if (numbers[i] % 2 === 0) sum += numbers[i];
}

// Functional
const sum = numbers
  .filter(n => n % 2 === 0)
  .reduce((acc, n) => acc + n, 0);

Related terms: OOP, Reactive Programming, Declarative vs Imperative, Procedural Programming, Event-Driven Programming

Related tutorial: Functional Programming Intro