- Win32Forth programs by Jos v.d. Ven
- The Forth Programming site of Leo Wong
- The Scientific Forth Library Project
- Len's Forth Page
- Repository at Institut für Computersprachen
- Julian V. Noble's page

- Factoring arbitrarily large numbers
- The towers of Hanoi
- Winograd's SHRDLU
- Battling programs
- Magic squares
- The
**n**queens problem - Weizenbaum's famous
**Eliza**program - Support file and iForth ichess.prf for Ian Osgood's TSCP Chess program
- Romanian whist (card game), text terminal version [picture].
- Anagram generator, Ian Osgood's DAWG filter program for this, [a log file for "forth is great"].

- the matrix multiply floating-point benchmark in Forth
- the FLOPS floating-point benchmark in Forth
- the LINPACK floating-point benchmark in Forth
- FFT benchmark (FFT, IFFT and Fast Hartley utilities)
- FIB benchmark (Fibonacci numbers)
- NSIEVE benchmark (Large Sieve benchmark)
- QUEENS benchmark (The Eight (and more) Queens problem)
- SHUFFLE benchmark (Benchmark tests a pseudo-random number generator)
- Perfect Number search using Knuth's algorithm P
- The Monstrous Forth Benchmark Suite (65 tests)

- The core neural-net routine: backpropagation
- Teach a neural net how to do EXOR and AND functions simultaneously
- Teach a neural net how to do all logic functions simultaneously
- Teach a neural net how to do optical character recognition
- Teach Little Red Riding Hood the facts of life
- Untying a Gordian Knot. Needs the FSL.
- A very simple PD neural net program that only experts will understand

- Verhulst' growth model #2 [picture]
- Verhulst' growth model #1 [picture]
- A tree or bush programmed as a Lindenmayer system [picture]
- Star cluster [picture]
- Fractal tennis (random Sierpinski triangle) [picture]
- Koch's snowflake programmed as a Lindenmayer system [picture]
- The letter "H" built from small letter H's [picture]
- The Levy line, conventional [picture]
- The Levy line, with backtracking [picture]
- The Levy line, extremities only [picture]
- A maple leaf, according to Barnsley [picture]
- A Peano-line programmed as a Lindenmayer system [picture]
- A Sierpinski-line programmed as a Lindenmayer system [picture]
- Sierpinski's triangle [picture]
- Julia fractal, integers [picture]
- Julia fractal [picture]
- Filled Julia fractal [picture]
- Julia fractal, integers [picture]
- Mandelbrot fractal, zoomable [picture]
- Mandelbrot fractal, sine function [picture]
- Mandelbrot fractal, sine function, zoomed [picture]
- Mandelbrot fractal, exponential [picture]
- Mandelbrot fractal [picture]
- Julia fractal, sine function [picture]
- Pickover fractal, live 1 [picture]
- Pickover fractal, live 2 [picture]
- Pickover fractal, live 3 [picture]
- Julia fractal, exponential function [picture]
- Julia fractal, cubic function [picture]
- Julia fractal, cells [picture]
- Julia fractal [picture]
- Julia fractal [picture]
- Julia fractal, distance formula [picture]
- Barnley's fern [picture]
- Julia fractal [picture]
- Julia fractal [picture]
- Julia fractal [picture]
- Julia fractal [picture]
- Julia fractal, projection [picture]
- Fractal mountain [picture]
- Vanderwaerden curve [picture]
- Fractal profile [picture]
- 3D Pythagoras tree [picture]

- Lprofile.frt: profiles by line number, output accumulated runtime per word
- lprof.frt: also uses tick counters, version of Friday, August 02, 2002
- scooter.frt: check a list of URL's for changes. Needs w3m. (example list)
- cplx_fsl.frt: complex word set needed for DD-fp package.
- DD-fp.frt: a 106-bit floating point package (includes advanced FP functions).