Editing Strict programming language (section)

== Description ==
A strict programming language is a [[programming language]] which employs a strict [[programming paradigm]], allowing only [[strict function]]s (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]].{{Sfn|Scott|2006|p=541}} 

Non-strictness has several disadvantages which have prevented widespread adoption:{{Citation needed|date=April 2024}}
* Because of the uncertainty regarding if and when expressions will be evaluated, non-strict languages generally must be [[purely functional language|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.
* [[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 [[Macro (computer science)|macros]] or [[thunk]]s.
Strict programming languages are often associated with [[eager evaluation]], and non-strict languages with [[lazy evaluation]], but other [[evaluation strategy|evaluation strategies]] are possible in each case.{{Citation needed|date=April 2024}} 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|date=April 2024}}