GeezerVisonThe World Wide Web, restored to 800 pixels of glory. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Home|About|Gaming cabinet|Archives|How it works|Starter sites | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
GeezerVison is showing en.wikipedia.org — List of programming languages by type - Wikipedia (Redirected from Curly bracket programming language)
The notable programming languages listed here are grouped by their notable language attribute. As a language can have multiple attributes, the same language can appear in multiple groupings. Agent-oriented programming languagesMain article: 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. Array languagesMain category: Array programming languages
Array programming (also termed vector or multidimensional) languages generalize operations on scalars to apply transparently to vectors, matrices, and higher-dimensional arrays. Aspect-oriented programming languagesMain article: Aspect-oriented programming
Aspect-oriented programming enables developers to add new functions to code, known as advice, without modifying that code. Instead, it uses a pointcut to implement the advice into code blocks. Assembly languagesMain article: Assembly language
For a more comprehensive list, see Comparison of assemblers.
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 languagesMain article: Authoring language
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 languagesMain article: Command-line interface
Command-line interface (CLI) languages are also called batch languages or job control languages. Examples:
Compiled languagesMain article: Compiled language
These are languages typically processed by compilers, though theoretically any language can be compiled or interpreted.
Concatenative programming languagesMain article: 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. Concurrent languagesMain category: Concurrent programming 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.
Constraint programming languagesMain article: 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. Contract languagesDesign by contract (or contract programming) is programming using defined preconditions, postconditions, and invariants.
Curly bracket languagesA curly bracket or curly brace language has syntax that defines a block as the statements between curly brackets, a.k.a. braces,
Dataflow languagesDataflow programming languages rely on a (usually visual) representation of the flow of data to specify the program. Often used to react to discrete events or to process streams of data. Dataflow languages include: Data-oriented languagesData-oriented languages provide powerful ways to search and manipulate the relations that have been described as entity relationship tables, which map one set of things into other sets. Data-oriented languages include: Decision table languagesDecision 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 languagesMain category: Declarative programming 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 languagesIn source codeSource 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 (for instance, by being made into Apache modules). Client side
In object codeA 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 languagesFor a more comprehensive list, see List of educational programming languages.
Languages developed primarily for the purpose of teaching and learning of programming. Esoteric languagesMain category: Esoteric programming 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 languagesExtension programming languages are languages embedded into another program and used to harness its features in extension scripts.
Fourth-generation languagesMain category: Fourth-generation programming languages
Fourth-generation programming languages are high-level programming languages built around database systems. They are generally used in commercial environments.
Functional languagesMain category: 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: PureImpure
Hardware description languagesFor a more comprehensive list, see List of 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
HDLs for digital circuit designImperative languagesImperative 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 languagesKnown 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.
Interpreted languagesInterpreted 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 languagesIterative languages are built around or offering generators. Languages by memory management typeGarbage collected languagesGarbage 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)
Languages with manual memory management
Languages with optional manual memory management
Some programming languages without the inherent ability to manually manage memory, like Cython,[32] Swift,[e] and Scala[33] (Scala Native only), are able to import or call functions like The Java programming language used to offer some degree of manual memory allocation through the internal sun.misc.Unsafe class. However, this class is now deprecated and will eventually be removed.[34][35] Languages with deterministic memory management
Languages with automatic reference counting (ARC)
List-based languages – LISPsList-based languages are a type of data-structured language that are based on the list data structure. Little languagesLittle languages[38] serve a specialized problem domain.
Logic-based languagesMain category: Logic programming 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:
Machine languagesMachine 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.[g] 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 languagesMain category: Macro programming languages
Textual substitution macro languagesMacro 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
Application macro languagesScripting 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 languagesMetaprogramming 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. Modular languagesModular programming is a programming paradigm of organising functions and symbols into independent modules.
Multiparadigm languagesMain article: 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.
Numerical analysisSeveral 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 languagesMain article: Non-English-based programming languages
Object-oriented class-based languagesClass-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). Single dispatch
Object-oriented prototype-based languagesPrototype-based languages are object-oriented languages where the distinction between classes and instances has been removed:
Off-side rule languagesMain article: Off-side rule § Off-side rule languages
Off-side rule languages denote blocks of code by their indentation. Procedural languagesProcedural 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 languagesMain article: Query language
Reflective languagesReflective 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: See also: Aspect-oriented programming
Rule-based languagesRule-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: Scripting languagesMain article: Scripting language
Stack-based languagesMain category: Stack-oriented programming languages
Stack-based languages are a type of data-structured language that are based on the stack data structure. Synchronous languagesMain category: Synchronous programming 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 languagesSee 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 renderingThey 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 renderingShading 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 languagesThese languages assist with generating lexical analyzers and parsers for context-free grammars. System languagesA 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:
Transformation languagesMain article: 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 languagesMain category: Visual programming 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 languagesComputer scientist Niklaus Wirth designed and implemented several influential languages.
XML-based languagesThese are languages based on or that operate on XML.
Large language model programming languagesLarge language model programming languages are programming languages and domain-specific languages designed for programming interactions with large language models. See alsoNotes
References
Hidden categories:
| |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| You are visitor 01402503 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |
![[icon]](/view?url=https%3A%2F%2Fen.wikipedia.org%2Fwiki%2FFile%3AWiki_letter_w_cropped.svg){kind=small}