Incubator escapee wiki

List of programming languages by type

Article Discussion
(Redirected from Brief overview of the syntax of Java)

Template:Short description Template:Programming language lists This is a list of notable programming languages, grouped by type.

The groupings are overlapping; not mutually exclusive. A language can be listed in multiple groupings.

Agent-oriented programming languagesEdit

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

Agent-oriented programming allows the developer to build, extend and use software agents, which are abstractions of objects that can message other agents.

Array languagesEdit

Template:Main category

Array programming (also termed vector or multidimensional) languages generalize operations on scalars to apply transparently to vectors, matrices, and higher-dimensional arrays.

Template:Div col

|CitationClass=web }}</ref>

Template:Div col end

Aspect-oriented programming languagesEdit

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

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.

|CitationClass=web }}</ref><ref>{{#invoke:citation/CS1|citation |CitationClass=web }}</ref>

Assembly languagesEdit

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

Assembly languages directly correspond to a machine language (see below), 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 languagesEdit

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

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 languagesEdit

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

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

  • 4DOS (shell for IBM PCs)
  • 4OS2 (shell for IBM PCs)
  • Bash (the Bourne-Again shell from GNU)
  • CLIST (MVS Command List)
  • CMS EXEC
  • csh and tcsh (by Bill Joy)
  • DIGITAL Command Language CLI for OpenVMS
  • Batch file (DOS batch language) (for IBM PCs, pre-Windows)
  • EXEC 2
  • Expect (a Unix automation and test tool)
  • fish (a Unix shell)
  • Hamilton C shell (a C shell for Windows)
  • ksh (a standard Unix shell, written by David Korn)
  • Nushell (a cross-platform shell)
  • PowerShell (.NET-based CLI)
  • rc (shell for Plan 9)
  • RUNCOM (CTSS command processor)
  • Rexx
  • sh (standard Unix shell, by Stephen R. Bourne)
  • TACL (programming language)
  • Windows batch language (input for COMMAND.COM or CMD.EXE)
  • zsh (a Unix shell)

Compiled languagesEdit

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}} These are languages typically processed by compilers, though theoretically any language can be compiled or interpreted.

Template:Div col

Template:Div col end

Concatenative programming languagesEdit

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

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.

Concurrent languagesEdit

Template:Main category Template:Main list

Message passing 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 (CSP) or the π-calculus.

Template:Div col

|CitationClass=web }}</ref>

Template:Div col end

Constraint programming languagesEdit

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

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.

|CitationClass=web }}</ref>

Curly bracket languagesEdit

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 (1966), and was popularized by C. Many curly bracket languages descend from or are strongly influenced by C. Examples:

Template:Div col

|CitationClass=web }}</ref>

|CitationClass=web }}</ref>

Template:Div col end

Dataflow languagesEdit

Dataflow programming 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:

Template:Div col

Template:Div col end

Data-oriented languagesEdit

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.Template:Citation needed Examples of data-oriented languages include:

Template:Div col

Template:Div col end

Decision table languagesEdit

Decision tables 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 languagesEdit

Template:Main category

Declarative languages 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 (imperatives). (Pure) 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.

Template:Div col

Template:Div col end

Embeddable languagesEdit

In source codeEdit

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 sideEdit

The above examples are particularly dedicated to this purpose. A large number of other languages, such as Erlang, Scala, Perl, Ring and Ruby can be adapted (for instance, by being made into Apache modules).

Client sideEdit

In object codeEdit

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.

Template:Div col

Template:Div col end

Educational programming languagesEdit

Template:Main list

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

Template:Div col

Template:Div col end

Esoteric languagesEdit

Template:Main category

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.

Template:Div col

|CitationClass=web }}</ref>

Template:Div col end

Extension languagesEdit

Extension programming languages are languages embedded into another program and used to harness its features in extension scripts. Template:Div col

Template:Div col end

Fourth-generation languagesEdit

Template:Main category

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

Template:Div col

Template:Div col end

Functional languagesEdit

Template:Main category

Functional programming 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:

PureEdit

Template:Div col

Template:Div col end

ImpureEdit

Template:Div col

Template:Div col end

Hardware description languagesEdit

Template:Main list

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

HDLs for analog circuit designEdit

  • Verilog-AMS (Verilog for Analog and Mixed-Signal)
  • VHDL-AMS (VHDL with Analog/Mixed-Signal extension)

HDLs for digital circuit designEdit

Template:Div col

Template:Div col end

Imperative languagesEdit

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

Template:Div col

Template:Div col end

Interactive mode languagesEdit

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.

Template:Div col

Template:Div col end

Interpreted languagesEdit

Interpreted languages 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.

Template:Div col

Template:Div col end

Iterative languagesEdit

Iterative languages are built around or offering generators.

Template:Div col

|CitationClass=web }}</ref>

Template:Div col end

Languages by memory management typeEdit

Garbage collected languagesEdit

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. {{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}} Template:Div col

Template:Div col end

Languages with manual memory managementEdit

Template:Expand section

Languages with optional manual memory managementEdit

|CitationClass=web }}</ref><ref>{{#invoke:citation/CS1|citation |CitationClass=web }}</ref><ref>{{#invoke:citation/CS1|citation |CitationClass=web }}</ref>

  • COBOL<ref>{{#invoke:citation/CS1|citation

|CitationClass=web }}</ref><ref>{{#invoke:citation/CS1|citation |CitationClass=web }}</ref><ref>{{#invoke:citation/CS1|citation |CitationClass=web }}</ref>

  • D<ref>{{#invoke:citation/CS1|citation

|CitationClass=web }}</ref>

  • Nim<ref>{{#invoke:citation/CS1|citation

|CitationClass=web }}</ref>

|CitationClass=web }}</ref>

|CitationClass=web }}</ref>

  • V<ref>{{#invoke:citation/CS1|citation

|CitationClass=web }}</ref>

  • Vala<ref>{{#invoke:citation/CS1|citation

|CitationClass=web }}</ref>

Some programming languages without the inherent ability to manually manage memory, like Cython,<ref>{{#invoke:citation/CS1|citation |CitationClass=web }}</ref> Swift,Template:Efn and Scala<ref>{{#invoke:citation/CS1|citation |CitationClass=web }}</ref> (Scala Native only), are able to import or call functions like malloc and free from C through a foreign function interface.

Languages with deterministic memory managementEdit

Template:Expand section

|CitationClass=web }}</ref><ref>{{#invoke:citation/CS1|citation |CitationClass=web }}</ref>

Languages with automatic reference counting (ARC)Edit

Template:Expand section

List-based languages – LISPsEdit

List-based languages are a type of data-structured language that are based on the list data structure. Template:Col-float

Template:Col-float-break

Template:Col-float-end

Little languagesEdit

Little languages<ref>Jon Bentley (AT&T) August 1986 CACM 29 (8) "Little Languages", pp 711-721 from his Programming Pearls column</ref> 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 languageTemplate:Efn – many database management systems extend SQL with additional constructs as a stored procedure language

Logic-based languagesEdit

Template:Main category

Logic-based 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:

Machine languagesEdit

Machine languages 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 (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.Template:Efn 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:

Template:Div col

Template:Div col end

Macro languagesEdit

Template:Main category

Textual substitution macro languagesEdit

Macro 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 macros), 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 (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 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.

  • cpp (the C preprocessor)
  • m4 (originally from AT&T, bundled with Unix)
  • ML/I (general-purpose macro processor)
  • TTM (developed at the California Institute of Technology)

Application macro languagesEdit

Scripting languages such as Tcl and ECMAScript (ActionScript, ECMAScript for XML, JavaScript, JScript) have been embedded into applications. These are sometimes called "macro languages", although in a somewhat different sense to textual-substitution macros like m4.

Metaprogramming languagesEdit

Metaprogramming 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.

Template:Div col

|CitationClass=web }}</ref>

|CitationClass=web }}</ref>

Template:Div col end

Multiparadigm languagesEdit

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}} Multiparadigm languages 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.

Template:Div col

  • 1C:Enterprise programming language (generic, imperative, object-oriented, prototype-based, functional)
  • Ada (concurrent, distributed, generic (template metaprogramming), imperative, object-oriented (class-based))
  • ALF (functional, logic)
  • Alma-0 (constraint, imperative, logic)
  • APL (functional, imperative, object-oriented (class-based))
  • BETA (functional, imperative, object-oriented (class-based))
  • C++ (generic, imperative, object-oriented (class-based), functional, metaprogramming)
  • C# (generic, imperative, object-oriented (class-based), functional, declarative)
  • Ceylon (generic, imperative, object-oriented (class-based), functional, declarative)
  • ChucK (imperative, object-oriented, time-based, concurrent, on-the-fly)
  • Cobra (generic, imperative, object-oriented (class-based), functional, contractual)
  • Common Lisp (functional, imperative, object-oriented (class-based), aspect-oriented (user may add further paradigms, e.g., logic))
  • Curl (functional, imperative, object-oriented (class-based), metaprogramming)
  • Curry (concurrent, functional, logic)
  • D (generic, imperative, functional, object-oriented (class-based), metaprogramming)
  • Dart (generic, imperative, functional, object-oriented (class-based))
  • Delphi Object Pascal (generic, imperative, object-oriented (class-based), metaprogramming)
  • Dylan (functional, object-oriented (class-based))
  • ECMAScript (functional, imperative, object-oriented (prototype-based))
  • Eiffel (imperative, object-oriented (class-based), generic, functional (agents), concurrent (SCOOP))
  • F# (functional, generic, object-oriented (class-based), language-oriented)
  • Fantom (functional, object-oriented (class-based))
  • Go (imperative, procedural),
  • Groovy (functional, object-oriented (class-based), imperative, procedural)
  • Harbour
  • Hop
  • J (functional, imperative, object-oriented (class-based))
  • Java (generic, imperative, object-oriented (class-based), functional)
  • Julia (imperative, multiple dispatch ("object-oriented"), functional, metaprogramming)
  • LabVIEW (visual, dataflow, concurrent, modular, functional, object-oriented, scripting)
  • Lua (functional, imperative, object-oriented (prototype-based))
  • Mercury (functional, logical, object-oriented)
  • Metaobject protocols (object-oriented (class-based, prototype-based))
  • Nemerle (functional, object-oriented (class-based), imperative, metaprogramming)
  • Objective-C (imperative, object-oriented (class-based), reflective)
  • OCaml (functional, imperative, object-oriented (class-based), modular)
  • Oz (functional (evaluation: eager, lazy), logic, constraint, imperative, object-oriented (class-based), concurrent, distributed), and Mozart Programming System cross-platform Oz
  • Object Pascal (imperative, object-oriented (class-based))
  • Perl (imperative, functional (can't be purely functional), object-oriented, class-oriented, aspect-oriented (through modules))
  • PHP (imperative, object-oriented, functional (can't be purely functional))
  • Pike (interpreted, general-purpose, high-level, cross-platform, dynamic programming language )
  • Prograph (dataflow, object-oriented (class-based), visual)
  • Python (functional, compiled, interpreted, object-oriented (class-based), imperative, metaprogramming, extension, impure, interactive mode, iterative, reflective, scripting)
  • R (array, interpreted, impure, interactive mode, list-based, object-oriented prototype-based, scripting)
  • Racket (functional, imperative, object-oriented (class-based) and can be extended by the user)
  • Raku (concurrent, concatenative, functional, metaprogramming generic, imperative, reflection object-oriented, pipelines, reactive, and via libraries constraints, distributed)
  • Rebol (functional, imperative, object-oriented (prototype-based), metaprogramming (dialected))
  • Red (functional, imperative, object-oriented (prototype-based), metaprogramming (dialected))
  • ROOP (imperative, logic, object-oriented (class-based), rule-based)
  • Ring (imperative, functional, object-oriented (class-based), metaprogramming, declarative, natural)
  • Ruby (imperative, functional, object-oriented (class-based), metaprogramming)
  • Rust (concurrent, functional, imperative, object-oriented, generic, metaprogramming, compiled)
  • Scala (functional, object-oriented)
  • Seed7 (imperative, object-oriented, generic)
  • SISAL (concurrent, dataflow, functional)
  • Spreadsheets (functional, visual)
  • Swift (protocol-oriented, object-oriented, functional, imperative, block-structured)
  • Tcl (functional, imperative, object-oriented (class-based))
    • Tea (functional, imperative, object-oriented (class-based))
  • V (Vlang) (functional, imperative, procedural, structured, concurrent)
  • Windows PowerShell (functional, imperative, pipeline, object-oriented (class-based))
  • Wolfram Mathematica (Wolfram language)

Template:Div col end

Numerical analysisEdit

Template:See also 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.

Template:Col-begin Template:Col-2

Template:Col-2

Template:Col-end

Non-English-based languagesEdit

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

Object-oriented class-based languagesEdit

Class-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 (e.g. Bigloo's object system).

Multiple dispatchEdit

Template:Div col

|CitationClass=web }}</ref>

Template:Div col end

Single dispatchEdit

Template:Div col

Template:Div col end

Object-oriented prototype-based languagesEdit

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

Template:Div col

Template:Div col end

Off-side rule languagesEdit

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

Off-side rule languages denote blocks of code by their indentation.

Template:Div col

Template:Div col end

Procedural languagesEdit

Procedural programming 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:

Template:Div col

Template:Div col end

Query languagesEdit

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

Reflective languagesEdit

Reflective programming 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:

Template:See also

Template:Div col

|CitationClass=web }}</ref>

Template:Div col end

Rule-based languagesEdit

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:Template:Citation needed

Template:Div col

Template:Div col end

Scripting languagesEdit

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

Template:Div col

Template:Div col end

Stack-based languagesEdit

Template:Main category

Stack-based languages are a type of data-structured language that are based on the stack data structure.

Template:Div col

Template:Div col end

Synchronous languagesEdit

Template:Main category

Synchronous programming languages 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:

Shading languagesEdit

Template:Category see also

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 renderingEdit

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. Template:Div col

|CitationClass=web }}</ref>

Template:Div col end

Offline renderingEdit

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. Template:Div col

Template:Div col end

Syntax-handling languagesEdit

These languages assist with generating lexical analyzers and parsers for context-free grammars.

|CitationClass=web }}</ref>

System languagesEdit

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:

Language Originator First appeared Influenced by Used for
ESPOL Burroughs Corporation 1961 ALGOL 60 MCP
PL/I IBM, SHARE 1964 ALGOL 60, FORTRAN, some COBOL Multics
PL360 Niklaus Wirth 1968 ALGOL 60 ALGOL W
C Dennis Ritchie 1969 BCPL Most operating system kernels, including Windows NT and most Unix-like systems
PL/S IBM 196x PL/I OS/360
BLISS Carnegie Mellon University 1970 ALGOL-PL/I<ref>Template:Cite journal</ref> VMS (portions)
PL/8 IBM 197x PL/I AIX
PL/MP and PL/MI IBM 197x PL/I CPF, OS/400
PL-6 Honeywell, Inc. 197x PL/I CP-6
SYMPL CDC 197x JOVIAL NOS subsystems, most compilers, FSE editor
C++ Bjarne Stroustrup 1979 C, Simula citation CitationClass=web

}}</ref>

Ada Jean Ichbiah, S. Tucker Taft 1983 ALGOL 68, Pascal, C++, Java, Eiffel Embedded systems, OS kernels, compilers, games, simulations, CubeSat, air traffic control, and avionics
D Digital Mars 2001 C++ citation CitationClass=web

}}</ref>

Nim Andreas Rumpf 2008 Ada, Modula-3, Lisp, C++, Object Pascal, Python, Oberon OS kernels, compilers, games
Rust Mozilla Research<ref>{{#invoke:citation/CS1|citation CitationClass=web

}}</ref> || 2010 || C++, Haskell, Erlang, Ruby || Servo layout engine, Redox OS

Swift Apple Inc. 2014 C, Objective-C, Rust macOS, iOS app developmentTemplate:Efn
Zig Andrew Kelley 2016 C, C++, LLVM IR, Go, Rust, JavaScript As a replacement for C
V (Vlang) Alexander Medvednikov 2019 C, Go, Oberon-2, Rust, Swift, Kotlin Vinix OS, OS kernels, compilers, games

Transformation languagesEdit

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}} Transformation languages serve the purpose of transforming (translating) 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. Template:Div col

Template:Div col end

Visual languagesEdit

Template:Main category

Visual programming languages 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 programming languages are also visual languages.

Template:Div col

Template:Div col end

Wirth languagesEdit

Computer scientist Niklaus Wirth designed and implemented several influential languages.

Template:Div col

Template:Div col end

XML-based languagesEdit

These are languages based on or that operate on XML.

Template:Div col

Template:Div col end

See alsoEdit

NotesEdit

Template:Notelist

ReferencesEdit

Template:Reflist

Template:Programming languages

Retrieved from "https://zalansite.site/mediawiki/index.php?title=List_of_programming_languages_by_type&oldid=105747#Curly-bracket_languages"