Category:Ada: Difference between revisions
Content added Content deleted
(Categorized according to Language Comparison Table.) |
(Using templates for language feature categorization, to help prevent typos and silly mistakes.) |
||
| Line 3: | Line 3: | ||
The language is named after [http://en.wikipedia.org/wiki/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 [http://en.wikipedia.org/wiki/Ada_(programming_language) also]. |
The language is named after [http://en.wikipedia.org/wiki/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 [http://en.wikipedia.org/wiki/Ada_(programming_language) also]. |
||
{{Language programming paradigm|Concurrent}} |
|||
[[Category:Programming paradigm/Concurrent programming]][[Category:Programming paradigm/Distributed programming]][[Category:Programming paradigm/Generic programming]][[Category:Programming paradigm/Imperative programming]][[Category:Programming paradigm/Object-oriented programming]][[Category:Typing/Strong]][[Category:Typing/Safe]][[Category:Typing/Expression/Explicit]][[Category:Typing/Nominative]][[Category:Typing/Checking/Static]][[Category:Parameter passing/By value]][[Category:Parameter passing/By reference]][[Category:Garbage collection/Allowed]] |
|||
{{Language programming paradigm|Distributed}} |
|||
{{Language programming paradigm|Generic}} |
|||
{{Language programming paradigm|Imperative}} |
|||
{{Language programming paradigm|Object-oriented}} |
|||
{{Language typing|Strong}} |
|||
{{Language typing|Safe}} |
|||
{{Language type expression|Explicit}} |
|||
{{Language type compatibility|Nominative}} |
|||
{{Language type checking|Static}} |
|||
{{Language parameter passing|By value}} |
|||
{{Language parameter passing|By reference}} |
|||
{{Language garbage collection|Allowed}} |
|||
Revision as of 09:03, 15 February 2009
This programming language may be used to instruct a computer to perform a task.
| See Also: |
|
|---|
Ada is a structured, statically typed imperative computer programming language initially standardized by ANSI in 1983 and by ISO in 1987. It is called as Ada 83. The next version, known as Ada 95, was standardized by ISO 1n 1995 (ISO/IEC 8652:1995). The newest version of the standard was published in March, 2007. That version is officially called ISO/IEC 8652:1995/Amd 1:2007. This version is officially still the 1995 version with an amendment in 2007. It is known as Ada 2005.
The language is named after Augusta Ada King, Countess of Lovelace thought to be the first ever programmer. Initially it was designed for U.S. Department of Defense. The language is used for large and mission-critical systems. See also.
Template:Language typing Template:Language typing
Template:Language type compatibility Template:Language type checking Template:Language parameter passing Template:Language parameter passing Template:Language garbage collection
Subcategories
This category has the following 3 subcategories, out of 3 total.
@
- Ada examples needing attention (empty)
- Ada Implementations (7 P)
A
- Ada Versions (5 P)
Pages in category "Ada"
The following 200 pages are in this category, out of 946 total.
(previous page) (next page)A
- A+B
- Abbreviations, automatic
- Abbreviations, easy
- Abbreviations, simple
- ABC problem
- ABC words
- Abelian sandpile model/Identity
- Abstract type
- Abundant odd numbers
- Abundant, deficient and perfect number classifications
- Accumulator factory
- Ackermann function
- Active object
- Add a variable to a class instance at runtime
- Additive primes
- Address of a variable
- Air mass
- AKS test for primes
- Align columns
- Almost prime
- Alternade words
- Amb
- Amicable pairs
- Anadromes
- Anagrams
- Anagrams/Deranged anagrams
- Angle difference between two bearings
- Animate a pendulum
- Animation
- Anonymous recursion
- Anti-primes
- Append a record to the end of a text file
- Append numbers at same position in strings
- Apply a callback to an array
- Apply a digital filter (direct form II transposed)
- Approximate equality
- Arbitrary-precision integers (included)
- Archimedean spiral
- Arena storage pool
- Arithmetic evaluation
- Arithmetic numbers
- Arithmetic-geometric mean
- Arithmetic-geometric mean/Calculate Pi
- Arithmetic/Complex
- Arithmetic/Integer
- Arithmetic/Rational
- Array concatenation
- Array length
- Arrays
- Aspect oriented programming
- Assertions
- Assertions in design by contract
- Associative array/Creation
- Associative array/Iteration
- Associative array/Merging
- Atomic updates
- Attractive numbers
- Average loop length
- Averages/Arithmetic mean
- Averages/Mean angle
- Averages/Mean time of day
- Averages/Median
- Averages/Mode
- Averages/Pythagorean means
- Averages/Root mean square
- Averages/Simple moving average
- AVL tree
B
- Babbage problem
- Bacon cipher
- Balanced brackets
- Balanced ternary
- Barnsley fern
- Base 16 numbers needing a to f
- Base64 decode data
- Base64 encode data
- Bell numbers
- Benford's law
- Bernoulli numbers
- Best shuffle
- Bifid cipher
- Bin given limits
- Binary digits
- Binary search
- Binary strings
- Bioinformatics/base count
- Bioinformatics/Sequence mutation
- Bioinformatics/Subsequence
- Birthday problem
- Bitcoin/address validation
- Bitmap
- Bitmap/Bresenham's line algorithm
- Bitmap/Bézier curves/Cubic
- Bitmap/Bézier curves/Quadratic
- Bitmap/Flood fill
- Bitmap/Histogram
- Bitmap/Midpoint circle algorithm
- Bitmap/Read a PPM file
- Bitmap/Write a PPM file
- Bitwise IO
- Bitwise operations
- Boolean values
- Box the compass
- Break OO privacy
- Brownian tree
- Bulls and cows
- Bulls and cows/Player
- Bézier curves/Intersections
C
- Caesar cipher
- Calculating the value of e
- Calendar
- Calendar - for "REAL" programmers
- Call a foreign-language function
- Call a function
- Call a function in a shared library
- Call an object method
- Cantor set
- Carmichael 3 strong pseudoprimes
- Cartesian product of two or more lists
- Case-sensitivity of identifiers
- Catalan numbers
- Catalan numbers/Pascal's triangle
- Catamorphism
- Change e letters to i in words
- Changeable words
- Chaocipher
- Character codes
- Chat server
- Check input device is a terminal
- Check output device is a terminal
- Check that file exists
- Checkpoint synchronization
- Cheryl's birthday
- Chinese remainder theorem
- Chinese zodiac
- Cholesky decomposition
- Chowla numbers
- Classes
- Closest-pair problem
- Closures/Value capture
- Code Golf: Code Golf
- Collections
- Colour bars/Display
- Colour pinstripe/Display
- Colour pinstripe/Printer
- Combinations
- Combinations with repetitions
- Comma quibbling
- Command-line arguments
- Comments
- Common list elements
- Common sorted list
- Compare a list of strings
- Compare length of two strings
- Compile-time calculation
- Compiler/lexical analyzer
- Compiler/virtual machine interpreter
- Compound data type
- Concatenate two primes is also prime
- Concurrent computing
- Conditional structures
- Conjugate transpose
- Constrained genericity
- Constrained random points on a circle
- Continued fraction
- Continued fraction/Arithmetic/Construct from rational number
- Continued fraction/Arithmetic/G(matrix ng, continued fraction n)
- Continued fraction/Arithmetic/G(matrix ng, continued fraction n1, continued fraction n2)
- Convert decimal number to rational
- Convert seconds to compound duration
- Convex hull
- Conway's Game of Life
- Copy a string
- Copy stdin to stdout
- Count how many vowels and consonants occur in a string
- Count in factors
- Count in octal
- Count occurrences of a substring
- Count the coins
- Cousin primes
- Cramer's rule
- CRC-32
- Create a file
- Create a two-dimensional array at runtime
- Create an HTML table
- Create an object at a given address
- CSV data manipulation
- CSV to HTML translation
- Cumulative standard deviation
- Currency
- Currying