Next: 1 Introduction
Recursion, Iteration
and
Functional Languages
John E. Howland
Department of Computer Science
Trinity University
715 Stadium Drive
San Antonio, Texas 78212-7200
Voice: (210) 736-7480
Fax: (210) 736-7477
Internet: jhowland@ariel.cs.trinity.edu
Abstract:
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.
Next: 1 Introduction
2002-11-26