Strict programming language: Difference between revisions

Revision as of 01:47, 26 January 2022

Revision as of 09:23, 28 January 2022

Line 8:

==Examples==

Nearly all [[programming language]]s in common use today are strict. Examples include [[C Sharp (programming language)|C#]], [[Java (programming language)|Java]], [[Perl]] (all versions, i.e. through version&nbsp;5 and version 7; Raku, formerly known as Perl 6, has lazy lists<ref>{{Cite web|title=Raku Programming/Lazy Lists and Feeds - Wikibooks, open books for an open world|url=https://en.wikibooks.org/wiki/Raku_Programming/Lazy_Lists_and_Feeds|access-date=2021-02-09|website=en.wikibooks.org}}</ref>), [[Ruby (programming language)|Ruby]], [[Common Lisp]], and [[ML (programming language)|ML]]. Examples for non-strict languages are [[Haskell (programming language)|Haskell]], [[Miranda (programming language)|Miranda]], and [[Clean (programming language)|Clean]].{{Sfn|Cluet & Hull|1998|pp=25–26}}

Languages whose ordinary functions are strict but which provide a [[Macro_Macro (computer_sciencecomputer science)#Hygienic_macrosHygienic macros|macro system]] to build non-strict functions include [[Julia (programming language)|Julia]],<ref>{{Citation|last=Innes|first=Mike J.|title=MikeInnes/Lazy.jl|date=2021-02-06|url=https://github.com/MikeInnes/Lazy.jl|access-date=2021-02-09}}</ref> and [[Scheme (programming language)|Scheme]].

==Explanation==

Line 64:

| title =Database Programming Languages

| series =Lecture Notes in Computer Science

| volume =Volume 1369

| publisher =Springer

| publication-place =Berlin; Heidelberg