Strict programming language: Difference between revisions

Revision as of 02:50, 18 January 2006

Revision as of 17:08, 19 February 2006

Line 9:

In most non-strict languages the non-strictness extends to [[algebraic data type|data constructor]]s. This allows conceptually infinite data structures (such as the list of all [[prime number]]s) to be manipulated in the same way as ordinary finite data structures. It also allows for the use of very large but finite data structures such as the complete [[game tree]] of [[chess]].

A non-strict programming language is more expressive than an otherwise equivalent strict language. However, nonNon-strictness has several disadvantages which have prevented widespread adoption:

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