as i thought, it wasn't much work to implement a concatenative
syntax for a substantial fragment of the k language (www.kx.com).
including the parser and comments, 157 lines and < 4k.
here is conk's (non-recursive) fibonacci:
fib == [1 1] swap [0 [+] scan 1 drop reverse] scando flip first
10 fib
[1 2 3 5 8 13 21 34 55 89 144]
conk.k will be available at www.kx.com/technical/contribs/stevan.html
sometime on monday.