Abstract
One of the problems encountered with a formal approach to the teaching of functional programming is to encourage students to perform inductive proofs for recursively defined functions. In this paper we investigate the use of a theorem prover (written in Haskell) to help students gain confidence in their mathematical abilities.
As examples, we use the material that we have developed for an introductory functional programming module; and show how the theorem prover can be of assistance.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
R.J. Bird and P.L. Wadler. An Introduction to Functional Programming. Prentice-Hall Series in Computer Science. Prentice-Hall International (UK) Ltd., Hemel Hempstead, Hertfordshire, England, 1988.
Robert Boyer and J. S. Moore. A Computational Logic Handbook. Academic Press, 1988.
P.J. Brumfitt. Metamorph — a formal methods toolkit with application to the design of digital hardware. Journal of Functional Programming, 2(4):437–473, October 1992.
A.J. Field and P.G. Harrison. Functional Programming. Addison-Wesley International Computer Science Series, 1988.
H. Glaser, C. Hankin, and D. Till. Principles of Functional Programming. Prentice-Hall International, Inc., London, 1984.
D Harel. Algorithmics: the Spirit of Computing. Addison-Wesley, 1987.
D.R. Lester. Combinator Graph Reduction: A Congruence and its Applications. Dphil thesis, Oxford University, 1988. Also published as Technical Monograph PRG-73.
D.R. Lester. CS412 — Algorithmics and Functions. Course notes, University of Manchester, 1992.
D.R. Lester and S. Mintchev. Towards machine-checked compiler correctness for higher-order pure functional languages. In L. Pacholski and J. Tiuryn, editors, Proceedings of the 1994 Annual Conference of the European Association for Computer Science Logic, pages 369–381. Springer-Verlag LNCS 933, 1995.
S. Mintchev. Mechanized reasoning about functional programs. In K. Hammond, D.N. Turner, and P. Sansom, editors, Functional Programming, Glasgow 1994, pages 151–167. Springer-Verlag Workshops in Computing, 1994.
H.R. Nielson and F. Nielson. Semantics with applications: a formal introduction. Wiley, 1992.
L.C. Paulson. Isabelle: A Generic Theorem Prover. Springer-Verlag LNCS 828, 1994.
R. Plasmeijer and M. van Eekelen. Functional Programming and Parallel Graph Rewriting. Addison-Wesley, 1993.
C. Reade. Elements of Functional Programming. International Computer Science Series. Addison-Wesley, 1989.
C. Runciman, I. Toyn, and M. Firth. An incremental, exploratory and transformational environment for lazy functional programming. Journal of Functional Programming, 3(1):93–117, January 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lester, D., Mintchev, S. (1995). Inducing students to induct. 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_44
Download citation
DOI: https://doi.org/10.1007/3-540-60675-0_44
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