You will learn – definition of principle of programming languages with History and example of programming languages in this tutorial . These are “Principle of Programming Languages or PPL lecture notes of engineering students and also very useful for their semester exams . So let’s start
Definition of Principle of Programming Languages:
The Principle of Programming Language comes from concatenating of Principle + Programming Languages. By defining principles, it is the fundamental norms, values, rules and regulations that are uses to represent what is desirable and positive for any job or task, it is helpful in determining the rightfulness or wrongfulness of any state task. In formal principles are very basic than policy and objectives, and are meant to govern both. While programming languages relates to the formal construction of languages by expert programmers that leads to communicating high level instruction (e.g. human instructions) to a machine (e.g. General Computer) or a specific computer (e.g. Application Based Computers). A programming language can be used to create application programs, scripts or other sets of instructions to control the behavior of a machine or to express procedural steps called algorithms.
Hence we can define the principle of programming language as, “Principle of Programming Language is a set of rules and norms governed to communicate instructions (high level instruction or assemble level instruction) to a machine or particularly a computer.”
The concepts of General purpose computers have the amazing huge collection of instruction set that are useful to coordinate human desirable instruction to machine understandable. On the basis of set of instructions called programs, a general purpose computer becomes a single piece of hardware that can able to do any computation imaginable. To handle the action of general purpose computer, programmers uses the specific programming language based on those prefix set of instructions by programming language programmers develop computational code that handle computer actions.
History of programming languages:
In early 20th century in the field of mathematical logics, logicians created their own programming languages and their proof of correctness. Their motivation to proof the correctness of the programming logics based on the set of rules in which they derived the logical truth or universal true facts. Since proof of correctness rules and norms can be applied mechanically, all of the logically true facts can be mechanically enumerated by a person sitting there applying all of the rules in every order possible. This means the set of provable truths are recursively enumerable.
Some famous Logicians including Frege, Church, and Curry wanted to create a more general theory of logic and proof of correctness of programming language. The desire of proving more accurate and high correctness of programming language led logician Church to define the λ (lambda) calculus in 1932. λ-calculus is an abstract language of functions which is capable to define logic.
Basically a λ-calculus is a general-purpose programming language, and the concept of higher-order functions, introduced in the Lisp programming language in the 1960’s, was derived from the higher-order functions found in the λ-calculus.
Also Read: Command Line Interface
Example of Programming Languages:
FORTRAN, BASIC, LISP, C, Pascal etc.