Strict programming language: Difference between revisions

Revision as of 10:44, 2 July 2024

Revision as of 17:11, 6 December 2024

Line 24:

==Extension==

{{unreferenced section|date=April 2024}}

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]].[[Solving chess|^{[Solving chess}]]^]

==Citations==