List of programming languages by type


This is a list of notable programming languages, grouped by notable language attribute. As a language can have multiple attributes, the same language can be in multiple groupings.

Agent-oriented programming languages

Agent-oriented programming allows the developer to build, extend and use software agents, which are abstractions of objects that can message other agents.
languages generalize operations on scalars to apply transparently to vectors, matrices, and higher-dimensional arrays.
Aspect-oriented programming enables developers to add new functionality to code, known as "advice", without modifying that code itself; rather, it uses a pointcut to implement the advice into code blocks.
s directly correspond to a machine language, so machine code instructions appear in a form understandable by humans, although there may not be a one-to-one mapping between an individual statement and an individual instruction. Assembly languages let programmers use symbolic addresses, which the assembler converts to absolute or relocatable addresses. Most assemblers also support macros and symbolic constants.

Authoring languages

An authoring language is a programming language designed for use by a non-computer expert to easily create tutorials, websites, and other interactive computer programs.
Command-line interface languages are also called batch languages or job control languages. Examples:
These are languages typically processed by compilers, though theoretically any language can be compiled or interpreted.
A concatenative programming language is a point-free computer programming language in which all expressions denote functions, and the juxtaposition of expressions denotes function composition.
languages provide language constructs for concurrency. The predominant paradigm for concurrency in mainstream languages such as Java is shared memory concurrency. Concurrent languages that make use of message passing have generally been inspired by process calculi such as communicating sequential processes or the π-calculus.
A constraint programming language is a declarative programming language where relationships between variables are expressed as constraints. Execution proceeds by attempting to find values for the variables which satisfy all declared constraints.
is programming using defined preconditions, postconditions, and invariants.
A curly bracket or curly brace language has syntax that defines a block as the statements between curly brackets, a.k.a. braces, . This syntax originated with BCPL, and was popularized by C. Many curly bracket languages descend from or are strongly influenced by C. Examples:
languages rely on a 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 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. Examples of data-oriented languages include:
s 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:
express the logic of a computation without describing its control flow in detail. Declarative programming stands in contrast to imperative programming via imperative programming languages, where control flow is specified by serial orders. functional and logic-based programming languages are also declarative, and constitute the major subcategories of the declarative category. This section lists additional examples not in those subcategories.

In source code

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

The above examples are particularly dedicated to this purpose. A large number of other languages, such as Erlang, Scala, Perl and Ruby can be adapted.

Client side

A wide variety of dynamic or scripting languages can be embedded in compiled executable code. Basically, object code for the language's interpreter 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.
Languages developed primarily for the purpose of teaching and learning of programming.
An esoteric programming language 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.
s are languages embedded into another program and used to harness its features in extension scripts.
s are high-level programming languages built around database systems. They are generally used in commercial environments.
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:

Pure

In electronics, a hardware description language 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 Verilog and VHDL. Hardware description languages include:

HDLs for analog circuit design

Imperative programming languages may be multi-paradigm and appear in other classifications. Here is a list of programming languages that follow the imperative paradigm:
Known as REPL - 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 seen immediately.
s 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 are built around or offering generators.

Garbage collected languages

Garbage Collection 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.
Some programming languages without the inherent ability to manually manage memory, like Cython, Swift, and Scala, are able to import or call functions like malloc and free from C through a foreign function interface.

Languages with deterministic memory management

List-based languages are a type of data-structured language that are based on the list data structure.
serve a specialized problem domain.
  • awk – used for text file manipulation.
  • sed – parses and transforms text
  • SQL – has only a few keywords and not all the constructs needed for a full programming language – many database management systems extend SQL with additional constructs as a stored procedure language
  • XPL - a language designed for, although not limited to, compiler writing

    Logic-based languages

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 paradigm include:
s are directly executable by a computer's CPU. They are typically formulated as bit patterns, usually represented in octal or hexadecimal. 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, 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. They are always defined by the CPU developer, not by 3rd parties. The symbolic version, the processor's assembly language, is also defined by the developer, in most cases. Some commonly used machine code instruction sets are:

Textual substitution macro languages

languages transform one source code file into another. A "macro" is essentially a short piece of text that expands into a longer one, possibly with parameter substitution. They are often used to preprocess source code. Preprocessors can also supply facilities like file inclusion.
Macro languages may be restricted to acting on specially labeled code regions. Alternatively, they may not, but in this case it is still often undesirable to expand a macro embedded in a string literal, 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 PHP, which are fully featured.
s such as Tcl and ECMAScript have been embedded into applications. These are sometimes called "macro languages", although in a somewhat different sense to textual-substitution macros like m4.

Metaprogramming languages

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 time during compile time. 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.
is a programming paradigm of organising functions and symbols into independent modules.
s support more than one programming paradigm. They allow a program to use more than one programming 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.
Several general-purpose programming languages, such as C and Python, are also used for technical computing, this list focuses on languages almost exclusively used for technical computing.
-based object-oriented programming languages support objects defined by their class. Class definitions include member data. Message passing is a key concept, if not the main concept, in object-oriented languages.
Polymorphic functions parameterized by the class of some of their arguments are typically called methods. In languages with single dispatch, classes typically also include method definitions. In languages with multiple dispatch, methods are defined by generic functions. There are exceptions where single dispatch methods are generic functions.

[Multiple dispatch]

are object-oriented languages where the distinction between classes and instances has been removed:
languages denote blocks of code by their indentation.
languages are based on the concept of the unit and scope 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:

Reflective languages

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 Smalltalk, and less common in lower-level programming languages like C. Languages and platforms supporting reflection:
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:
Stack-based languages are a type of data-structured language that are based on the stack data structure.
s are optimized for programming reactive systems, systems that are often interrupted and must respond quickly. Many such systems are also called realtime systems, and are used often in embedded systems.
Examples:
A shading language 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

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.
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.
These languages assist with generating lexical analyzers and parsers for context-free grammars.
A system programming language is for low-level tasks like memory management or task management; it usually refers to a language used for systems programming; such languages are designed for writing system software, which usually requires different development approaches relative to application software.
System software is computer software designed to operate and control computer hardware, and provide a platform to run application software. System software includes software categories such as operating systems, utility software, device drivers, compilers, and linkers. Examples of system languages include:
LanguageOriginatorFirst appearedInfluenced byUsed for
ESPOLBurroughs Corporation1961ALGOL 60MCP
PL/IIBM, SHARE1964ALGOL 60, FORTRAN, some COBOLMultics
PL360Niklaus Wirth1968ALGOL 60ALGOL W
CDennis Ritchie1969BCPLMost operating system kernels, including Windows NT and most Unix-like systems
PL/SIBM196xPL/IOS/360
BLISSCarnegie Mellon University1970ALGOL-PL/IVMS
PL/8IBM197xPL/IAIX
PL/MP and PL/MIIBM197xPL/ICPF, OS/400
PL-6Honeywell, Inc.197xPL/ICP-6
SYMPLCDC197xJOVIALNOS subsystems, most compilers, FSE editor
C++Bjarne Stroustrup1979C, SimulaSee C++ Applications
AdaJean Ichbiah, S. Tucker Taft1983ALGOL 68, Pascal, C++, Java, EiffelEmbedded systems, OS kernels, compilers, games, simulations, CubeSat, air traffic control, and avionics
DDigital Mars2001C++Multiple domains
NimAndreas Rumpf2008Ada, Modula-3, Lisp, C++, Object Pascal, Python, OberonOS kernels, compilers, games
RustMozilla Research2010C++, Haskell, Erlang, RubyServo layout engine, RedoxOS
SwiftApple Inc.2014C, Objective-C, RustmacOS, iOS app development
ZigAndrew Kelley2016C, C++, LLVM IR, Go, Rust, JavaScriptAs a replacement for C
V Alexander Medvednikov2019C, Go, Oberon-2, Rust, Swift, KotlinVinix OS, OS kernels, compilers, games

Transformation languages

s serve the purpose of transforming source code specified in a certain formal language into a defined destination format code. It is most commonly used in intermediate components of more complex super-systems in order to adopt internal results for input into a succeeding processing routine.
s let users specify programs in a two--dimensional way, instead of as one-dimensional text strings, via graphic layouts of various types. Some dataflow programming languages are also visual languages.
Computer scientist Niklaus Wirth designed and implemented several influential languages.
These are languages based on or that operate on XML.