Interpreted Programming Language
An interpreted language is a programming language for which most of its implementations
execute instructions directly, without previously compiling a program into machine-language instructions.
The interpreter executes the program directly, translating each statement into a sequence of one or
more subroutines already compiled into machine code.
History
As a practical matter, a program could be written, saved on magnetic tape (or paper tape,) compiled and
saved on a different magnetic tape. On a personal computer, that wasn't practical. A compiler was a fairly
large program, home computers didn't have lots of fast off-line storage and, well, it would be nice to just
type it in and say RUN. The solution was an interpreter.
Feedback
Functional Programming Language
Functional programming is a style of programming which models computations as the
evaluation of expressions. History
Functional programming emerged as a distinct paradigm in the early 1960s. Its creation was
motivated by the needs of researchers in artificial intelligence and its subfields symbolic computation,
theorem proving, rule-based systems and natural language processing.