Abstract
Computer science students need mathematical proof skills. At our University, these skills are being taught as part of various mathematics and computer science courses. To test the skills of our students, we have asked them to work out a number of exercises. We found that our students are not as well trained in basic proof skills as we would have hoped. The main reason is that proof skills are not emphasized enough. Our findings are the result of a small experiment using a longitudinal measurement of skills. This method gives better insight in the skills of students than more traditional exam-based testing methods. Longitudinal measurement does not allow the students to specifically prepare themselves for particular questions. The measurements thus relate to skills that are retained for a longer period of time.
In our Department, fierce debates have been held in the past discussing such issues as “what proof skills do our students have?”. An important aspect of our work is that it tries to find evidence to help answer to such questions. Research such as ours is rare in the field of teaching mathematics and computer science.
Preview
Unable to display preview. Download preview PDF.
References
R. S. Bird and P. L. Wadler. Introduction to functional programming. Prentice Hall, New York, 1988.
A. J. Field and P. G. Harrison. Functional programming. Addison Wesley, Reading, Massachusetts, 1988.
D. Gries. Improving the curriculum through the teaching of calculation and discrimination. Education and computing, 7(1,2), 1991.
R. Harrison. The use of functional programming languages in teaching computer science. J. functional programming, 3(1):67–75, Jan 1993.
P. H. Hartel and L. O. Hertzberger. Paradigms and laboratories in the core computer science curriculum: An overview. Technical report CS-95-03, Dept. of Comp. Sys, Univ. of Amsterdam, Jan 1995.
J. L. Hein. A declarative laboratory approach for discrete structures, logic and computability. ACM SIGCSE bulletin, 25(3):19–24, Sep 1993.
P. B. Henderson and F. J. Romero. Teaching recursion as a problem-solving tool using standard ML. In R. A. Barrett and M. J. Mansfield, editors, 20th Computer science education, pages 27–31, Louisville, Kentucky, Feb 1989. ACM SIGCSE bulletin, 21(1).
E. L. Lehman. Nonparametrics: Statistical methods based on ranks. Holden & Day, San Francisco, Calofornia, 1975.
C. Morgan. Programming from specifications. Prentice Hall, Hemel Hempstead, England, 1990.
D. L. Parnas. Education for computing professionals. Computer, 23(1):17–22, Jan 1990.
S. L. Peyton Jones. The implementation of functional programming languages. Prentice Hall, Englewood Cliffs, New Jersey, 1987.
E. S. Tan. A stochastic growth model for the longitudinal measurement of ability. PhD thesis, Dept. of Maths. and Comp. Sys, Univ. of Amsterdam, Dec 1994.
Th. J. M. (Dick) Tromp. The acquisition of expertise in computer programming. PhD thesis, Dept. of Psychology, Univ. of Amsterdam, Sep 1989.
A.J. Turner. A summary of the ACM/IEEE-CS joint curriculum task force report: Computing curricula 1991. CACM, 34(6):69–84, Jun 1991.
A. G. van Asch. To prove, why and how? Int. J. Mathematical education in science and technology, 24(2):301–313, Mar 1993.
J. F. A. K. van Benthem, H. P. van Ditmarsch, J. Ketting, and W. P. M. Meyer-Viol. Logica voor Informatici. Addison-Wesley Nederland, Amsterdam, 1991.
K. van den Berg. Software measurement and functional programming, PhD thesis, Twente technical Univ., Jun 1995.
P. L. Wadler. How to replace failure by a list of successes, a method for exception handling, backtracking, and pattern matching in lazy functional languages. In J.-P. Jouannaud, editor, 2nd Functional programming languages and computer architecture, LNCS 201, pages 113–128, Nancy, France, Sep 1985. Springer-Verlag, Berlin.
R. L. Wainwright. Introducing functional programming in discrete mathematics. In M. J. Mansfield, C. M. White, and J. Hartman, editors, 23rd Computer science education, pages 147–152, Kansas, Missouri, Mar 1992. ACM SIGCSE bulletin, 24(1).
U. Wolz and E. Conjura. Integrating mathematics and programming into a three tiered model for computer science education. In D. Joyce, editor, 25th Computer science education, pages 223–227, Phoenix, Arizona, Mar 1994. ACM SIGCSE bulletin, 26(1).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hartel, P.H., van Es, B., Tromp, D. (1995). Basic proof skills of computer science students. In: Hartel, P.H., Plasmeijer, R. (eds) Funtional Programming Languages in Education. FPLE 1995. Lecture Notes in Computer Science, vol 1022. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60675-0_50
Download citation
DOI: https://doi.org/10.1007/3-540-60675-0_50
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60675-8
Online ISBN: 978-3-540-49252-8
eBook Packages: Springer Book Archive