Functional programming and mathematical objects
We discuss the application of the Haskell/Gofer type classes and constructor classes to the implementation and teaching of the manipulation techniques in the domain of formal mathematical expressions. We show also how the lazy evaluation paradigms simplify the construction and the presentation of several algorithms dealing with iterative data types, such as power series or formal Padé expansion. We show the application of higher order functions to algebra and geometry, and specifically — to the construction of parametric surfaces.
KeywordsType Class Functional Programming Galois Field High Order Function Symbolic Extension
Unable to display preview. Download preview PDF.
- 1.D. Guntz, M. Monagan, Introduction to Gauss, Sigsam Bulletin 28, no. 2, (1994), pp 3–19.Google Scholar
- 2.P. Hudak, S. Peyton Jones, P. Wadler et al., Report on the programming language Haskell, (Version 1.3), Technical report Yale University/Glasgow University, (1995).Google Scholar
- 3.Mark P. Jones, Gofer, Functional Programming Environment, (1991).Google Scholar
- 4.Donald E. Knuth, The Art of Computer Programming, Vol 2 / Seminumerical Algorithms, Addison-Wesley, Reading, (1981).Google Scholar
- 5.Lloyd Allison, Circular Programs and Self-referential Structures, Software — Practice and Experience, Vol. 19(2), (1989), pp. 99–109.Google Scholar
- 6.H. T. Kung, J. F. Traub, JACM 25 (1978), pp. 245–260.Google Scholar
- 7.Jerzy Karczmarczuk, Lazy Functional Programming and Manipulation of Perturbation Series, Proc. III International Workshop on Software Engineering for High Energy Physics, (1993), pp. 571–581.Google Scholar