Revision as of 15:29, 7 May 2012 edit Damian Yerrick (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers 15,101 edits →Examples: Do C macros and Scheme syntax rules, which can make use of short-circuiting, make them not strict? I'll take it to talk. ← Previous edit		Revision as of 15:33, 7 May 2012 edit undo Damian Yerrick (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers 15,101 edits →Examples: After rereading the next section, I found a way to reword the dubious statement Next edit →
Line 3: == Examples == Nearly all [[programming language]]s in common use today are strict. Examples include ~~[[C (programming language)\|C]],{{dubious\|C is not strict}} [[C++]],~~ [[C_Sharp_(programming_language)\|C#]], [[Java (programming language)\|Java]], [[Perl]] (up through version 5), [[Python (programming language)\|Python]], [[Ruby (programming language)\|Ruby]], [[Common Lisp]], ~~[[Scheme (programming language)\|Scheme]],{{dubious\|C is not strict}}~~ and [[ML (programming language)\|ML]]. The best known non-strict languages are [[Haskell (programming language)\|Haskell]], [[Miranda (programming language)\|Miranda]], and [[Clean (programming language)\|Clean]]. Languages whose ordinary functions are strict but which provide a [[Macro (computer science)\|macro system]] to build non-strict functions include [[C (programming language)\|C]], [[C++]], and [[Scheme (programming language)\|Scheme]]. == Explanation ==

Strict programming language: Difference between revisions