A friend of mine wrote the following paper describing his attempt to characterize the differences between a few different styles of implementing the same code in J a few different ways -- explicit, implicit, and a few variations. He also baselined against a Forth implementation.
I found his writeup very interesting. What do you think? http://sam-falvo.github.io/2014/01/05/subroutine-performance-in-j/ -Wm ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
