Previous Downloads

I - Linux platforms

  • 24/09/2016 : Oforth for Linux x86 version V0.9.25 : here
  • 23/07/2016 : Oforth for Linux x86 version V0.9.24.1 : here
  • 04/02/2016 : Oforth for Linux x86 version V0.9.23 : here
  • 26/09/2015 : Oforth for Linux x86 version V0.9.22 : here
  • 22/07/2015 : Oforth for Linux x86 version V0.9.21 : here
  • 26/05/2015 : Oforth for Linux x86 version V0.9.20 : here
  • 07/05/2015 : Oforth for Linux x86 version V0.9.19 : here
  • 07/04/2015 : Oforth for Linux x86 version V0.9.18 : here
  • 01/03/2015 : Oforth for Linux x86 version V0.9.17 : here
  • 31/01/2015 : Oforth for Linux x86 version V0.9.16 : here
  • 01/12/2014 : Oforth for Linux x86 version V0.9.15 : here
  • 18/11/2014 : Oforth for Linux x86 version V0.9.14 : here

II - Windows platforms

  • 24/09/2016 : Oforth for Windows x86 version V0.9.25 : here
  • 23/07/2016 : Oforth for Windows x86 version V0.9.24.1 : here
  • 04/02/2016 : Oforth for Windows x86 version V0.9.23 : here
  • 26/09/2015 : Oforth for Windows x86 version V0.9.22 : here
  • 22/07/2015 : Oforth for Windows x86 version V0.9.21 : here
  • 26/05/2015 : Oforth for Windows x86 version V0.9.20 : here
  • 07/05/2015 : Oforth for Windows x86 version V0.9.19 : here
  • 01/03/2015 : Oforth for Windows x86 version V0.9.17 : here
  • 31/01/2015 : Oforth for Windows x86 version V0.9.16 : here
  • 01/12/2014 : Oforth for Windows x86 version V0.9.15 : here
  • 18/11/2014 : Oforth for Windows x86 version V0.9.14 : here

III - Mac OS X platforms

  • 24/09/2016 : Oforth for Mac OS x86 version V0.9.25 : here
  • 23/07/2016 : Oforth for Mac OS x86 version V0.9.24.1 : here
  • 04/02/2016 : Oforth for Mac OS x86 version V0.9.23 : here
  • 26/09/2015 : Oforth for Mac OS x86 version V0.9.22 : here
  • 27/07/2015 : Oforth for Mac OS x86 version V0.9.21 : here
  • 26/05/2015 : Oforth for Mac OS x86 version V0.9.20 : here

Some examples (from tutorials).

You can find lots of examples here

Factorial

: fact(n) -- n1
| i | 1 n loop: i [ i * ] ;



Fibonacci sequence

: fib(n) -- n1
   0 1 n #[ tuck + ] times drop ;



Look and say (see detail)

: lookAndSay(n)
   [ 1 ] n #[ dup println group map([#size, #first]) ] times ;



Sum of square roots of all even integers between 1 and 10000

seq(10000) filter(#isEven) map(#sqrt) sum .
333383.040171148



A ping pong between 2 tasks running concurrently and using channels to communicate

: pong(n, ch1, ch2)
| i |
  n loop: i [ ch1 receive ch2 send drop ] ;

: pingpong(n)
| ch1 ch2 i |
   Channel new ->ch1
   Channel new ->ch2
   #[ pong(n, ch1, ch2) ] &
   n loop: i [ i ch1 send drop ch2 receive . ] ;



An emitter that launches event listeners into parallel tasks running concurrently

: myemitter {
| e |
   Emitter new(null) ->e
   e onEventParallel($foo, #[ "foo" . ])
   e emit($foo)
   e onEventParallel($foo, #[ "bar" . ])
   e emit($foo)
   e close ;