Revision as of 03:21, 4 April 2024 edit Ost316 (talk \| contribs) Extended confirmed users, Pending changes reviewers 89,846 edits m →Description: +{{Citation needed\|date=April 2024}} ← Previous edit		Revision as of 10:44, 2 July 2024 edit undo TheAgent007 (talk \| contribs) 3 edits mNo edit summary Next edit →
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 hethe complete [[game tree]] of [[chess]]. ==Citations==

Strict programming language: Difference between revisions