|
Computer Programming Languages
History of computer Ever since the invention of Charles Babbage's difference engine in 1822, computers have required a means of instructing them to perform a specific task. This means is known as a best computers programming languages. Computers languages were first composed of a series of steps to wire a particular program; these morphed into a series of steps keyed into the computer and then executed; later these languages acquired advanced features such as logical branching and object orientation. The computer languages of the last fifty years have come in two stages, the first major languages and the second major languages, which are in use today.
In 1945, John Von Neumann was working at the Institute for Advanced Study. He developed two important concepts that directly affected the path of computers programming languages. This technique stated that the actual computer hardware should be simple and not need to be hand-wired for each program. Instead, complex instructions should be used to control the simple hardware, allowing it to be reprogrammed much faster.
In 1957, the first of the major languages appeared in the form of FORTRAN. Its name stands for FORmula TRANslating system. The language was designed at IBM for scientific computing. The components were very simple, and provided the programmer with low-level access to the computers innards. Today, this language would be considered restrictive as it only included IF, DO, and GOTO statements, but at the time, these commands were a big step forward. The basic types of data in use today got their start in FORTRAN, these included logical variables (TRUE or FALSE), and integer, real, and double-precision numbers.
Programming : Computer programming for beginner
The process of creating steps for a computer to perform a desired task. To run successfully, the program must be absolutely logical.
There is languages categories
Procedural Language:
A language which states how to compute the result of a given problem. This term encompasses both imperative and functional languages.
Imperative Language:
A language which operates by a sequence of commands that change the value of data elements. Imperative languages are typified by assignments and iteration.
Declarative Language:
A language which operates by making descriptive statements about data, and relations between data. The algorithm is hidden in the semantics of the language. This category encompasses both applicative and logic languages. Examples of declarative features are set comprehensions and pattern-matching statements.
Applicative Language:
A language that operates by application of functions to values, with no side effects. A functional language in the broad sense.
Ada95 is a general-purpose programming language which was originally commissioned by the U.S. Department of Defense in the late 1970s. The language definition was finally approved by the American National Standards Institute (ANSI) in 1983 and also by the International Organization for Standardization (ISO) in 1987.
COBOL COBOL was initially created in 1959 by The Short Range Committee, one of three committees proposed at a meeting held at the Pentagon in May 1959, organized by Charles Phillips of the United States Department of Defense.
C has the strength that it is quite ubiquitous, and has simple enough requirements for the underlying "system model" that it is useful for implementing operating systems;
Lisp offers the merits of representing both code and data as lists, providing higher order functions, and providing the ability to manipulate the representation of code at compile time via macros.
Java is a language that was originally created to be used to program toasters, microwave ovens, and other embedded systems.
Perl allows building compact programs that quite powerfully manipulate text, and links to huge libraries of utilities.
Prolog uses backtracking and (seeming) indeterminism so that you describe answers rather than indicating how to calculate them. This is very useful when you know what answers you want, but either don't care or don't know the sequencing of how the result is to be found.
|