Differences between version 6 and previous revision of StrictEvaluation.
Other diffs: Previous Major Revision, Previous Author, or view the Annotated Edit History
| Newer page: | version 6 | Last edited on Sunday, March 7, 2004 9:28:02 am | by AristotlePagaltzis | Revert |
| Older page: | version 5 | Last edited on Sunday, October 26, 2003 7:45:22 am | by AristotlePagaltzis | Revert |
@@ -1,5 +1,5 @@
An approach to evaluating expressions in a ProgrammingLanguage. It means that the values of sub-expressions are worked out before passing them to operators, and that the values of parameters are worked out before passing them to functions.
-This is the norm in ImperativeProgramming used in languages like [C], [C++] or [Java] and in in "unpure" FunctionalProgramming
used in languages like [ML] and [LISP]. Strict evaluation means you can predict the order that expressions will be evaluated in, so other language features like reassignable variables and a conventional I/O system become practical.
+This is the norm in ImperativeProgramming used in languages like [C], [C++] or [Java] and in in "unpure" functional programming
used in languages like [ML] and [LISP]. Strict evaluation means you can predict the order that expressions will be evaluated in, so other language features like reassignable variables and a conventional I/O system become practical.
Contrast LazyEvaluation.
