This page provides the comparison tables of
functional programming
In computer science, functional programming is a programming paradigm where programs are constructed by applying and composing functions. It is a declarative programming paradigm in which function definitions are trees of expressions that ...
instructions between programming languages. Comparison of basic instructions of
imperative paradigm
In computer science, imperative programming is a programming paradigm of software that uses statements that change a program's state. In much the same way that the imperative mood in natural languages expresses commands, an imperative program co ...
is provided by
the comparison of basic instructions.
List operations
Function applications and lists
For brevity, these words will have the specified meanings in the following tables (unless noted to be part of language syntax):
;: A function. May be unary or n-ary (or always unary for languages without n-ary functions).
:;, , etc.: functions of specific arity. (with no number) is the same as , also known as a ''projection'' in many languages.
;: Unary function returning a Boolean value. (
ML type: ) (C-like type: ).
;: The list being operated on.
;: Comma-separated list of one or more argument names, in the form of .
;: A pattern, in languages with
pattern matching
In computer science, pattern matching is the act of checking a given sequence of tokens for the presence of the constituents of some pattern. In contrast to pattern recognition, the match usually has to be exact: "either it will or will not be ...
.
;: Any relevant value, depending on context.
Numerical operations on lists
;: a binary function that returns a value indicating sort order (an integer in most languages).
Iterations on lists
Generating lists by combinatorics tools
;start: first value of range.
;step: increment of range.
;count: number of items in range.
;last: inclusive last value of range.
;end: exclusive last value of range.
References
*functional programming
{{prog-lang-stub