Recursion, Iteration and Functional Languages
John E. Howland · 1998
Functional programming languages are shown to be useful in the teaching of the concepts of recursion and iteration. The functional language approach presented in this paper has advantages over imperative languages in the area of analysis of recursive and iterative algorithms. Examples using the J and Scheme programming languages, with emphasis on the use of functional programming notation in exposition are given. 1 Subject Areas: Computer Science Education, J, Scheme, Exposition. Keywords: computer science introductory course, J, Scheme, exposition. 1 Introduction Functional languages provide a computational environment where functions are applied to arguments producing results. Once an item is created in memory it is never altered. Function application occurs without side effects. Algorithms involve sequences of function applications (functional composition). Most functional language environments automatically reclaim (garbage collection) items which are no longer needed. 1 This p...