I think treating the lambdas just like any function is perfectly normal, and is exactly what any function languages does.
Now, functional languages also has lexical closures, but I'm not sure how easy it would be to take advantage of it, since APL programs usually doesn't take advantage of clearly-defined lexical scopes. How does other APL's do it? Regards, Elias
