Forth is an imperative stack-based computer programming language and programming environment. Language features include structured programming, reflection (the ability to modify the program structure during program execution), concatenative programming (functions are composed with juxtaposition) and extensibility (the programmer can create new commands). Although not an acronym, the language’s name is sometimes spelled with all capital letters as FORTH, following the customary usage during its earlier years. A procedural programming language without type checking, 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. Some Forth implementations (usually early versions or those written to be extremely portable) compile threaded code, but many implementations today generate optimized machine code like other language compilers. Although not as popular as other programming systems, Forth has enough support to keep several language vendors and contractors in business. Forth is currently used in boot loaders such as Open Firmware, space applications,[1] and other embedded systems. Gforth, an implementation of Forth by the GNU Project, is actively maintained, with its most recent release in December 2008. The 1994 standard is currently undergoing revision, provisionally titled Forth 200x.

References in zbMATH (referenced in 6 articles )

Showing results 1 to 6 of 6.
Sorted by year (citations)

  1. Landau, Samuel; Sigaud, Olivier: A comparison between ATNoSFERES and learning classifier systems on non-Markov problems (2008) ioport
  2. Cheremisinov, Dmitrij I.: Deriving programs from parallel algorithms of logical control (2001)
  3. Baryshnikov, V. V.: Objects in FORTH. (1995)
  4. Baryshnikov, V. V.: The target compilation for the multisegment FORTH-systems. (1995)
  5. Montvelishskiĭ, M. B.: Parallel language FORTH. (1995)
  6. Koopman, Philip John jun.: An architecture for combinator graph reduction (1990)