Talk:Strict programming language: Difference between revisions

Revision as of 12:11, 7 November 2013

Revision as of 22:34, 8 February 2014

Line 60:

True, in C, user-defined functions per se are strict, but the built-in operators <code>[[logical conjunction|&&]]</code>, <code>[[logical disjunction|||]]</code>, and <code>[[?:|?...:]]</code> all [[Short-circuit evaluation|short-circuit]], as does <code>[[Conditional (programming)|if...else]]</code>. Also true, a C++ that overloads these operators [http://stackoverflow.com/questions/5133114/overloading-logical-operators-considered-bad-practice loses the short-circuiting behavior]. But a [[C preprocessor]] macro can build a function that includes this short-circuiting behavior. Scheme also has <code>define-syntax</code> to build a function that short-circuits. --[[User:Damian Yerrick|Damian Yerrick]] ([[User talk:Damian Yerrick|talk]] | [[Special:Contributions/Damian Yerrick|stalk]]) 15:29, 7 May 2012 (UTC)

== Regarding Chess's game tree ==

Isn't it incorrect to call the game tree of chess finite, when at any point, the players can just keep going back and forth with a single piece? Wouldn't it be more correct to call it a [[Directed Acyclic Graph]]?