Teaching recursion as a problem-solving tool using standard ML

Authors:
Peter B. Henderson;Francisco J. Romero
Affiliations:
Department of Computer Science, State University of New York at Stony Brook, Stony Brook, New York;Department of Computer Science, State University of New York at Stony Brook, Stony Brook, New York
Venue:
SIGCSE '89 Proceedings of the twentieth SIGCSE technical symposium on Computer science education
Year:
1989

Citing 9
Cited 9

On the complexity of recursion in problem-solving

International Journal of Man-Machine Studies
Programming in Prolog (2nd ed.)

Programming in Prolog (2nd ed.)
Thinking recursively

Thinking recursively
Modern introductory computer science

SIGCSE '87 Proceedings of the eighteenth SIGCSE technical symposium on Computer science education
Functional programming using standard ML

Functional programming using standard ML
Teaching recursion using fractals in Prolog

SIGCSE '88 Proceedings of the nineteenth SIGCSE technical symposium on Computer science education
Learning recursion as a concept and as a programming technique

SIGCSE '88 Proceedings of the nineteenth SIGCSE technical symposium on Computer science education
A proposal for standard ML

LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
A framework for teaching recursion

ACM SIGCSE Bulletin

Teaching some modern functional programming concepts: an approach based on an extended FP-like language

ACM SIGCSE Bulletin
Fun, rigour and pragmatism in functional programming

ACM SIGCSE Bulletin
A declarative laboratory approach for discrete structures, logic, and computability

ACM SIGCSE Bulletin
Does Scheme enhance an introductory programming course?: some preliminary empirical results

ACM SIGPLAN Notices
Computer science needs an insight-based curriculum

SIGCSE '94 Proceedings of the twenty-fifth SIGCSE symposium on Computer science education
Engaging students and teaching modern concepts: literate, situated, object-oriented programming

SIGCSE '94 Proceedings of the twenty-fifth SIGCSE symposium on Computer science education
Paradigms and laboratories in the core computer science curriculum: an overview

ACM SIGCSE Bulletin
Discrete mathematics as a precursor to programming

SIGCSE '90 Proceedings of the twenty-first SIGCSE technical symposium on Computer science education
Why structural recursion should be taught before arrays in CS 1

Proceedings of the 36th SIGCSE technical symposium on Computer science education

Quantified Score

Hi-index	0.00

Visualization

Abstract

Standard ML is a state of the art functional programming language, with features that make it excellent for teaching recursion and problem solving at the introductory level. Among the many pedagogically interesting characteristics of ML are its simple and uniform syntax, its type polymorphism and type inferencing system, and datatype declaration facilities. With little formal ML instruction, after several weeks first year students were able to use recursively defined data structures and to define fairly powerful recursive functions in ML. Standard ML is highly recommended as a tool for teaching recursive problem solving in the context of a course on the foundations of computer science.