Using this classification, LPs are usually grouped as follows:

[sujonkumar6300]

Non-procedural languages, on the other hand, are usually classified into declarative languages ​​and application languages. They tend to be highly expressive (see section “Design Criteria” below), weakly-typed and dynamically-checked, and in them both data and programs usually have a common uniform representation, all of which makes them suitable for prototyping:

In Declarative Languages ​​(also called Logical Languages), what the computer should do is usually specified in terms of conjunctions, disjunctions, negations, and logical implications. Repetition of the equivalent of “instructions bosnia and herzegovina consumer email list is usually done by recursion.

In Applied Languages ​​(also called Functional Languages), the specification of the solution is made in terms of processes called functions (similar to those used in mathematics). A common representation for data and programs are lists (as in LISP, the typical prototypical language of this paradigm), and they usually have recursion as a repetition mechanism.

Generations

The 1st Generation of LPs is made up of the first low-level languages ​​such as assembly languages ​​and “machine languages”.