new files
This commit is contained in:
Ingy döt Net
parent
3af7344581
commit
86c034bb8b
|
|
@ -0,0 +1,9 @@
|
|||
{{language|0815}}
|
||||
'''0815''' is an esoteric programming language designed and implemented between December 2012 and January 2013 by [[Paulo Jorente]]
|
||||
|
||||
|
||||
==See also==
|
||||
* [http://esolangs.org/wiki/0815 0815 Esolangs] – 0815 on Esolangs
|
||||
* [http://pjorente.pj.funpic.de/poncho/esolang/ 0815 page] – features specs, programs and an interpreter.
|
||||
|
||||
[[Category:Esoteric_Languages]]
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/99-Bottles-of-Beer/0815
|
||||
|
|
@ -0,0 +1,2 @@
|
|||
{{stub}}{{language}}
|
||||
[[Category:Assembly]]
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Comments/360-Assembly
|
||||
|
|
@ -0,0 +1,8 @@
|
|||
{{language|A+
|
||||
|site=http://www.aplusdev.org/
|
||||
}}
|
||||
|
||||
A+ is an array programming language, which is derived from the programming language [[derived from::A]], a dialect of [[APL]] with aggressive extensions. Arthur Whitney developed the "A" portion of A+, while other developers at Morgan Stanley extended it, adding a graphical user interface and other language features. A+ was designed for numerically intensive applications, especially those found in financial applications. A+ runs on many Unix variants, including Linux. A+ is a high-level, interactive, interpreted language.[[#Citation|[1]]]
|
||||
|
||||
==Citations==
|
||||
#[[wp:A%2B_(programming_language)|Wikipedia A+]]
|
||||
|
|
@ -0,0 +1,2 @@
|
|||
{{stub}}{{language|site=http://www.sdn.sap.com/irj/sdn/abap}}
|
||||
ABAP (Advanced Business Application Programming) is a programming language developed by the german software vendor SAP. It is mainly used to build high performance business applications.
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/99-Bottles-of-Beer/ABAP
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Ackermann-function/ABAP
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Anagrams/ABAP
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Detect-division-by-zero/ABAP
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Quine/ABAP
|
||||
|
|
@ -0,0 +1,10 @@
|
|||
{{stub}}
|
||||
{{language
|
||||
|site=http://userweb.cs.utexas.edu/users/moore/acl2/
|
||||
|strength=strong
|
||||
|safety=unsafe
|
||||
|checking=dynamic
|
||||
|gc=yes
|
||||
|LCT=yes}}
|
||||
{{language programming paradigm|Functional}}
|
||||
ACL2 is both a programming language in which you can model computer systems and a tool to help you prove properties of those models.
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/99-Bottles-of-Beer/ACL2
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Arrays/ACL2
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Binary-search/ACL2
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Comments/ACL2
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/FizzBuzz/ACL2
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Knuth-shuffle/ACL2
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Quine/ACL2
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Search-a-list/ACL2
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/99-Bottles-of-Beer/AWK
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Ackermann-function/AWK
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Balanced-brackets/AWK
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Best-shuffle/AWK
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Binary-search/AWK
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Caesar-cipher/AWK
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Delete-a-file/AWK
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Determine-if-a-string-is-numeric/AWK
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Knuth-shuffle/AWK
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Ordered-words/AWK
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Search-a-list/AWK
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/99-Bottles-of-Beer/ActionScript
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Ackermann-function/ActionScript
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Determine-if-a-string-is-numeric/ActionScript
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Search-a-list/ActionScript
|
||||
|
|
@ -0,0 +1,20 @@
|
|||
{{language|Ada
|
||||
|exec=machine
|
||||
|gc=allowed
|
||||
|parampass=both
|
||||
|checking=static
|
||||
|compat=nominative
|
||||
|express=explicit
|
||||
|strength=strong
|
||||
|safety=safe
|
||||
|LCT=yes
|
||||
|bnf=http://www.adaic.org/standards/1zrm/html/RM-P.html}}'''Ada''' is a structured, statically typed [[imperative programming|imperative]] computer programming language. Ada was initially standardized by [[ANSI]] in 1983 and by [[ISO]] in 1987. This version of the language is commonly known as [[Ada 83]]. The next version was standardized by ISO in 1995 (ISO/IEC 8652:1995) and is commonly known as [[Ada 95]]. Following that ISO published ISO/IEC 8652:1995/Amd 1:2007 in 2007, which is commonly known as [[Ada 2005]]. Most recently ISO published [http://www.ada-auth.org/standards/12rm/html/RM-TTL.html ISO/IEC 8652:2012(E)], commonly known as [[Ada 2012]]. Formally only the most recent version of the language is known as '''Ada'''.
|
||||
|
||||
The language is named after [[wp:Ada_Lovelace|Augusta Ada King, Countess of Lovelace]] thought to be the first ever programmer. Initially it was designed for [http://www.defense.gov U.S. Department of Defense]. The language is used for large and mission-critical systems. See [[wp:Ada_(programming_language)|also]].
|
||||
==Grammar==
|
||||
* [[wp:Van Wijngaarden grammar|W-Grammar]] Description for Ada. Air Force Inst. of Tech., Wright-Patterson [http://www.ntis.gov/search/product.aspx?ABBR=ADA177802 - Master's thesis]
|
||||
{{Language programming paradigm|Concurrent}}
|
||||
{{Language programming paradigm|Distributed}}
|
||||
{{Language programming paradigm|Generic}}
|
||||
{{Language programming paradigm|Imperative}}
|
||||
{{Language programming paradigm|Object-oriented}}
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/99-Bottles-of-Beer/Ada
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Ackermann-function/Ada
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Anagrams/Ada
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Arrays/Ada
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Assertions/Ada
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Balanced-brackets/Ada
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Balanced-ternary/Ada
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Best-shuffle/Ada
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Binary-search/Ada
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Binary-strings/Ada
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Bulls-and-cows/Ada
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Caesar-cipher/Ada
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Calendar/Ada
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Check-that-file-exists/Ada
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Checkpoint-synchronization/Ada
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Classes/Ada
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Closest-pair-problem/Ada
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Collections/Ada
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Comments/Ada
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Define-a-primitive-data-type/Ada
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Delegates/Ada
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Delete-a-file/Ada
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Detect-division-by-zero/Ada
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Determine-if-a-string-is-numeric/Ada
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Entropy/Ada
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/FizzBuzz/Ada
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Forest-fire/Ada
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Infinity/Ada
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/JSON/Ada
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Knuth-shuffle/Ada
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Narcissist/Ada
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Ordered-words/Ada
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Pi/Ada
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Quine/Ada
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Search-a-list/Ada
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/99-Bottles-of-Beer/BASIC
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Ackermann-function/BASIC
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Balanced-brackets/BASIC
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Binary-search/BASIC
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Binary-strings/BASIC
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Bulls-and-cows/BASIC
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Check-that-file-exists/BASIC
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Color-of-a-screen-pixel/BASIC
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Delete-a-file/BASIC
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Determine-if-a-string-is-numeric/BASIC
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Knuth-shuffle/BASIC
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Search-a-list/BASIC
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/99-Bottles-of-Beer/Babel
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Ackermann-function/Babel
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/99-Bottles-of-Beer/Befunge
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Ackermann-function/Befunge
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Balanced-brackets/Befunge
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/99-Bottles-of-Beer/C
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Ackermann-function/C
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Balanced-brackets/C
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Best-shuffle/C
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Binary-search/C
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Binary-strings/C
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Bulls-and-cows/C
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Caesar-cipher/C
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Check-that-file-exists/C
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Checkpoint-synchronization/C
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Color-of-a-screen-pixel/C
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Death-Star/C
|
||||
Some files were not shown because too many files have changed in this diff Show More
Loading…
Reference in New Issue