Category:Pascal: Difference between revisions
Content added Content deleted
(Added Programming Language template) |
m (Added a comment about language's use in discrete mathematics.) |
||
Line 1: | Line 1: | ||
{{Programming Language}}'''Pascal''' is an imperative computer programming language, developed in 1970 by Niklaus Wirth as a language particularly suitable for structured programming. A derivative known as [[Object Pascal]] was designed for [[object-oriented language|object oriented programming]]. |
{{Programming Language}}'''Pascal''' is an imperative computer programming language, developed in 1970 by Niklaus Wirth as a language particularly suitable for structured programming. A derivative known as [[Object Pascal]] was designed for [[object-oriented language|object oriented programming]]. Pascal can be used very easily in conjunction with fundamental [http://en.wikipedia.org/wiki/Discrete_mathematics discrete mathematics] as sets are built into the language. |
||
==Citations== |
==Citations== |
Revision as of 04:28, 8 November 2007
Programming Language
This is a programming language. It may be used to instruct computers to accomplish a variety of tasks which may or may not be domain-specific.
Pascal is an imperative computer programming language, developed in 1970 by Niklaus Wirth as a language particularly suitable for structured programming. A derivative known as Object Pascal was designed for object oriented programming. Pascal can be used very easily in conjunction with fundamental discrete mathematics as sets are built into the language.
Citations
Subcategories
This category has the following 4 subcategories, out of 4 total.
@
- Pascal examples needing attention (empty)
- Pascal User (139 P)
P
Pages in category "Pascal"
The following 200 pages are in this category, out of 707 total.
(previous page) (next page)A
- A+B
- Abbreviations, easy
- ABC problem
- ABC words
- Abelian sandpile model
- Abstract type
- Abundant odd numbers
- Abundant, deficient and perfect number classifications
- Ackermann function
- Add a variable to a class instance at runtime
- Additive primes
- Address of a variable
- AKS test for primes
- Align columns
- Almost prime
- Amicable pairs
- Anagrams
- Anagrams/Deranged anagrams
- Anaprimes
- Angle difference between two bearings
- 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
- Approximate equality
- Arbitrary-precision integers (included)
- Arena storage pool
- Arithmetic evaluation
- Arithmetic numbers
- Arithmetic-geometric mean
- Arithmetic-geometric mean/Calculate Pi
- Arithmetic/Complex
- Arithmetic/Integer
- Array concatenation
- Array length
- Arrays
- Ascending primes
- Assertions
- Attractive numbers
- Averages/Arithmetic mean
- Averages/Mean angle
- Averages/Median
- Averages/Pythagorean means
- Averages/Root mean square
- Averages/Simple moving average
B
- Babbage problem
- Balanced brackets
- Bell numbers
- Benford's law
- Bernoulli numbers
- Best shuffle
- Binary coded decimal
- Binary digits
- Binary search
- Binary strings
- Binomial transform
- Bioinformatics/base count
- Bioinformatics/Global alignment
- Bitmap
- Bitmap/Bresenham's line algorithm
- Bitmap/Flood fill
- Bitwise operations
- Blum integer
- Boolean values
- Box the compass
- Boyer-Moore string search
- Brazilian numbers
- Bulls and cows
- Burrows–Wheeler transform
- Bézier curves/Intersections
C
- Caesar cipher
- Calculating the value of e
- Calkin-Wilf sequence
- Call a foreign-language function
- Call a function
- Call a function in a shared library
- Case-sensitivity of identifiers
- Catalan numbers
- Catalan numbers/Pascal's triangle
- Catamorphism
- Changeable words
- Chaocipher
- Chaos game
- Character codes
- Check that file exists
- Chinese remainder theorem
- Chinese zodiac
- Cholesky decomposition
- Chowla numbers
- Circular primes
- Classes
- Closest-pair problem
- Code Golf: Code Golf
- Collect and sort square numbers in ascending order from three lists
- Collections
- Colorful numbers
- Combinations
- Combinations with repetitions
- Comma quibbling
- Command-line arguments
- Comments
- Common sorted list
- Compare length of two strings
- Compile-time calculation
- Composite numbers k with no single digit factors whose factors are all substrings of k
- Compound data type
- Concurrent computing
- Conditional structures
- Continued fraction
- 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
- Count the coins/0-1
- Cousin primes
- CRC-32
- Create a file
- Create a two-dimensional array at runtime
- Create an HTML table
- Create an object at a given address
- Cross compilation
- CSV data manipulation
- Cuban primes
- Cumulative standard deviation
- Curzon numbers
- Cyclops numbers
D
- Damm algorithm
- Date format
- Date manipulation
- Day of the week
- Day of the week of Christmas and New Year
- Days between dates
- De Bruijn sequences
- De Polignac numbers
- Deceptive numbers
- Define a primitive data type
- Delegates
- Delete a file
- Detect division by zero
- Determine if a string has all the same characters
- Determine if a string is numeric
- Determine if two triangles overlap
- Digit fifth powers
- Digital root
- Digital root/Multiplicative digital root
- Dijkstra's algorithm
- Dining philosophers
- Disarium numbers
- Discordian date
- Distance and Bearing
- Distribution of 0 digits in factorial series
- Dot product
- Doubly-linked list/Element definition
- Doubly-linked list/Element insertion
- Doubly-linked list/Traversal
- Dragon curve
- Draw a cuboid
- Draw a sphere
- Dynamic variable names
E
- Earliest difference between prime gaps
- Elementary cellular automaton/Random number generator
- Emirp primes
- Empty directory
- Empty program
- Empty string
- Enforced immutability
- Entropy
- Enumerations
- Environment variables
- Equilibrium index
- Erdős-Nicolas numbers
- Esthetic numbers
- Ethiopian multiplication
- Euler method
- Euler's sum of powers conjecture
- Evaluate binomial coefficients
- Even or odd
- Evolutionary algorithm
- Exceptions
- Exceptions/Catch an exception thrown in a nested call
- Executable library
- Execute a Markov algorithm
- Execute a system command