Functional Programming

Functional programming is the process of constructing programs by applying and composing pure functions, avoiding shared state, mutable data, and side effects. It is a declarative programming paradigm, meaning it’s focused on what to solve. It contrasts with the imperative programming style, such as object oriented programming, in which the focus is on how to solve. Functional programming uses expressions instead of statements, meaning that an expression is evaluated to produce a value.

Functional code is more concise, predictable, and easier to test than imperative code because functions are treated as values and passed to functions as parameters. Programming languages that support functional programming include JavaScript, Scala, Lisp, Erlang, and Haskell.

Concepts of Functional programming

Many concepts are specific to functional programming. Some include:

Pure functions

Pure functions have two main properties: They always produce the same output given the same input, and they have no side effects. Because of these properties, there are many benefits of pure functions. If the result of a pure expression is not used, it can be removed without affecting other expressions. If there is no data dependency between two pure expressions, their order can be reversed, or they can be performed in parallel so they do not interfere with each other.

Pure functions are easy to understand because they don’t change any states and depend only on the input given to them. 


Iteration, also known as looping, in functional languages is implemented through recursion. There are no “for” or “while” loops in functional languages. Recursive functions invoke themselves, meaning an operation can be repeated until it reaches the base case.

First-class and higher-order

First-class functions are treated as first-class variables, which can be passed to functions as parameters, returned from functions, or stored in data structures. Higher-order functions are functions that can either take other functions as arguments or return them as results. Higher-order functions are related to first-class functions because both allow functions as arguments and results of other functions.

Webopedia Staff
Webopedia Staff
Since 1995, more than 100 tech experts and researchers have kept Webopedia’s definitions, articles, and study guides up to date. For more information on current editorial staff, please visit our About page.

Related Articles

@ Sign

Pronounced at sign or simply as at, this symbol is used in e-mail addressing to separate the user' name from the user's domain name,...


(MUHN-jing) Munging (address munging), is the act of altering an email address posted on a Web page to make it unreadable to bots and...

How to Create an RSS Feed

In the second installment of RSS how-to, we look at some of the nonrequired (optional) channel and item tags, discuss RSS specifications in-depth and...

Dictionary Attack

(n.) (1) A method used to break security systems, specifically password-based security systems, in which the attacker systematically tests all possible passwords beginning with...


ScalaHosting is a leading managed hosting provider that offers secure, scalable, and affordable...


Human resources information system (HRIS) solutions help businesses manage multiple facets of their...

Best Managed Service Providers...

In today's business world, managed services are more critical than ever. They can...