Differences between version 4 and predecessor to the previous major change of StrictEvaluation.
Other diffs: Previous Revision, Previous Author, or view the Annotated Edit History
| Newer page: | version 4 | Last edited on Thursday, August 7, 2003 3:41:31 am | by AristotlePagaltzis | Revert |
| Older page: | version 3 | Last edited on Sunday, February 16, 2003 5:32:45 pm | by GlynWebster | Revert |
@@ -2,7 +2,7 @@
Strict evaluation means you can predict the order that expressions will be
evaluated in. That makes other language features like reassignable variables and a conventional I/O system practical.
-If you've used a an ImperativeLanguage like [C]. [C++] or [Java], then this is just what you are used to. It is the norm for imperative languages. [ML] and [Lisp
] are [FunctionalLanguage]s with strict evaluation.
+If you've used a an ImperativeLanguage like [C]. [C++] or [Java], then this is just what you are used to. It is the norm for imperative languages. [ML] and [LISP
] are [FunctionalLanguage]s with strict evaluation.
The other approach to evaluation is LazyEvaluation.
