%0 Book Section %1 137221 %A Harvey, Brian %B Learning mathematics and logo %C Cambridge, MA, USA %D 1992 %E Hoyles, Celia %E Noss, Richard %I MIT Press %K constructionism learning logo mythesis programming recursion %P 393-426 %T Avoiding recursion %U http://www.eecs.berkeley.edu/~bh/noss.ps %X Functional languages such as Logo and Scheme generally use recursion as the main control mechanism, rather than iterative constructs such as while and for. Many beginning programmers find the idea of recursion difficult, and that gives these languages a bad reputation. Here I suggest that the use of higher-order procedures can allow a wide range of interesting programs to be written before the learner must confront the challenge of recursion.

@incollection{137221, abstract = {Functional languages such as Logo and Scheme generally use recursion as the main control mechanism, rather than iterative constructs such as while and for. Many beginning programmers find the idea of recursion difficult, and that gives these languages a bad reputation. Here I suggest that the use of higher-order procedures can allow a wide range of interesting programs to be written before the learner must confront the challenge of recursion.}, added-at = {2007-07-15T03:42:58.000+0200}, address = {Cambridge, MA, USA}, author = {Harvey, Brian}, biburl = {https://www.bibsonomy.org/bibtex/294db19d5d778742ee2893bfd317ca110/yish}, booktitle = {Learning mathematics and logo}, editor = {Hoyles, Celia and Noss, Richard}, interhash = {094c99350f97d6116160cb1d8e8b9f02}, intrahash = {94db19d5d778742ee2893bfd317ca110}, keywords = {constructionism learning logo mythesis programming recursion}, pages = {393-426}, publisher = {MIT Press}, timestamp = {2008-04-26T18:24:14.000+0200}, title = {Avoiding recursion}, url = {http://www.eecs.berkeley.edu/~bh/noss.ps}, year = 1992 }