Category:Frink
This programming language may be used to instruct a computer to perform a task.
| Official website |
|---|
| Garbage collected: | Yes |
|---|---|
| See Also: |
|
Frink is a programming language designed and implemented by Alan Eliasen. It is designed to be a general-purpose, relatively concise, multi-paradigm language.
One of the most obvious differentiating features of Frink is that it tracks units of measure (feet, meters, tons, watts, etc.) through all calculations, helping ensure that physical calculations make sense. Frink understands how different units of measure interrelate, such as a length cubed is a volume, or power multiplied by time is energy. Different units of measure can be mixed in calculations, and Frink automatically ensures that the calculations lead to a result with the expected dimensions. It attempts to follow standard mathematical notation as closely as possible, and makes a strong effort to do the right thing with numeric types.
Frink runs on almost any Java Virtual Machine (JVM) on Linux, Mac, Windows, and Raspberry Pi, and on Android, and is available in Google Play and the Amazon Kindle Market.
See Also
Subcategories
This category has the following 3 subcategories, out of 3 total.
@
- Frink examples needing attention (empty)
- Frink Implementations (empty)
- Frink User (4 P)
Pages in category "Frink"
The following 200 pages are in this category, out of 268 total.
(previous page) (next page)2
A
- A+B
- Abundant odd numbers
- Abundant, deficient and perfect number classifications
- Additive primes
- Almost prime
- Amicable pairs
- Anagrams
- Anti-primes
- Apply a callback to an array
- Arbitrary-precision integers (included)
- Archimedean spiral
- Arithmetic/Complex
- Arithmetic/Integer
- Arithmetic/Rational
- Array concatenation
- Array length
- Arrays
- Associative array/Iteration
- Attractive numbers
- Averages/Arithmetic mean
- Averages/Mode
B
C
- Case-sensitivity of identifiers
- Catalan numbers
- Character codes
- Check that file exists
- Chinese remainder theorem
- Cholesky decomposition
- Comma quibbling
- Command-line arguments
- Comments
- Constrained random points on a circle
- Convert decimal number to rational
- Convert seconds to compound duration
- Conway's Game of Life
- Coprimes
- Copy a string
- Copy stdin to stdout
- Count in factors
- Count in octal
- Create a two-dimensional array at runtime
- Currency
D
E
F
- Factorial
- Factorions
- Factors of a Mersenne number
- Factors of an integer
- Fast Fourier transform
- Fibonacci sequence
- File input/output
- File modification time
- File size
- Filter
- Find prime n such that reversed n is also prime
- Find prime numbers of the form n*n*n+2
- Find the intersection of two lines
- Find the last Sunday of each month
- Find the missing permutation
- Find words which contains all the vowels
- Find words which contains more than 3 e vowels
- FizzBuzz
- Flatten a list
- Fractal tree
- Function definition
G
H
I
L
- Largest int from concatenated ints
- Largest proper divisor of n
- Last Friday of each month
- Least common multiple
- Left factorials
- Letter frequency
- Levenshtein distance
- Literals/Integer
- Logical operations
- Look-and-say sequence
- Loop over multiple arrays simultaneously
- Loop structures
- Loops/Break
- Loops/Do-while
- Loops/Downward for
- Loops/For
- Loops/For with a specified step
- Loops/Foreach
- Loops/Infinite
- Loops/Nested
- Loops/While
- Lucas-Lehmer test
M
P
- Palindrome detection
- Pangram checker
- Parallel brute force
- Partition function P
- Pascal matrix generation
- Pascal's triangle
- Percentage difference between images
- Perfect numbers
- Permutations
- Pernicious numbers
- Phrase reversals
- Pick random element
- Power set
- Primality by trial division
- Prime decomposition
- Primes whose sum of digits is 25
- Primes with digits in nondecreasing order
- Primorial numbers
- Priority queue
- Proper divisors