Strict programming language

This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these messages) This article provides insufficient context for those unfamiliar with the subject. Please help improve the article by providing more context for the reader. (November 2018) (Learn how and when to remove this message) This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. Find sources: "Strict programming language" – news · newspapers · books · scholar · JSTOR (November 2014) (Learn how and when to remove this message) (Learn how and when to remove this message)

A strict programming language is a programming language that only allows strict functions (functions whose parameters must be evaluated completely before they may be called) to be defined by the user. A non-strict programming language allows the user to define non-strict functions, and hence may allow lazy evaluation. In most non-strict languages, the non-strictness extends to data constructors.

A strict programming language is a programming language which employs a strict programming paradigm, allowing only strict functions (functions whose parameters must be evaluated completely before they may be called) to be defined by the user. A non-strict programming language allows the user to define non-strict functions, and hence may allow lazy evaluation.^[1]

Non-strictness has several disadvantages which have prevented widespread adoption:^{[citation needed]}

• Because of the uncertainty regarding if and when expressions will be evaluated, non-strict languages generally must be purely functional to be useful.
• All hardware architectures 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.
• Space complexity of non-strict programs is difficult to understand and predict.
• In many strict languages, some advantages of non-strict functions can be obtained through the use of macros or thunks.

Strict programming languages are often associated with eager evaluation, and non-strict languages with lazy evaluation, but other evaluation strategies are possible in each case.^{[citation needed]} The terms "eager programming language" and "lazy programming language" are often used as synonyms for "strict programming language" and "non-strict programming language" respectively.^{[citation needed]}

Nearly all programming languages in common use today are strict.^{[citation needed]} Examples include C#, Java, Perl (all versions, i.e. through version 5 and version 7), Python,^[2] Ruby, Common Lisp, and ML. Some strict programming languages include features that mimic laziness.^{[clarification needed]} Raku (formerly known as Perl 6) has lazy lists,^[3] Python has generator functions,^[4] and Julia provides a macro system to build non-strict functions,^[5] as does Scheme.

Examples for non-strict languages are Haskell, R, Miranda, and Clean.^[6]

This section does not cite any sources. Please help improve this section by adding citations to reliable sources. Unsourced material may be challenged and removed. (April 2024) (Learn how and when to remove this message)

In most non-strict languages, the non-strictness extends to data constructors. This allows conceptually infinite data structures (such as the list of all prime numbers) 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.