Skip to main content
SpringerLink
Log in

Homomorphisms and promotability

  • Contributed Lectures
  • Conference paper
  • First Online:
Book cover Mathematics of Program Construction (MPC 1989)

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

Included in the following conference series:

Abstract

The construction of structure-preserving maps, or “homomorphisms,” is described for an arbitrary data type: examples of these functions are given for list- and tree-like structures and types defined by mutual induction. From the definition of a data type it is also possible to infer a “promotion” theorem for proving equalities of homomorphisms.

Aíγα δέντρα καí λíγα Bρεμένα χαλíκλα

— Odysseus Elytis, Eπέτειοζ

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.C. Backhouse. An Exploration of the Bird-Meertens Formalism. Technical Report CS8810, Department of Mathematics and Computing Science, University of Groningen, 1988.

    Google Scholar 

  2. R.C. Backhouse. On the Meaning and Construction of the Rules in Martin-Löf's Theory of Types. Technical Report CS8606, Department of Mathematics and Computing Science, University of Groningen, 1986.

    Google Scholar 

  3. R. S. Bird. Constructive functional programming. International Summer School on Constructive Methods in Computing Science, Marktoberdorf, 1988.

    Google Scholar 

  4. R. S. Bird. An introduction to the theory of lists. In M. Broy, editor, Logic of Programming and Calculi of Discrete Design, Springer-Verslag, Berlin, 1987. NATO ASI Series, volume F36.

    Google Scholar 

  5. C. Böhm and A. Berarducci. Automatic synthesis of typed λ-programs on term algebras. Theoretical Computer Science, 39:135–154, 1985.

    Google Scholar 

  6. C.A.R. Hoare. Approach to category theory for computer scientists. Lecture Notes, International Summer School on Constructive Methods in Computing Science, Marktoberdorf 1988.

    Google Scholar 

  7. L. Meertens. Algorithmics — towards programming as a mathematical activity. In Proceedings of the CWI Symposium on Mathematics and Computer Science, pages 289–334, North-Holland, 1986.

    Google Scholar 

  8. L. Meertens. First steps towards the theory of rose trees. in preparation, CWI, Amsterdam 1988.

    Google Scholar 

  9. N.P. Mendler. Inductive Definitions in Type Theory. Ph.D. thesis, Cornell University, September 1987.

    Google Scholar 

  10. M. Spivey. A Categorical Approach to the Theory of Lists. To appear, these proceedings.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing Science, Groningen University, P.O. Box 800, 9700 AV, Groningen, The Netherlands

    Grant Malcolm

Authors
  1. Grant Malcolm
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. L. A. van de Snepscheut

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Malcolm, G. (1989). Homomorphisms and promotability. In: van de Snepscheut, J.L.A. (eds) Mathematics of Program Construction. MPC 1989. Lecture Notes in Computer Science, vol 375. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51305-1_20

Download citation

  • DOI: https://doi.org/10.1007/3-540-51305-1_20

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51305-6

  • Online ISBN: 978-3-540-46191-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation