List Of Programming Languages By Type

From Handwiki
Short description: none

This is a list of notable programming languages, grouped by type.

There is no overarching classification scheme for programming languages. Thus, in many cases, a language is listed under multiple headings (in this regard, see "Multiparadigm languages" below).

Array languages

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



Agent-oriented programming languages

Main page: Agent-oriented programming

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

Aspect-oriented programming languages

Main page: Aspect-oriented programming

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.

Assembly languages

Main page: Assembly language

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

Concatenative programming languages

Main page: Concatenative programming language

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.[1] Concatenative programming replaces function application, which is common in other programming styles, with function composition as the default way to build subroutines.

Constraint programming languages

Main page: Constraint programming

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.

Command-line interface languages

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


Compiled languages

Main page: Compiled language

These are languages typically processed by compilers, though theoretically any language can be compiled or interpreted.



Concurrent languages

For a more comprehensive list, see List of concurrent and parallel programming languages.

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.


  • Ada – multi-purpose language
  • Alef – concurrent language with threads and message passing, used for systems programming in early versions of Plan 9 from Bell Labs
  • Ateji PX – an extension of the Java language for parallelism
  • Ballerina – a language designed for implementing and orchestrating micro-services. Provides a message based parallel-first concurrency model.
  • ChucK – domain specific programming language for audio, precise control over concurrency and timing
  • Cilk – a concurrent C
  • Cω – C Omega, a research language extending C#, uses asynchronous communication
  • Clojure – a dialect of Lisp for the Java virtual machine
  • Chapel
  • Co-array Fortran
  • Concurrent Pascal (by Brinch-Hansen)
  • Curry
  • E – uses promises, ensures deadlocks cannot occur
  • Eiffel (through the SCOOP mechanism, Simple Concurrent Object-Oriented Computation)
  • Elixir (runs on the Erlang VM)
  • Emerald – uses threads and monitors
  • Erlang – uses asynchronous message passing with nothing shared
  • Gambit Scheme – using the Termite library
  • Go (Golang)
  • Haskell – supports concurrent, distributed, and parallel programming across multiple machines
  • Java
  • Julia
  • Joule – dataflow language, communicates by message passing
  • LabVIEW
  • Limbo – relative of Alef, used for systems programming in Inferno (operating system)
  • MultiLisp – Scheme variant extended to support parallelism
  • OCaml
  • occam – influenced heavily by Communicating Sequential Processes (CSP)
  • Orc
  • Oz – multiparadigm language, supports shared-state and message-passing concurrency, and futures, and Mozart Programming System cross-platform Oz
  • P
  • Pict – essentially an executable implementation of Milner's π-calculus
  • Python – uses thread-based parallelism and process-based parallelism[2]
  • Rust
  • Scala – implements Erlang-style actors on the JVM
  • SequenceL – purely functional, automatically parallelizing and race-free
  • SR – research language
  • V (Vlang)
  • Unified Parallel C
  • XProc – XML processing language, enabling concurrency


Curly-bracket languages

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



Dataflow languages

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:



Data-oriented languages

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



Decision table languages

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 languages

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.



Embeddable languages

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

  • PHP
  • VBScript
  • Tcl – server-side in NaviServer and an essential component in electronics industry systems
  • WebDNA – dedicated to database-driven websites

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 side

In object code

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.



Educational programming languages

For a more comprehensive list, see List of educational programming languages.

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



Esoteric languages

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.



Extension languages

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


Fourth-generation languages

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



Functional languages

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:

Pure


Impure


Hardware description languages

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 design

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

HDLs for digital circuit design


Imperative languages

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



Interactive mode languages

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 loop (REPL).



Interpreted languages

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.



Iterative languages

Iterative languages are built around or offering generators.



Languages by memory management type

Garbage collected languages

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 page: Garbage collection (computer science)


Languages with manual memory management

Languages with partial manual memory management

  • eC normally uses reference counting to manage the memory largely automatically. However, the programmer must still deallocate memory themselves if it is allocated with the keyword new, using the keyword delete. Reference count increments and decrements are also left to the user.[5]

Languages with optional manual memory management

  • Ada implementations are not required to offer garbage collection, but the language semantics support it, and many implementations include it.
  • Blitz BASIC (also known as BlitzMax) is usually reference-counted,[6] and also supports a garbage collector. However, it also ships with optional utilities for using pointers[7] and for directly allocating and freeing memory.[8]
  • COBOL supports pointers[9] and heap allocation[10] as of COBOL 2002, along with a garbage collector.[11]
  • Cython provides optional manual memory management by letting the user import malloc, realloc, and free from C, which they can then use in Python code.[12]
  • D provides programmers with full control over its own garbage collector, including the ability to disable it outright.[13]
  • Nim is usually garbage-collected or reference-counted by default, depending on its configuration, but the programmer may use the switch --mm:none to deallocate memory manually.[14]
  • Objective-C and Objective-C++ support optional reference counting and garbage collection as alternatives to manual memory management (Apple deprecated the garbage collector).
  • PostScript originally required developers to manually reclaim memory using the save and restore operators. PostScript Level 2 introduced a garbage collector, but its usage is optional.[15]
  • Rust supports optional reference counting, but manual memory management is preferred.
  • Scala normally manages the memory automatically in its JVM and JavaScript targets. However, the LLVM-based Scala Native compiler supports the use of pointers, as well as C-style heap allocation (e.g. malloc, realloc, free) and stack allocation (stackalloc).[16]
  • Swift normally uses reference counting, but also allows the user to manually manage the memory using malloc and free. On Apple platforms, these functions are imported from the C standard library (which is imported from Foundation, AppKit or UIKit); on Linux, the developer needs to import Glibc, and ucrt on Windows.
  • V (Vlang) uses GC by default, for user convenience, which can be turned off (-gc none). Users are free to manage memory manually. Can also use autofree (-autofree) or arena allocation (-prealloc).
  • Vala uses reference counting by default, but the user is free to manage the memory manually if they wish.[17]

Languages with deterministic memory management

Languages with automatic reference counting (ARC)

List-based languages – LISPs

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

Little languages

Little languages[20] serve a specialized problem domain.

Logic-based languages

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:

  • ALF
  • Alma-0
  • Curry
  • Datalog
  • Fril
  • Flix (a functional programming language with first-class Datalog constraints)
  • Janus
  • λProlog (a logic programming language featuring polymorphic typing, modular programming, and higher-order programming)
  • Oz, and Mozart Programming System cross-platform Oz
  • Prolog (formulates data and the program evaluation mechanism as a special form of mathematical logic called Horn logic and a general proving mechanism called logical resolution)
  • ROOP
  • Soufflé

Machine languages

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.[lower-alpha 2] 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:



Macro languages

Textual substitution macro languages

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 languages

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 languages

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.



Multiparadigm languages

Main page: Comparison of multi-paradigm programming languages

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.


  • 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))
  • eC (generic, imperative, 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, Golang (imperative, procedural),
  • Groovy (functional, object-oriented (class-based), imperative, procedural)
  • Harbour
  • Hop
  • J (functional, imperative, object-oriented (class-based))
  • Julia (imperative, multiple dispatch ("object-oriented"), functional, metaprogramming)
  • LabVIEW (visual, dataflow, concurrent, modular, functional, object-oriented, scripting)
  • Lava (object-oriented (class-based), visual)
  • Lua (functional, imperative, object-oriented (prototype-based))
  • Mathematica (Wolfram language)
  • 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)
  • 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))


Numerical analysis

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.



Non-English-based languages

Main page: Non-English-based programming languages

Object-oriented class-based languages

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 dispatch


Single dispatch


Object-oriented prototype-based languages

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



Off-side rule languages

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



Procedural languages

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:



Query languages

Main page: Query language

Reflective languages

Reflective 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

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 needed]



Scripting languages

"Scripting language" 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 interpretive are often called scripting languages.

Recently, many applications have built-in traditional scripting languages, such as Perl or Visual Basic, 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 machine).



Stack-based languages

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



Synchronous languages

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 languages

See also: Category:Shading languages

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.


Offline rendering

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

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

System languages

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[23] 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 See C++ Applications[24]
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++ Multiple domains[25]
Nim Andreas Rumpf 2008 Ada, Modula-3, Lisp, C++, Object Pascal, Python, Oberon OS kernels, compilers, games
Rust Mozilla Research[26] 2010 C++, Haskell, Erlang, Ruby Servo layout engine, Redox OS
Swift Apple Inc. 2014 C, Objective-C, Rust macOS, iOS app development[lower-alpha 5]
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 languages

Main page: Transformation language

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.


Visual languages

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.



Wirth languages

Computer scientist Niklaus Wirth designed and implemented several influential languages.



XML-based languages

These are languages based on or that operate on XML.



See also

Notes

  1. ↑ The objects of SQL are collections of database records, called tables. A full programming language can specify algorithms, irrespective of runtime. Thus an algorithm can be considered to generate usable results. In contrast, SQL can only select records that are limited to the current collection, the data at hand in the system, rather than produce a statement of the correctness of the result.
  2. ↑ A notable exception would be the Soviet/Russian 1801 series CPU, which originally used their own domestic ISA, but were later redesigned to be PDP-11 compatible as a policy decision.
  3. ↑ 3.0 3.1 Submodels are not listed, only base models.
  4. ↑ The concept of object with the traditional single-dispatch OO semantics is not present in Julia, instead with the more general multiple dispatch on different types at runtime.
  5. ↑ Swift uses automatic reference counting.

References

  1. ↑ "Christopher Diggins: What is a concatenative language". Drdobbs.com. 2008-12-31. http://drdobbs.com/blogs/architecture-and-design/228701299. 
  2. ↑ Documentation » The Python Standard Library » Concurrent Execution
  3. ↑ 3.0 3.1 "Indentation based syntax · rsdn/nemerle Wiki". https://github.com/rsdn/nemerle/wiki/Indentation-based-syntax. 
  4. ↑ "Solidity: Solidity 0.8.11 documentation". https://docs.soliditylang.org/en/v0.8.11/. 
  5. ↑ "eC - Overview". https://ec-lang.org/overview/#memory. 
  6. ↑ "Memory Management · BlitzMax". https://blitzmax.org/docs/en/language/memory_management/. 
  7. ↑ "Pointers · BlitzMax". https://blitzmax.org/docs/en/language/pointers/. 
  8. ↑ "BRL.Blitz · BlitzMax". https://blitzmax.org/docs/en/api/brl/brl.blitz/. 
  9. ↑ "Using Pointers in an ILE COBOL Program - IBM Documentation". https://www.ibm.com/docs/en/i/7.3?topic=considerations-using-pointers-in-ile-cobol-program. 
  10. ↑ "HEAP - IBM Documentation". https://www.ibm.com/docs/en/zos/2.3.0?topic=options-heap. 
  11. ↑ "SOM-based OO COBOL language elements that are changed - IBM Documentation". https://www.ibm.com/docs/en/cobol-zos/6.1?topic=usbooocp-som-based-oo-cobol-language-elements-that-are-changed. 
  12. ↑ "Memory Allocation — Cython 3.0.0.dev0 documentation". https://cython.readthedocs.io/en/latest/src/tutorial/memory_allocation.html. 
  13. ↑ "Garbage Collection". https://dlang.org/spec/garbage.html. 
  14. ↑ "Nim's Memory Management". https://nim-lang.github.io/Nim/mm.html. 
  15. ↑ Adobe (February 1999). PostScript Language Reference, third edition. Addison-Wesley Publishing Company. pp. 56–65. https://www.adobe.com/jp/print/postscript/pdfs/PLRM.pdf. 
  16. ↑ "Native code interoperability – Scala Native 0.4.14 documentation". https://scala-native.org/en/stable/user/interop.html. 
  17. ↑ "Projects/Vala/ReferenceHandling - GNOME Wiki!". https://wiki.gnome.org/Projects/Vala/ReferenceHandling#Manual_memory_management_with_pointer_syntax. 
  18. ↑ "Understanding Ownership - The Rust Programming Language". https://doc.rust-lang.org/nightly/book/ch04-00-understanding-ownership.html. 
  19. ↑ "Smart Pointers - The Rust Programming Language". https://doc.rust-lang.org/nightly/book/second-edition/ch15-00-smart-pointers.html. 
  20. ↑ Jon Bentley (AT&T) August 1986 CACM 29 (8) "Little Languages", pp 711-721 from his Programming Pearls column
  21. ↑ "Procedural Macros for Generating Code from Attributes". https://doc.rust-lang.org/nightly/book/ch19-06-macros.html#procedural-macros-for-generating-code-from-attributes. 
  22. ↑ Scabia, Marco. "What is AGAL" (in en). Adobe. https://www.adobe.com/devnet/flashplayer/articles/what-is-agal.html. 
  23. ↑ Wulf, W.A.; Russell, D.B.; Haberman, A.N. (December 1971). "BLISS: A Language for Systems Programming". Communications of the ACM 14 (12): 780–790. doi:10.1145/362919.362936. 
  24. ↑ "C++ Applications". http://www.stroustrup.com/applications.html. 
  25. ↑ "Organizations using the D Language". https://dlang.org/orgs-using-d.html. 
  26. ↑ "Mozilla Research". 1 January 2014. https://www.mozilla.org/en-US/research/. 



Retrieved from "https://handwiki.org/wiki/index.php?title=List_of_programming_languages_by_type&oldid=3371484"

Categories: [Lists of programming languages] [Array programming languages]

↧ Download as ZWI file | Last modified: 07/13/2024 14:26:07 | 6 views
☰ Source: https://handwiki.org/wiki/List_of_programming_languages_by_type | License: CC BY-SA 3.0

✘
ZWI is not signed. [what is this?]

ZWI viewer by the EncyclosphereKSF