List Of Programming Languages By Type

Array languages[editarrow-up-right]

Main category: Array programming languagesarrow-up-right

Array programmingarrow-up-right (also termed vector or multidimensional) languages generalize operations on scalars to apply transparently to vectorsarrow-up-right, matricesarrow-up-right, and higher-dimensional arraysarrow-up-right.

Assembly languages[editarrow-up-right]

Main article: Assembly languagearrow-up-right

Assembly languagesarrow-up-right directly correspond to a machine languagearrow-up-right (see belowarrow-up-right), although there may not be a 1-1 mapping between an individual statement and an individual instruction, so machine code instructions appear in a form understandable by humans. Assembly languages let programmers use symbolic addresses, which the assemblerarrow-up-right converts to absolute or relocatablearrow-up-right addresses. Most assemblers also support macrosarrow-up-right and symbolic constantsarrow-up-right.

Authoring languages[editarrow-up-right]

Main article: Authoring languagearrow-up-right

An authoring languagearrow-up-right is a programming language desined for use by a non-computer expert to easily create tutorials, websites, and other interactive computer programs.

Constraint programming languages[editarrow-up-right]

Main article: Constraint programmingarrow-up-right

A constraint programming languagearrow-up-right is a declarative programming languagearrow-up-right where relationships between variables are expressed as constraintsarrow-up-right. Execution proceeds by attempting to find values for the variables which satisfy all declared constraints.

Command line interface languages[editarrow-up-right]

Command-line interfacearrow-up-right (CLI) languages are also called batch languages or job control languages. Examples:

Compiled languages[editarrow-up-right]

These are languages typically processed by compilersarrow-up-right, though theoretically any language can be compiled or interpreted[citation neededarrow-up-right]. See also compiled languagearrow-up-right.

Concurrent languages[editarrow-up-right]

Main category: Concurrent programming languagesarrow-up-rightFor a more comprehensive list, see List of concurrent and parallel programming languagesarrow-up-right.

Message passingarrow-up-right languages provide language constructs for concurrencyarrow-up-right. The predominant paradigm for concurrency in mainstream languages such as Javaarrow-up-right is shared memoryarrow-up-right concurrency. Concurrent languages that make use of message passing have generally been inspired by process calculi such as communicating sequential processesarrow-up-right (CSP) or the π-calculusarrow-up-right.

Curly-bracket languages[editarrow-up-right]

Curly-bracket or curly-brace programming languages have a syntax that defines statement blocks using the curly bracket or brace characters { and }arrow-up-right. This syntax originated with BCPLarrow-up-right (1966), and was popularized by Carrow-up-right. Many curly-bracket languages descend from or are strongly influenced by C. Examples of curly-bracket languages include:

Dataflow languages[editarrow-up-right]

Dataflow programmingarrow-up-right languages rely on a (usually visual) representation of the flow of data to specify the program. Frequently used for reacting to discrete events or for processing streams of data. Examples of dataflow languages include:

Data-oriented languages[editarrow-up-right]

Data-oriented languages provide powerful ways of searching and manipulating the relations that have been described as entity relationship tables which map one set of things into other sets.[citation neededarrow-up-right] Examples of data-oriented languages include:

Decision table languages[editarrow-up-right]

Decision tablesarrow-up-right can be used as an aid to clarifying the logic before writing a program in any language, but in the 1960s a number of languages were developed where the main logic is expressed directly in the form of a decision table, including:

Declarative languages[editarrow-up-right]

Main category: Declarative programming languagesarrow-up-right

Declarative languagesarrow-up-right express the logic of a computation without describing its control flow in detail. Declarative programmingarrow-up-right stands in contrast to imperative programmingarrow-up-right via imperative programming languages, where control flow is specified by serial orders (imperatives). (Pure) functionalarrow-up-right and logic-basedarrow-up-right programming languages are also declarative, and constitute the major subcategories of the declarative category. This section lists additional examples not in those subcategories.

Embeddable languages[editarrow-up-right]

In source code[editarrow-up-right]

Source embeddable languages embed small pieces of executable code inside a piece of free-form text, often a web page.

Client-side embedded languages are limited by the abilities of the browser or intended client. They aim to provide dynamism to web pages without the need to recontact the server.

Server-side embedded languages are much more flexible, since almost any language can be built into a server. The aim of having fragments of server-side code embedded in a web page is to generate additional markup dynamically; the code itself disappears when the page is served, to be replaced by its output.

Server side[edit]

The above examples are particularly dedicated to this purpose. A large number of other languages, such as Erlangarrow-up-right, Scalaarrow-up-right, Perlarrow-up-right and Rubyarrow-up-right can be adapted (for instance, by being made into Apachearrow-up-right modules).

Client side[edit]

In object code[editarrow-up-right]

A wide variety of dynamic or scripting languages can be embedded in compiled executable code. Basically, object code for the language's interpreterarrow-up-right needs to be linked into the executable. Source code fragments for the embedded language can then be passed to an evaluation function as strings. Application control languages can be implemented this way, if the source code is input by the user. Languages with small interpreters are preferred.

Educational Programming languages[editarrow-up-right]

For a more comprehensive list, see List of educational programming languagesarrow-up-right.

Languages developed primarily for the purpose of teaching and learning of programming.

Esoteric languages[editarrow-up-right]

Main category: Esoteric programming languagesarrow-up-right

An esoteric programming languagearrow-up-right is a programming language designed as a test of the boundaries of computer programming language design, as a proof of concept, or as a joke.

Extension languages[editarrow-up-right]

Extension programming languagesarrow-up-right are languages embedded into another program and used to harness its features in extension scripts.

Fourth-generation languages[editarrow-up-right]

Main category: Fourth-generation programming languagesarrow-up-right

Fourth-generation programming languagesarrow-up-right are high-level languages built around database systems. They are generally used in commercial environments.

Functional languages[editarrow-up-right]

Main category: Functional languagesarrow-up-right

Functional programmingarrow-up-right languages define programs and subroutines as mathematical functions and treat them as first-class. Many so-called functional languages are "impure", containing imperative features. Many functional languages are tied to mathematical calculation tools. Functional languages include:

Hardware description languages[editarrow-up-right]

For a more comprehensive list, see List of hardware description languagesarrow-up-right.

In electronics, a hardware description languagearrow-up-right (HDL) is a specialized computer language used to describe the structure, design, and operation of electronic circuits, and most commonly, digital logic circuits. The two most widely used and well-supported HDL varieties used in industry are Verilogarrow-up-right and VHDLarrow-up-right. Hardware description languages include:

HDLs for analog circuit design[editarrow-up-right]

HDLs for digital circuit design[editarrow-up-right]

Imperative languages[editarrow-up-right]

Imperative programming languages may be multi-paradigm and appear in other classifications. Here is a list of programming languages that follow the imperative paradigmarrow-up-right:

Interactive mode languages[editarrow-up-right]

Interactive mode languages act as a kind of shell: expressions or statements can be entered one at a time, and the result of their evaluation is seen immediately. The interactive mode is also termed a read–eval–print looparrow-up-right (REPL).

Interpreted languages[editarrow-up-right]

Interpreted languagesarrow-up-right are programming languages in which programs may be executed from source code form, by an interpreter. Theoretically, any language can be compiled or interpreted, so the term interpreted language generally refers to languages that are usually interpreted rather than compiled.

Iterative languages[editarrow-up-right]

Iterative languages are built around or offering generatorsarrow-up-right.

Languages by memory management type[editarrow-up-right]

Garbage collected languages[editarrow-up-right]

Garbage Collection (GC) is a form of automatic memory management. The garbage collector attempts to reclaim memory that was allocated by the program but is no longer used.Main article: Garbage collection (computer science)arrow-up-right

Languages with manual memory management[editarrow-up-right]

This section needs expansion. You can help by adding to itarrow-up-right. (November 2016)

Languages with deterministic memory management[editarrow-up-right]

This section needs expansion. You can help by adding to itarrow-up-right. (April 2018)

Languages with automatic reference counting (ARC)[editarrow-up-right]

This section needs expansion. You can help by adding to itarrow-up-right. (September 2018)

List-based languages – LISPs[editarrow-up-right]

List-based languages are a type of data-structured languagearrow-up-right that are based on the listarrow-up-right data structure.

Little languages[editarrow-up-right]

Little languagesarrow-up-right[4]arrow-up-right serve a specialized problem domain.

Logic-based languages[editarrow-up-right]

Main category: Logic programming languagesarrow-up-right

Logic-basedarrow-up-right languages specify a set of attributes that a solution must-have, rather than a set of steps to obtain a solution.

Notable languages following this programming paradigmarrow-up-right include:

Machine languages[editarrow-up-right]

Machine languagesarrow-up-right are directly executable by a computer's CPU. They are typically formulated as bit patterns, usually represented in octalarrow-up-right or hexadecimalarrow-up-right. Each bit pattern causes the circuits in the CPU to execute one of the fundamental operations of the hardware. The activation of specific electrical inputs (e.g., CPU package pins for microprocessors), and logical settings for CPU state values, control the processor's computation. Individual machine languages are specific to a family of processors; machine-language code for one family of processors cannot run directly on processors in another family unless the processors in question have additional hardware to support it (for example, DEC VAX processors included a PDP-11 compatibility mode). They are (essentially) always defined by the CPU developer, not by 3rd parties. The symbolic version, the processor's assembly languagearrow-up-right, is also defined by the developer, in most cases. Some commonly used machine code instruction setsarrow-up-right are:

Macro languages[editarrow-up-right]

Main category: Macro programming languagesarrow-up-right

Textual substitution macro languages[editarrow-up-right]

Macroarrow-up-right languages transform one source code file into another. A "macro" is essentially a short piece of text that expands into a longer one (not to be confused with hygienic macrosarrow-up-right), possibly with parameter substitution. They are often used to preprocessarrow-up-right source code. Preprocessors can also supply facilities like file inclusionarrow-up-right.

Macro languages may be restricted to acting on specially labeled code regions (pre-fixed with a # in the case of the C preprocessor). Alternatively, they may not, but in this case it is still often undesirable to (for instance) expand a macro embedded in a string literalarrow-up-right, so they still need a rudimentary awareness of syntax. That being the case, they are often still applicable to more than one language. Contrast with source-embeddable languages like PHParrow-up-right, which are fully featured.

Application macro languages[editarrow-up-right]

Scripting languagesarrow-up-right such as Tclarrow-up-right and ECMAScriptarrow-up-right (ActionScriptarrow-up-right, ECMAScript for XMLarrow-up-right, JavaScriptarrow-up-right, JScriptarrow-up-right) have been embedded into applications. These are sometimes called "macro languages", although in a somewhat different sense to textual-substitution macros like m4arrow-up-right.

Metaprogramming languages[editarrow-up-right]

Metaprogrammingarrow-up-right is the writing of programs that write or manipulate other programs, including themselves, as their data or that do part of the work that is otherwise done at run timearrow-up-right during compile timearrow-up-right. In many cases, this allows programmers to get more done in the same amount of time as they would take to write all the code manually.

Multiparadigm languages[editarrow-up-right]

Main article: Comparison of multi-paradigm programming languagesarrow-up-right

Multiparadigm languagesarrow-up-right support more than one programming paradigmarrow-up-right. They allow a programarrow-up-right to use more than one programmingarrow-up-right style. The goal is to allow programmers to use the best tool for a job, admitting that no one paradigm solves all problems in the easiest or most efficient way.

Numerical analysis[editarrow-up-right]

Several general-purpose programming languages, such as Carrow-up-right and Pythonarrow-up-right, are also used for technical computing, this list focuses on languages almost exclusively used for technical computing.

Non-English-based languages[editarrow-up-right]

Main article: Non-English-based programming languagesarrow-up-right

Object-oriented class-based languages[editarrow-up-right]

Class-based Object-oriented programming languagesarrow-up-right support objects defined by their class. Class definitions include member data. Message passingarrow-up-right is a key concept (if not the key concept) in Object-oriented languages.

Polymorphic functions parameterized by the class of some of their arguments are typically called methods. In languages with single dispatcharrow-up-right, classes typically also include method definitions. In languages with multiple dispatcharrow-up-right, methods are defined by generic functionsarrow-up-right. There are exceptions where single dispatcharrow-up-right methods are generic functionsarrow-up-right (e.g. Biglooarrow-up-right's object system).

Single dispatch[editarrow-up-right]

Object-oriented prototype-based languages[editarrow-up-right]

Prototype-based languagesarrow-up-right are object-oriented languages where the distinction between classes and instances has been removed:

Off-side rule languages[editarrow-up-right]

Main article: Off-side rule § Off-side rule languagesarrow-up-right

Off-side rulearrow-up-right languages denote blocks of code by their indentationarrow-up-right.

Procedural languages[editarrow-up-right]

Procedural programmingarrow-up-right languages are based on the concept of the unit and scope (the data viewing range) of an executable code statement. A procedural program is composed of one or more units or modules, either user coded or provided in a code library; each module is composed of one or more procedures, also called a function, routine, subroutine, or method, depending on the language. Examples of procedural languages include:

Query languages[editarrow-up-right]

Main article: Query languagearrow-up-right

Reflective Language[editarrow-up-right]

Reflectivearrow-up-right languages let programs examine and possibly modify their high level structure at runtime or compile-time. This is most common in high-level virtual machine programming languages like Smalltalkarrow-up-right, and less common in lower-level programming languages like Carrow-up-right. Languages and platforms supporting reflection:See also: Aspect-oriented programmingarrow-up-right

Rule-based languages[editarrow-up-right]

Rule-based languages instantiate rules when activated by conditions in a set of data. Of all possible activations, some set is selected and the statements belonging to those rules execute. Rule-based languages include:[citation neededarrow-up-right]

Scripting languages[editarrow-up-right]

"Scripting languagearrow-up-right" has two apparently different, but in fact similar, meanings. In a traditional sense, scripting languages are designed to automate frequently used tasks that usually involve calling or passing commands to external programs. Many complex application programs provide built-in languages that let users automate tasks. Those that are interpretivearrow-up-right are often called scripting languages.

Recently, many applications have built-in traditional scripting languages, such as Perlarrow-up-right or Visual Basicarrow-up-right, but there are quite a few native scripting languages still in use. Many scripting languages are compiled to bytecode and then this (usually) platform-independent bytecode is run through a virtual machine (compare to Java virtual machinearrow-up-right).

Stack-based languages[editarrow-up-right]

Main category: Stack-oriented programming languagesarrow-up-right

Stack-based languages are a type of data-structured languagearrow-up-right that are based on the stackarrow-up-right data structure.

Synchronous languages[editarrow-up-right]

Main category: Synchronous programming languagesarrow-up-right

Synchronous programming languagesarrow-up-right are optimized for programming reactive systems, systems that are often interrupted and must respond quickly. Many such systems are also called realtime systemsarrow-up-right, and are used often in embedded systemsarrow-up-right.

Examples:

Shading languages[editarrow-up-right]

See also: Category:Shading languagesarrow-up-right

A shading languagearrow-up-right is a graphics programming language adapted to programming shader effects. Such language forms usually consist of special data types, like "color" and "normal". Due to the variety of target markets for 3D computer graphics.

Real-time rendering[editarrow-up-right]

They provide both higher hardware abstraction and a more flexible programming model than previous paradigms which hardcoded transformation and shading equations. This gives the programmer greater control over the rendering process and delivers richer content at lower overhead.

Offline rendering[editarrow-up-right]

Shading languages used in offline rendering produce maximum image quality. Processing such shaders is time-consuming. The computational power required can be expensive because of their ability to produce photorealistic results.

Syntax-handling languages[editarrow-up-right]

These languages assist with generating lexical analyzersarrow-up-right and parsersarrow-up-right for context-free grammarsarrow-up-right.

System languages[editarrow-up-right]

The system programming languages are for low level tasks like memory management or task management. A system programming language usually refers to a programming language used for system programming; such languages are designed for writing system software, which usually requires different development approaches when compared with application software.

System software is computer software designed to operate and control the computer hardware, and to provide a platform for running application software. System software includes software categories such as operating systems, utility software, device drivers, compilers, and linkers. Examples of system languages include:

hideLanguage
Originator
First appeared
Influenced by
Used for

Transformation languages[editarrow-up-right]

Main article: Transformation languagearrow-up-right

Visual languages[editarrow-up-right]

Main category: Visual programming languagesarrow-up-right

Visual programming languagesarrow-up-right let users specify programs in a two-(or more)-dimensional way, instead of as one-dimensional text strings, via graphic layouts of various types. Some dataflow programmingarrow-up-right languages are also visual languages.

Wirth languages[editarrow-up-right]

Computer scientist Niklaus Wirtharrow-up-right designed and implemented several influential languages.

XML-based languages[editarrow-up-right]

These are languages based on or that operate on XMLarrow-up-right.

Last updated