Strict programming language: Difference between revisions

Revision as of 00:35, 26 October 2012

Revision as of 22:22, 5 October 2013

Line 13:

* Because of the uncertainty regarding if and when expressions will be evaluated, non-strict languages generally must be [[purely functional]] to be useful.

* All [[computer architecture|hardware architecture]]s in common use are optimized for strict languages, so the best compilers for non-strict languages produce slower code than the best compilers for strict languages, with the notable exception of the [[Glasgow Haskell Compiler]] which outperforms many strict language compilers{{Citation needed|date=April 2010}}.

* [[Space complexity]] of non-strict programs is difficult to understand and predict.