FP (short for Function Programming) is a programming language created by John Backus to support the function-level programming paradigm. This allows eliminating named variables.
The values that FP programs map into one another comprise a set which is closed under sequence formation:
These values can be built from any set of atoms: booleans, integers, reals, characters, etc.:
⊥ is the undefined value, or bottom. Sequences are bottom-preserving:
FP...
More
FP (short for Function Programming) is a programming language created by John Backus to support the function-level programming paradigm. This allows eliminating named variables.
The values that FP programs map into one another comprise a set which is closed under sequence formation:
These values can be built from any set of atoms: booleans, integers, reals, characters, etc.:
⊥ is the undefined value, or bottom. Sequences are bottom-preserving:
FP programs are functions f that each map a single value x into another:
Functions are either primitive (i.e., provided with the FP environment) or are built from the primitives by program-forming operations (also called functionals).
An example of primitive function is constant, which transforms a value x into the constant-valued function x̄. Functions are strict:
Another example of a primitive function is the selector function family, denoted by 1,2,... where:
In contrast to primitive functions, functionals operate on other functions. For...
Less
