# Category:Forth

**Forth**

This

**programming language**may be used to instruct a computer to perform a task.

Garbage collected: | No |
---|---|

Typing: | Untyped |

See Also: |

**Forth** is a procedural, stack-oriented and reflective programming language without type checking which is also a concatenative programming language. Forth features both interactive execution of commands (making it suitable as a shell for systems that lack a more formal operating system) and the ability to compile sequences of commands for later execution; due to its ability to easily cross-compile a version of itself to other target architectures and because it does not need to rely on an underlying operating system, it is often used for embedded systems. Some Forth versions (especially early ones) compile concatenative threaded code, but many implementations today generate optimized machine code like other language compilers. While it has quite competitive performance on its own (comparable to Just-In-Time - JIT - compiled languages such as JavaScript, or those used on the Java Virtual Machine - JVM - such as Kotlin, or on DotNet such as C# or F#); however, if a particular application requires it, there is a closely integrated machine code Assembler that can be used to write the most time critical functions/"words" or to supply features not available in the standard language implementation.

Where not otherwise specified, examples conform to the 1994 ANSI Standard, also known as **ANS Forth**. Most Forth implementations now conform to this standard, often with system-specific extensions and convenience libraries. Some examples use words that are not in the standard, but which have become accepted as common practice since 1994. Standard words should be uppercase, but most Forth systems are case-insensitive.

## CitationsEdit

## Subcategories

This category has the following 3 subcategories, out of 3 total.

### @

- Forth examples needing attention (empty)
- Forth Implementations (9 P)
- Forth User (50 P)

## Pages in category "Forth"

The following 200 pages are in this category, out of 598 total.

(previous page) (next page)### F

### G

- Gamma function
- Gapful numbers
- General FizzBuzz
- Generate Chess960 starting position
- Generate lower case ASCII alphabet
- Generator/Exponential
- Generic swap
- Get system command output
- Gradient descent
- Gray code
- Grayscale image
- Greatest common divisor
- Greatest element of a list
- Greatest subsequential sum
- Guess the number

### H

- Hailstone sequence
- Hamming numbers
- Handle a signal
- Happy numbers
- Harmonic series
- Hash join
- Haversine formula
- Hello world/Graphical
- Hello world/Line printer
- Hello world/Newline omission
- Hello world/Standard error
- Hello world/Text
- Here document
- Hickerson series of almost integers
- Higher-order functions
- Hilbert curve
- History variables
- Hofstadter Q sequence
- Holidays related to Easter
- Horizontal sundial calculations
- Horner's rule for polynomial evaluation
- Host introspection
- Hostname
- HTTP

### I

### K

### L

- Langton's ant
- Largest proper divisor of n
- Leap year
- Least common multiple
- Left factorials
- Letter frequency
- Levenshtein distance
- Linear congruential generator
- Literals/Floating point
- Literals/Integer
- Literals/String
- Logical operations
- Long primes
- Long year
- Look-and-say sequence
- Loop over multiple arrays simultaneously
- Loops/Break
- Loops/Continue
- Loops/Do-while
- Loops/Downward for
- Loops/For
- Loops/For with a specified step
- Loops/Foreach
- Loops/Infinite
- Loops/N plus one half
- Loops/Nested
- Loops/While
- Loops/Wrong ranges
- Lucas-Lehmer test
- Luhn test of credit card numbers
- LZW compression

### M

- Magic 8-ball
- Man or boy test
- Mandelbrot set
- Map range
- Matrix multiplication
- Matrix transposition
- Maximum triangle path sum
- Maze generation
- MD5
- Memory allocation
- Memory layout of a data structure
- Menu
- Mertens function
- Metaprogramming
- Middle three digits
- Miller–Rabin primality test
- Minimum multiple of m where digital sum equals m
- Modular arithmetic
- Modular inverse
- Modulinos
- Monte Carlo methods
- Monty Hall problem
- Morse code
- Multi-dimensional array
- Multifactorial
- Multiline shebang
- Multiple distinct objects
- Multiplication tables
- Munchausen numbers
- Musical scale
- Mutual recursion

### N

- N'th
- N-queens problem
- Named parameters
- Naming conventions
- Narcissist
- Narcissistic decimal number
- Native shebang
- Nice primes
- Non-decimal radices/Convert
- Non-decimal radices/Input
- Non-decimal radices/Output
- Nth root
- Null object
- Number reversal game
- Numbers divisible by their individual digits, but not by the product of their digits.
- Numbers which are the cube roots of the product of their proper divisors
- Numbers with equal rises and falls
- Numerical integration

### O

### P

- Palindrome detection
- Pangram checker
- Parsing/RPN calculator algorithm
- Pascal's triangle
- Percentage difference between images
- Perceptron
- Perfect numbers
- Permutations by swapping
- Pernicious numbers
- Pig the dice game
- Plasma effect
- Playing cards
- Pointers and references
- Polymorphic copy
- Polymorphism
- Population count
- Power set
- Price fraction
- Primality by trial division
- Primality by Wilson's theorem
- Prime decomposition
- Primes whose sum of digits is 25
- Priority queue
- Probabilistic choice
- Program name
- Program termination
- Proper divisors
- Pseudo-random numbers/Combined recursive generator MRG32k3a
- Pseudo-random numbers/Middle-square method
- Pseudo-random numbers/Splitmix64
- Pseudorandom number generator image