Category:RPL

This programming language may be used to instruct a computer to perform a task.
Official website |
---|
Execution method: | Interpreted |
---|---|
Garbage collected: | Yes |
Parameter passing methods: | By value |
Type safety: | Unsafe |
Type strength: | Weak |
Lang tag(s): | rpl |
See Also: |
|
RPL (an acronym for Reverse Polish Lisp) is the onboard calculator language for the HP-28, HP 48 and HP-49/50 lines of graphing calculators. It is a stack language (not a Lisp-like language, as its name implies), tightly integrated with the calculator system, with many instructions similar to Forth.
It can natively handle unsigned integers (named binary integers), floating-point numbers (named real numbers), complex numbers, vectors and matrices (named arrays), lists, character strings, and algebraic expressions. The HP-49/50 models can also handle long integers (up to 500 digits) and benefit from several dedicated built-in functions to work with, including testing and generation of prime numbers.
There are actually two languages with the name RPL: User RPL and System RPL. System RPL is used in implementing the operating system, and User RPL is the language users use to write programs on the calculator. System RPL is highly hardware-dependent, whilst User RPL is upwardly compatible.
The language RPL/2 is a recreation of this language for POSIX machines.
Pages in category "RPL"
The following 200 pages are in this category, out of 752 total.
(previous page) (next page)M
- Magic constant
- Magic squares of odd order
- Magnanimous numbers
- Main step of GOST 28147-89
- Mandelbrot set
- Map range
- Matrix multiplication
- Matrix transposition
- Matrix with two diagonals
- Matrix-exponentiation operator
- Maximum difference between adjacent elements of list
- Maximum triangle path sum
- McNuggets problem
- Meissel–Mertens constant
- Menu
- Mersenne primes
- Metallic ratios
- Metronome
- Mian-Chowla sequence
- Middle three digits
- Minimum multiple of m where digital sum equals m
- Minimum numbers of three lists
- Minimum primes
- Modular exponentiation
- Modular inverse
- Monte Carlo methods
- Morse code
- Mosaic matrix
- Motzkin numbers
- Multifactorial
- Multiple distinct objects
- Multiplicatively perfect numbers
- Multisplit
- Munchausen numbers
- Musical scale
- Mutual recursion
- Möbius function
N
- N'th
- N-grams
- Narcissist
- Narcissistic decimal number
- Negative base numbers
- Neighbour primes
- Nested function
- Next highest int from digits
- Next special primes
- Nice primes
- Nim game
- Non-continuous subsequences
- Non-decimal radices/Convert
- Non-decimal radices/Input
- Non-decimal radices/Output
- Nth root
- 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 in base-16 representation that cannot be written with decimal digits
- Numbers which are the cube roots of the product of their proper divisors
- Numbers whose binary and ternary digit sums are prime
- Numbers whose count of divisors is prime
- Numbers with equal rises and falls
- Numbers with prime digits whose sum is 13
- Numbers with same digit set in base 10 and base 16
O
P
- Padovan n-step number sequences
- Padovan sequence
- Pairs with common factors
- Palindrome dates
- Palindrome detection
- Palindromic primes
- Palindromic primes in base 16
- Pan base non-primes
- Pandigital prime
- Pangram checker
- Parsing/RPN calculator algorithm
- Parsing/RPN to infix conversion
- Parsing/Shunting-yard algorithm
- Partial function application
- Pascal matrix generation
- Pascal's triangle
- Password generator
- Pell numbers
- Penholodigital squares
- Penta-power prime seeds
- Perfect numbers
- Perfect totient numbers
- Permutations with some identical elements
- Pernicious numbers
- Pi
- Pick random element
- Piprimes
- Pisano period
- Playing cards
- Plot coordinate pairs
- Poker hand analyser
- Polynomial derivative
- Polynomial long division
- Polynomial regression
- Population count
- Positive decimal integers with the digit 1 occurring exactly twice
- Power set
- Practical numbers
- Pragmatic directives
- Price fraction
- Primality by trial division
- Primality by Wilson's theorem
- Prime decomposition
- Prime numbers p for which the sum of primes less than or equal to p is prime
- Prime numbers which contain 123
- Prime reciprocal sum
- Prime triplets
- Prime words
- Primes which contain only one odd digit
- Primes whose first and last number is 3
- Primes whose sum of digits is 25
- Primes with digits in nondecreasing order
- Primes: n*2^m+1
- Probabilistic choice
- Product of divisors
- Product of min and max prime factors
- Program termination
- Proper divisors
- Pseudo-random numbers/Middle-square method
- Pseudo-random numbers/Splitmix64
R
- Radical of an integer
- Ramer-Douglas-Peucker line simplification
- Random Latin squares
- Random number generator (device)
- Random numbers
- Range consolidation
- Range expansion
- Range extraction
- Real constants and functions
- Recaman's sequence
- Reduced row echelon form
- Remove duplicate elements
- Remove vowels from a string
- Rename a file
- Rep-string
- Repeat
- Repeat a string
- Repunit primes
- Return multiple values
- Reverse a string
- Reverse words in a string
- Rice coding
- Riordan numbers
- Rock-paper-scissors
- Rodrigues’ rotation formula
- Roman numerals/Decode
- Roman numerals/Encode
- Roots of a cubic polynomial
- Roots of a quadratic function
- Roots of unity
- Rot-13
- Run-length encoding
- Runtime evaluation/In an environment
- Ruth-Aaron numbers
S
- Safe and Sophie Germain primes
- Sattolo cycle
- Search a list
- SEDOLs
- Selectively replace multiple instances of a character within a string
- Self numbers
- Self-describing numbers
- Semiprime
- Separate the house number from the street name
- Sequence of non-squares
- Sequence of primes by trial division
- Sequence: smallest number greater than previous term with exactly n divisors
- Sequence: smallest number with exactly n divisors
- Set
- Set consolidation
- Set right-adjacent bits
- Seven-sided dice from five-sided dice
- Shape-Machine
- Shell one-liner
- Shift list elements to left by 3
- Shoelace formula for polygonal area
- Show the (decimal) value of a number of 1s appended with a 3, then squared
- Show the epoch
- Sieve of Eratosthenes
- Singular value decomposition
- Sisyphus sequence
- Sleep
- Sleeping Beauty problem