El uso de algoritmos en la introducción de los conceptos de variable y sucesión

Referencias

Dijkstra E.W., Notes on Structured Prograrnrning, en Structured Programrning Dahl, Dijkstra, Hoare (eds.), Acadernic P., 1972. Dijkstra E.W., On a cultural gap, The Mathernatical Intelligencer (1986) 48-52. Goguen J.A., The logic of inexact concepts, Synthese (1968-69) 325-373. Gray R., Cornputer Prograrns and Mathernatical Proofs, The Mathernatical Intelligencer (1991) 45-48. Hoare C.A.R., An Axiornatic Basis for Computer Programrning, Cornrnun. of ACM (1969) 576-83. Küchernann D.E.,Algebra, en Children's understanding of Mathernatics: 11-16 K. Hart (ed.), Murray, Londres, 1981. Maurer S.B., Ralston A., Algorithrns: Will cannot do discrete Mathernatics without thern, en Discrete Mathernatics across the Curriculurn K-12, NCTM, Reston U.S.A., 1991. Mueller C., Teaching prograrnming using values, World Comp. Congress, post. 82, Madrid, 1992. Noss R., Constructing a Conceptual Framework for Elernentary Algebra through LOGO Programming, Educational Studies in Mathematics (1986) 4. Poincare H., Ciencia e hipótesis, EspasaCalpe, Madrid, 1944. Ralston A., Will Discrete Mathernatics surpass Calculus in irnportance?, The College Mathernatics Journal 15} ( 1984) 371-373. Sutherland R.}. A longitudinal Study of the Development of Pupil 's Algebraic Thinking in a LOGO Environment, Ph.D. Thesis, Univ. Londres. Zellini P., Breve historia del infinito, Siruela, Madrid, 1991.