Design principles of Mathpert: software to support education in algebra and calculus

  • Michael Beeson
Part of the Texts and Monographs in Symbolic Computation book series (TEXTSMONOGR)


This paper lists eight design criteria that must be met if we are to provide successful computer support for education in algebra, trigonometry, and calculus. It also describes Mathpert, a piece of software that was built with these criteria in mind. The description given here is intended for designers of other software, for designers of new teaching materials and curricula utilizing mathematical software, and for professors interested in using such software. The design principles in question involve both the user interface and the internal operation of the software. For example, three important principles are cognitive fidelity, the glass box principle, and the correctness principle. After an overview of design principles, we discuss the design of Mathpert in the light of these principles, showing how the main lines of the design were determined by these principles. (The scope of this paper is strictly limited to an exposition of the design principles and their application to Mathpert. I shall not attempt to review projects other than Mathpert in the light of these design principles.)


Design Principle Agat Program Graphical Operator Stream Processor Algebriques Plane 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Abelson, H., Sussman, G. J., Sussman, J. (1985): Structures and interpretation of computer programs. MIT Press, Cambridge, MA.MATHGoogle Scholar
  2. Bentley, J. L., Kernighan, B. W. (1991): A system for algorithm animation. Comput. Syst. 4/1: 5–30.Google Scholar
  3. Bertin, J. (1983): Semiology of graphics. University of Wisconsin Press, Madison, WI.Google Scholar
  4. Brown, M. H. (1988): Exploring algorithms using BALSA-II. IEEE Computer 21/5: 14–36.CrossRefGoogle Scholar
  5. Brown, M. H. (1992): Zeus: a system for algorithm animation and multi-view editing. Digital SRC Res. Rep. 75, DEC, Palo Alto, CA.Google Scholar
  6. Brown, M. H., Hershberger, J. (1991): Color and sound in algorithm animation. Digital SRC Res. Rep. 76a, DEC, Palo Alto, CA.Google Scholar
  7. Brown, M. H., Najork, M. A. (1993): Algorithm animation using 3D interactive graphics. Digital SRC Res. Rep. 110a, DEC, Palo Alto, CA.Google Scholar
  8. Brown, M. H., Sedgewick, R. (1984): A system for algorithm animation. Comput. Graph. 18: 177–186.CrossRefGoogle Scholar
  9. Cox, K. C. ( 1992): Abstraction in algorithm animation. In: Proceedings of the 1992 IEEE Workshop on Visual Languages. IEEE Computer Science Press, Los Alamitos, CA, pp. 18–24.Google Scholar
  10. Dalmas, S., Gaëtano, M., and Sausse, A. (1994): ASAP: a protocol for symbolic computation systems. Rapp. Tech. 162, Institut National de Recherche en Informatique et en Automatique, Le Chesnay.Google Scholar
  11. de Sousa, J. (1995): Etude algorithmique de la topologie des courbes algébriques planes complexes. Ph.D. thesis, Université de Nice-Sophia Antipolis, Sophia Antipolis, France.Google Scholar
  12. Duisberg, R. A. (1986): Animated graphical interfaces using temporal constraints. In: Proceedings of the ACM CHI’ 86 Conference on Human Factors in Computing Systems. Association for Computing Machinery, New York, pp. 131–136.Google Scholar
  13. Gloor, P. A. (1992): AACE algorithm animation for computer science education. In: Proceedings of the 1992 IEEE Workshop on Visual Languages. IEEE Computer Science Press, Los Alamitos, CA, pp. 25–31.Google Scholar
  14. Helttula, E., Hyrskykari, A., Räihä, K.-J. (1989): Graphical specification of algorithm animations with Aladdin. In: Proceedings of the 22nd Hawaii International Conference on System Sciences, pp. 892–901.Google Scholar
  15. Krishnamoorthy, M. S., Swaminathan, R. (1989): Programs tools for algorithm animation. Software Pract. Exper. 19: 505–513.CrossRefGoogle Scholar
  16. Najork, M. A. (1994): Obliq-3D tutorial and reference manual. Digital SRC Res. Rep. 129, DEC, Palo Alto, CA.Google Scholar
  17. Rasala, R., Prouxl, V. K., Fell, H. J. (1994): From animation to analysis in introductory computer science. SIGCSE Bull. 26/1: 61–65.CrossRefGoogle Scholar
  18. Stasko, J. T. (1990): Tango: a framework and system for algorithm animation. IEEE Computer 23/9: 27–39.CrossRefGoogle Scholar
  19. Stasko, J. T. (1992): Animating algorithms with XTango. SIGACT News 23/2: 67–71.CrossRefGoogle Scholar
  20. Stasko, J. T., Wehrli, J. F. (1993): Three-dimensional computation visualization. In: Proceedings of the 1993 IEEE Symposium on Visual Languages. IEEE Computer Science Press, Los Alamitos, CA, pp. 100–107.Google Scholar
  21. Tal, A., Dobkin, D. (1994): GASP: a system for visualizing geometric algorithms. In: IEEE Visualization’ 94, pp. 149–155.Google Scholar
  22. Thinking Machines (1994): Prism user’s guide, version 2.0. Thinking Machines Corp., Cambridge, MA.Google Scholar
  23. Waters, R. C. (1991): Automatic transformation of series expressions into loops. ACM Trans. Programm. Lang. Syst. 13: 53–98.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Wien 1998

Authors and Affiliations

  • Michael Beeson

There are no affiliations available

Personalised recommendations