Categorical list of programming languages - Categorical list of programming languages This is a list of programming language grouped by category. See also Alphabetical list of programming languages Chronological list of programming languages Generational list of programming languages Assembly languages directly correspond to a machine language (see below) in order to allow machine code instructions to be written in a form understandable by humans. Assembly languages allow programmers to use symbolic addresses which are later converted to absolute addresses by the assembler. Most assemblers also allow for macros and symbolic constants as well. SSK (Sistema Simvolicheskogo Kodirovaniya, or "System of symbolic coding") for Minsk family of computers. AKI (AvtoKod Ingenera, i.e., "engineer's autocode") for Minsk family of computers was half-step away from assembly languages and doesn't really fit into any other categories.
Generational list of programming languages - Generational list of programming languages Alphabetical list of programming languages Categorical list of programming languages Chronological list of programming languages See: Programming language Atlas Autocode Algol Algol60 Algol68 AlgolW Pascal Ada Delphi Euclid Concurrent Euclid Turing Concurrent Turing Turing Plus Object Oriented Turing Modula-2 Modula-3 programming language Oberon programming language Oberon 2 programming language Component Pascal APL J Assembly BASIC Cache BASIC BASIC09 COMAL Quickbasic TrueBASIC VBScript Visual Basic CPL programming language BCPL B C D programming language Coyote programming language Pike programming language C++ C# CFM Objective C QuakeC COBOL DIBOL WATBOL CORAL FORTH FORTRAN FORTRAN II FORTRAN 66 FORTRAN 77 FORTRAN IV RATFOR WATFOR WATFIV ECMAScript (JavaScript; originally, LiveScript) Java J# Joy Lisp AutoLISP Common Lisp Emacs Lisp Logo Scheme Pico Guile ML Ocaml (Objective.
List of programming languages - List of programming languages A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 0 to 9 2.PAK A A+ A++ ABAP ABC programming language ABLE ABSET ABSYS Accent Acceptance, Test Or Launch Language ACS Ada ADL Alan Aleph Algol AmigaE APL AppleScript AREXX ARS++ AspectJ Assembly Atlas Autocode Autocoder AutoLISP AWK B B BASIC BCPL Befunge BETA Bigwig Bistro programming language BLISS Blue Bourne shell (sh) Bourne-Again shell (bash) Brainfuck BUGSYS BuildProfessional C C C++ C# Caché Basic Caché ObjectScript Caml Ceicil Cg CHILL Clarion Clipper Clos CLU CMS-2 Cold Fusion COBOL CobolScript Cocoa programming language COMAL Concurrent Clean CORAL66 Common Lisp CPL Curl D D dBASE II Delphi.
Timeline of programming languages - Timeline of programming languages This is a chronological list of programming languages. See also Alphabetical list, Categorical list, and Generational list; Programming language, Computing timeline, and History of computing hardware. Table of contents showTocToggle("show","hide") 1 pre 1950 2 1950 3 1960 4 1970 5 1980 6 1990 7 2000 pre 1950 Predecessor(s) YEAR PRODUCT -- Developer, Company * 1840~ FIRST PROGRAM -- Lovelace * 1945 Plankalkül -- Zuse 1950 * 1952 A-0 -- Hopper 1954 Mark I Autocode -- Brooker A-0 1954 ARITH-MATIC -- Hopper A-0 1955 MATH-MATIC -- Hopper A-0 1955 FLOW-MATIC -- Hopper A-0 1955 FORTRAN -- Backus 1956 Information Processing Language -- Newell, Shaw, Simon FLOW-MATIC 1957 COMTRAN -- Bemer FORTRAN 1958 FORTRAN II -- Backus FORTRAN 1958 Algol 58 * 1959 LISP McCarthy.
Programming language - Programming language User:K.lee/Programming_language_rewrite has been proposed. Please council it when you plan to rewrite the article entirely. A programming language or computer language is a standardized communication technique for expressing instructions to a computer. It is a set of syntactic and semantic rules used to define computer programs. A language enables a programmer to precisely specify what data a computer will act upon, how these data will be stored/transmitted, and precisely what actions to take under various circumstances. Table of contents showTocToggle("show","hide") 1 Introduction 2 Features of a Programming Language 2.1 Data and Data Structures 2.2 Instruction and Control Flow 2.3 Reference Mechanisms and Re-use 2.4 Design Philosophies 3 History of programming languages 4 Classes of programming languages 5 Languages 6 Formal semantics 7 See also.
List of reference tables - List of reference tables You usually find a collection of reference tables in the back of almanacs, dictionaries and encyclopedias (or an index of them, if they're scattered throughout the work). As these tables appear, please add them to this index. What we have in mind is listings or tabular information for quick reference, not narrative articles. Alternate versions: For an alphabetical listing: Special:Allpages/List of (cont. 1 2 3 4 5 6) By type: List of glossaries (glossaries are also included in this list) Lists of articles by category (also included here) List of themed timelines (also included in this list) List of trivia lists (also included here) List of countries (general lists by country not included here) Lists of people (not included here) Table of.
List of science topics - List of science topics Table of contents showTocToggle("show","hide") 1 Astronomy 2 Biology 3 Chemistry 4 Computer Science 5 Ecology 6 Geography 7 Geology 8 Linguistics 9 Physics 10 Psychology 11 Sociology 12 Zoology Astronomy List of astronomical topics Asteroids List of constellations ...by area List of meteor showers List of stars List of nearest stars List of brightest stars List of mnemonics for star classification List of semiregular variable stars List of telescope types Moons of the solar system Timeline of astronomical maps, catalogs, and surveys Timeline of cosmic microwave background astronomy Timeline of cosmology Timeline of galaxies, clusters of galaxies, and large-scale structure Timeline of planetary exploration Timeline of solar astronomy Timeline of solar system astronomy Timeline of stellar astronomy Timeline of telescopes, observatories, and.
Low-level programming language - Low-level programming language Definition In computer science, a low-level programming language is a language that provides little or no abstraction from a computer's microprocessor. It does not imply that the language ranks lower in any sense than a high-level language. Low-level programming languages fall into two categories: first generation, and second generation. First-Generation The first-generation programming language, or 1GL, is machine code. It is the only language a microprocessor can understand natively. Machine code cannot be written or read using a text editor, and therefore it is rarely used by a person directly. Second-Generation The second-generation programming language, or 2GL, is Assembly Language. It is considered a second-generation language because while it is not a microprocessor's native language, an assembly language programmer must still understand the microprocessor's unique.
List of esoteric programming languages - List of esoteric programming languages The following is a list of esoteric programming languages and lesser-known programming languages: 23 4DL, a Befunge descendant ACS, a scripting language used in Hexen and modern Doom ports ADL, the Adventure Definition Language ADVSYS AKI (AvtoKod Ingenera, "engineer's autocode") for Minsk family of computers Ale ALPACA, a meta-language for programming arbitrary cellular automata ARCAL, a language for cellular automata Aura, a Brainfuck descendant B B5 BAK BANCStar BCPL BDAMD Beatnik Befunge beta-Juliet BFM, a Brainfuck variant with macros Blank Bloop Bon programming language Boo-yah Borg Brainfuck, designed to have the smallest compiler ever Bub, a Brainfuck variant Bubble Bullfrog C- Chef Choon COBOLscript Color Forth COMAL Condit COW CUPL Dis, a variant of Malbolge Doublefuck, an extended version of Brainfuck.
Formal semantics of programming languages - Formal semantics of programming languages In theoretical computer science formal semantics is the field concerned with the rigorous mathematical study of the meaning of programming languages and models of computation. The formal semantics of a language is given by a mathematical model to represent the possible computations described by the language. There are several approaches to formal semantics. These include: Denotational semantics Operational semantics Axiomatic semantics Categorical semantics (also called Functorial semantics) The field of formal semantics also studies the relations between different models, the relations between different approaches to meaning, and the relation between computation and the underlying mathematical structures, from fields such as logic, set theory, model theory, category theory, etc. It has close links with other areas of computer science such as the design of.
List of languages - List of languages This list of languages is alphabetical by English name. For a more structured list, see Language families and languages, ISO 639 or List of languages by total speakers. Ethnologue lists about 6,800 main languages in its language name index (see the external link) and distinguishs about 41,000 alternate language names and dialects. This is a list of natural and constructed languages spoken by humans. See also a list of programming languages. A B C D E F G H I J K L M N O P Q R S T U V W X Y Z A Afrikaans Ainu Albanian Aleut Algonquin Amhara Amharic Anglo-Saxon Apache A-Pucikwar Arabic / عربية (Semitic) Aragonese Aramaic Arawak Armenian Assamese Assyrian Asturian Avestan Azerbaijani B Balochi.
Hierarchy (object-oriented programming) - Hierarchy (object-oriented programming) In computer science's object-oriented programming, the mapped relationships of sub- and superclasses is known as a hierarchy. This can be visualized as an upside-down tree (or perhaps a pyramid), the top of which is known as the root. The issue is more complicated with languages that support multiple inheritance, where hierarchy can be any graph. Hierarchy in Java The root of the java class hierarchy is the object class. See also: family tree, hierarchy List of basic computer science topics.
Esoteric programming language - Esoteric programming language Esoteric programming languages are programming languages which are designed as a proof of concept, or as jokes, and not with the intention of being adopted for real-world programming. Consequently, usability is rarely a high priority for such languages. The usual aim is to remove or replace conventional language features while still maintaining a language that is Turing-complete. The earliest esoteric language was Intercal, designed in 1972 with the stated aim of being as fundamentally unlike any existing language as possible. Other noteworthy esoteric languages are (for a more complete list, see List of esoteric programming languages): Brainfuck, a Turing tarpit consisting of only eight instructions Unlambda, an even more minimal language based on the functional programming paradigm Befunge, in which programs are arranged on.
Declarative programming - Declarative programming Declarative programming is an approach to computer programming that takes a different approach from traditional imperative programming in Fortran, C++ or Java. Whereas imperative programming gives the computer a list of instructions to execute in a particular order, declarative programming describes to the computer a set of conditions and lets the computer figure out how to satisfy them. Declarative programming includes both functional programming and logic programming. Declarative languages describe relationships between variables in terms of functions or inference rules. The language executor (an interpreter or compiler) applies a fixed algorithm to these relations to produce a result. Examples of declarative programming languages include Miranda, Prolog and SQL. Declarative programming languages are extensively used in solving artificial intelligence and constraint-satisfaction problems. See also: 4GL, constraint.
Template (programming) - Template (programming) In computer programming, templates allow code to be written without consideration of the data-type with which it will eventually be used. They are a feature of C++, Ada and some other languages. Templates are similar to macros, in that they are interpreted by the preprocessor and don't reduce efficiency. However templates are type-safe, which encourages the writing of error free code. Templates were left out of some C++ derived languages, such as Java and C#, because these languages have other methods of dealing with the same problems. However templates are of great utility to programmers in C++, especially when combined with multiple inheritance and operator overloading. The Standard Template Library (STL) for C++ provides many useful functions within a framework of connected templates. There are.
APL programming language - APL programming language APL (for A Programming Language, or sometimes Array Processing Language) is a programming language invented in 1962 by Kenneth E. Iverson while at Harvard University. Iverson received the Turing Award in 1979 for his work. "APL, in which you can write a program to simulate shuffling a deck of cards and then dealing them out to several players in four characters, none of which appear on a standard keyboard." — David Given Within its chosen domain, APL is an extremely powerful, expressive and concise programming language. It was originally created as a way to express mathematical notation in a rigorous way that could be interpreted by a computer. It is easy to learn but APL programs can take some time to understand. Unlike traditional.
Scheme programming language - Scheme programming language The Scheme programming language is a functional programming language and a dialect of Lisp. It was developed by Guy L. Steele and Gerald Jay Sussman in the 1970s and introduced to the academic world via a series of papers now referred to as Sussman and Steele's Lambda Papers. Scheme's philosophy is unashamedly minimalist. Its goal is not to pile feature upon feature, but to remove weaknesses and restrictions that make new features appear necessary. Therefore, Scheme provides as few primitive notions as possible, and lets everything else be implemented on top of them. For example, the main mechanism for governing control flow is tail recursion. Scheme was the first variety of Lisp to use lexical variable scoping (as opposed to dynamic variable scoping) exclusively..
Strict programming language - Strict programming language A strict programming language is one in which only strict functions may be defined by the user. A non-strict programming language is one which is not strict, and hence may allow lazy evaluation. Nearly all programming languages in common use today are strict. Examples include C, C++, Java, Perl, Python, Ruby, Common Lisp, Scheme, and ML. The best known non-strict languages are Haskell, Miranda, and Clean. In most non-strict languages the non-strictness extends to data constructors. This allows conceptually infinite data structures (such as the list of all prime numbers) to be manipulated in the same way as ordinary finite data structures. It also allows for the use of very large but finite data structures such as the complete game tree of chess. A.
Q programming language - Q programming language Q (which stands for equational programming language) is an interpreted, interactive functional programming language created by Albert Gräf at the University of Mainz in Germany. Q programs are just collections of equations which are used to evaluate expressions in a symbolic fashion. Q has many similarities with other modern functional programming languages like Haskell and ML, but is based on general term rewriting (a method of computation also used in computer algebra systems) instead of the lambda calculus. Despite its conceptual simplicity, Q is a full-featured functional programming language with a modern syntax, currying, dynamic typing using an object-oriented type system, exception handling, POSIX multithreading, a comprehensive standard library, and an interface to the C programming language. Q is an impure functional language.
PHP programming language - PHP programming language For the "PHP" Cold-war history project, see Parallel History Project. PHP (now a recursive acronym for "PHP Hypertext Preprocessor", but originally "Personal Home Page Tools") is a widely used open-source programming language used primarily for server-side applications, to develop dynamic web content such as the MediaWiki software. It can be seen as an open source alternative to Microsoft's Active Server Pages (ASP) system and to the CGI/Perl system. Its ease of use and similarity with the most common structured programming languages, most notably C and Perl, allows most experienced programmers to start developing complex applications with a minimal learning curve. It also enables experienced developers to get involved with dynamic web content applications without having to learn a whole new set of functions and.
