fp \- Functional Programming language compiler/interpreter
interpreter/compiler that implements the applicative language proposed
by John Backus. It is written in
In a functional programming language
in a mathematical style devoid of assignment statements
Functions compute by value only; there are no side-effects
since the result of a computation depends solely on the inputs.
.I functional expressions \-
primitive and user-defined
These forms take functional arguments
and return functional results.
For example, the composition
takes two functional arguments and returns a function
which represents their composition.
There exists a single operation in
This operation causes the system to evaluate the indicated function using
(all functions are monadic).
(the user may compile this code using the
liszt (\*s) compiler to gain a factor of 10 in performance).
terminates any computation in progress and resets any open file units.
provides a short summary of all user commands.
/usr/ucb/lisp the FRANZ LISP interpreter
/usr/ucb/liszt the liszt compiler
/usr/doc/fp the User's Guide
.I The Berkeley FP user's manual,
The language is described in the August 1978 issue of
(Turing award lecture by John Backus).
If a non-terminating function is applied as the result of loading a file,
then control is returned to the user immediately, everything
after that position in the file is ignored.
FP incorrectly marks the location of a syntax error on
large, multi-line function definitions or applications.