Skip to main content
SpringerLink
Log in

Explaining algebraic theory with functional programs

  • Understanding LOLITA
  • Conference paper
  • First Online:
Funtional Programming Languages in Education (FPLE 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1022))

Abstract

A hierarchy of six important structures from abstract algebra (groups, rings, fields etc.) is introduced as Gofer class definitions and laws about them. Many instance declarations are provided, explaining the algebraic construction of integers, quotients, adding i, function spaces, polynomials, and matrices. The definitions include generalized implementations of polynomial division and matrix inversion. Monadic parsers are provided for all constructs discussed. As an application, a one-line program is given for calculating the eigenvalue equation of a matrix.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Bird and P. Wadler, Introduction to Functional Programming. Prentice Hall, 1988.

    Google Scholar 

  2. Jeroen Fokker, Functional programming. Course notes, Department of Computer Science, Utrecht University, 1992. Also available as Functioneel Programmeren and as Programación Funcional. From http://www.cs.ruu.nl/∼jeroen.

    Google Scholar 

  3. Jeroen Fokker, ‘Functional parsers'. In [JM95], pp. 1–23. Also http://www.cs.ruu.nl/∼jeroen.

    Google Scholar 

  4. Johan Jeurig, Luc Duponcheel and Doaitse Swierstra, Grammars and Parsing. Course notes, Department of Computer Science, Utrecht University, 1994. From http://www.cs.ruu.nl/∼luc.

    Google Scholar 

  5. Johan Jeuring and Erik Meijer (eds.), Advanced functional programming. Springer LNCS 925, 1995.

    Google Scholar 

  6. ark Jones, Gofer 2.30 release notes http://www.cs.nott.ac.uk/Department/Staff/mpj.

    Google Scholar 

  7. Neil Jones, Carsten Gomard and Peter Sestoft, Partial evaluation and automatic program generation. Prentice Hall, 1993.

    Google Scholar 

  8. Serge Lang, Linear Algebra. Addison-Wesley, 1970.

    Google Scholar 

  9. Lambert Meertens, Category theory, Course notes, Department of Computer Science, Utrecht University, 1995. Ask lambert@cs.ruu.nl.

    Google Scholar 

  10. Erik Meijer and Doaitse Swierstra, Implementation of Programming Languages. Course notes, Department of Computer Science, Utrecht University, 1995. From http://www.cs.ruu.nl/∼erik.

    Google Scholar 

  11. Philip Wadler, ‘Monads for functional programming'. In [JM95], pp. 24–52. Also: http://www.dcs.glasgow.ac.uk/∼wadler.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, Utrecht University, P.O.Box 80.089, 3508, TB Utrecht, The Netherlands

    Jeroen Fokker

Authors
  1. Jeroen Fokker
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Pieter H. Hartel Rinus Plasmeijer

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fokker, J. (1995). Explaining algebraic theory with functional programs. 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_43

Download citation

  • DOI: https://doi.org/10.1007/3-540-60675-0_43

  • 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

Publish with us

Policies and ethics

Search

Navigation