If your program can be looked at as one giant (highly complex) expression, it becomes much easier to prove a level of 'correctness' for your program.
Balderdash Functional programs have stacks and lists, and they are state. The difference is, that state is hidden, and nearly impossible to interogate. A misplaced parens can completely alter the behaviour of your "one giant (highly complex) expression" without ever raising an error.
Quite how that makes it easier to prove correctness is beyond me.
In reply to Re^15: Wassercrats::Improved Volume 0, Number 0
by BrowserUk
in thread Perl::Improved Volume 0, Number 0
by Wassercrats
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |