Interesting fact of the disturbing kind ;-)
The language designer or a programmer in that language would still call it a closure. That the implementation optimized it away would (normally) only interest the implementor of the language. That it can be revealed through an eval I would call an implementation bug. Ideally any optimization must not change the result of a programm execution.
In reply to Re^5: Syntax question about closures and Perl 'sort'
by jethro
in thread Syntax question about closures and Perl 'sort'
by dwm042
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |