Strict programming language: Difference between revisions

Content deleted Content added

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		Latest revision as of 23:50, 6 July 2025 edit undo Citation bot (talk \| contribs) Bots 5,861,402 edits Misc citation tidying. \| Use this bot. Report bugs. \| #UCB_CommandLine
(3 intermediate revisions by 3 users not shown)
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== Line 41: \| others =Published by Denise Penrose \| date =2006 \| ~~origyear~~orig-date =1999 \| title =Programming Language Pragmatics \| edition ={{Ordinal\|2\|sup=yes}} Line 65: \| display-editors =2 \| date =1998 \| ~~origyear~~orig-date =1997 \| title =Database Programming Languages \| series =Lecture Notes in Computer Science