Strict programming language: Difference between revisions

Revision as of 14:54, 23 April 2010

Revision as of 01:19, 27 April 2010

Line 1:

{{unreferencedUnreferenced|date=October 2006}}

A '''strict programming language''' is one in which only [[strict function]]s (functions whose parameters must be evaluated completely before they may be called) may be defined by the user. A '''non-strict programming language''' allows the user to define non-strict functions, and hence may allow [[lazy evaluation]].

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{{referenceCitation needed|date=April 2010}}.

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