| Introducing functional programming in discrete mathematics |
| Full text |
Pdf
(556 KB)
|
| Source
|
Technical Symposium on Computer Science Education
archive
Proceedings of the twenty-third SIGCSE technical symposium on Computer science education
table of contents
Kansas City, Missouri, United States
Pages: 147 - 152
Year of Publication: 1992
ISBN:0-89791-468-6
Also published in ...
|
|
Author
|
|
Roger L. Wainwright
|
Department of Mathematical and Computer C-:an--o, The University of Tulsa, 600 South College Avenue, Tulsa, Oklahoma
|
|
| Sponsor |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 1, Downloads (12 Months): 19, Citation Count: 3
|
|
|
ABSTRACT
Programming assignments in my discrete mathematics course have changed recently due to an influx of non-computer science students with little or no programming experience. Programming problems are now assigned in a simple to learn, easy to write, mathematical-like functional programming language that requires no previous programming experience. In theory, all students begin on the same basis. Exposure to the concepts of functional programming is an essential part of computer science and mathematics curricula. For most students this is the only exposure to functional programming. Functional programming and discrete mathematics are a natural combination. One week of lectures and perhaps a small monetary investment is all that is required. An instructor totally unfamiliar with functional programming can easily learn enough in a week or so to present a simple introduction to the topic. Introducing functional programming concepts in discrete mathematics was very successful. Students found the exposure to functional programming to be an insight they had never experienced before and enthusiastically recommended an introduction to functional programming be a permanent part of the course.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
| |
2
|
|
| |
3
|
|
 |
4
|
|
 |
5
|
|
| |
6
|
|
Peer to Peer - Readers of this Article have also read:
-
Data structures for quadtree approximation and compression
Communications of the ACM
28, 9
Hanan Samet
-
A hierarchical single-key-lock access control using the Chinese remainder theorem
Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
Kim S. Lee
, Huizhu Lu
, D. D. Fisher
-
The GemStone object database management system
Communications of the ACM
34, 10
Paul Butterworth
, Allen Otis
, Jacob Stein
-
Putting innovation to work: adoption strategies for multimedia communication systems
Communications of the ACM
34, 12
Ellen Francik
, Susan Ehrlich Rudman
, Donna Cooper
, Stephen Levine
-
An intelligent component database for behavioral synthesis
Proceedings of the 27th ACM/IEEE Design Automation Conference on
Gwo-Dong Chen
, Daniel D. Gajski
|