Category:APL
(Redirected from APL)
This programming language may be used to instruct a computer to perform a task.
| Type checking: | Dynamic |
|---|---|
| See Also: |
|
APL (A Programming Language) is an array oriented, functional, interactive programming language created and developed by Kenneth Iverson in the 1960's. It uses a large range of special graphic symbols to represent functions and operators, giving very concise code.[1] It influenced many other programming languages such as J and Mathematica.
References[edit]
<references>
Subcategories
This category has the following 3 subcategories, out of 3 total.
@
- APL examples needing attention (empty)
- APL Implementations (2 P)
- APL User (41 P)
Pages in category "APL"
The following 200 pages are in this category, out of 285 total.
(previous page) (next page)2
A
- A+B
- ABC problem
- ABC words
- Ackermann function
- Additive primes
- Almost prime
- Alternade words
- Anagrams
- Angle difference between two bearings
- Anonymous recursion
- Anti-primes
- Append numbers at same position in strings
- Apply a callback to an array
- Archimedean spiral
- Arithmetic-geometric mean
- Arithmetic/Complex
- Arithmetic/Integer
- Array concatenation
- Array length
- Arrays
- Associative array/Creation
- Averages/Arithmetic mean
- Averages/Median
- Averages/Mode
- Averages/Pythagorean means
- Averages/Root mean square
B
C
- Caesar cipher
- Canonicalize CIDR
- Card shuffles
- Cartesian product of two or more lists
- Case-sensitivity of identifiers
- Catalan numbers
- Catalan numbers/Pascal's triangle
- Catamorphism
- Character codes
- Check that file exists
- Comma quibbling
- Comments
- Common list elements
- Common sorted list
- Compare length of two strings
- Concurrent computing
- Convert seconds to compound duration
- Conway's Game of Life
- Coprimes
- Count in octal
- Count occurrences of a substring
- Cousin primes
- Create a file
- Create a two-dimensional array at runtime
- Cycle detection
D
E
F
- Factorial
- Factors of an integer
- Farey sequence
- Fast Fourier transform
- Fibonacci n-step number sequences
- Fibonacci sequence
- Fibonacci word
- Filter
- Find first missing positive
- Find minimum number of coins that make a given value
- Find the intersection of a line with a plane
- Find the intersection of two lines
- Find the missing permutation
- FizzBuzz
- Flatten a list
- Flipping bits game
- Formatted numeric output
- Forward difference
- Four bit adder
- Four is magic
- Frobenius numbers
- Function definition
G
H
I
L
- Langton's ant
- Largest five adjacent number
- Largest proper divisor of n
- Leap year
- Least common multiple
- Length of an arc between two angles
- Letter frequency
- Logical operations
- Long year
- Longest common subsequence
- Longest common suffix
- Look-and-say sequence
- Loop over multiple arrays simultaneously
- Loops/For
- Luhn test of credit card numbers
M
- MAC vendor lookup
- Magic squares of odd order
- Mastermind
- Matrix multiplication
- Matrix transposition
- Matrix with two diagonals
- Maximum difference between adjacent elements of list
- Mayan numerals
- Maze generation
- McNuggets problem
- MD5
- Mertens function
- Minimum multiple of m where digital sum equals m
- Minimum number of cells after, before, above and below NxN squares
- Monty Hall problem
- Multiplication tables
- Munchausen numbers
- Mutual recursion
N
- N'th
- N-queens problem
- Narcissistic decimal number
- Nice primes
- Null object
- Number names
- Number reversal game
- Numbers divisible by their individual digits, but not by the product of their digits.
- Numbers in base 10 that are palindromic in bases 2, 4, and 16
- Numbers which binary and ternary digit sum are prime
- Numbers with equal rises and falls
- Numbers with same digit set in base 10 and base 16