Difference between revisions of "Functional programming"
Karl Jones (Talk | contribs) (etc) |
Karl Jones (Talk | contribs) (imperative programming) |
||
| Line 13: | Line 13: | ||
== Imperative programming == | == Imperative programming == | ||
| − | In contrast, imperative programming changes state with commands in the source language, the most simple example being assignment. Imperative programming does have functions, not in the mathematical sense, but in the sense of subroutines. They can have side effects that may change the value of program state. Functions without return values therefore make sense. Because of this, they lack referential transparency, i.e. the same language expression can result in different values at different times depending on the state of the executing program. | + | In contrast, [[imperative programming]] changes state with commands in the source language, the most simple example being assignment. |
| + | |||
| + | Imperative programming does have functions, not in the mathematical sense, but in the sense of subroutines. They can have side effects that may change the value of program state. Functions without return values therefore make sense. Because of this, they lack referential transparency, i.e. the same language expression can result in different values at different times depending on the state of the executing program. | ||
== External links == | == External links == | ||
* [https://en.wikipedia.org/wiki/Functional_programming Functional programming] @ Wikipedia | * [https://en.wikipedia.org/wiki/Functional_programming Functional programming] @ Wikipedia | ||
Revision as of 07:38, 5 June 2015
In computer science, functional programming is a programming paradigm that treats computation as the evaluation of mathematical functions and avoids changing-state and mutable data.
It is a declarative programming paradigm: programming is done with expressions.
In functional code, the output value of a function depends only on the arguments that are input to the function, so calling a function f twice with the same value for an argument x will produce the same result f(x) each time.
Eliminating side effects, i.e. changes in state that do not depend on the function inputs, can make it much easier to understand and predict the behavior of a program, which is one of the key motivations for the development of functional programming.
Functional programming has its roots in lambda calculus, a formal system developed in the 1930s to investigate computability, the Entscheidungsproblem, function definition, function application, and recursion.
Many functional programming languages can be viewed as elaborations on the lambda calculus. Another well-known declarative programming paradigm, logic programming, is based on relations.
Imperative programming
In contrast, imperative programming changes state with commands in the source language, the most simple example being assignment.
Imperative programming does have functions, not in the mathematical sense, but in the sense of subroutines. They can have side effects that may change the value of program state. Functions without return values therefore make sense. Because of this, they lack referential transparency, i.e. the same language expression can result in different values at different times depending on the state of the executing program.
External links
- Functional programming @ Wikipedia
