Skip to main content
SpringerLink
Log in

All recursive types defined using products and sums can be implemented using pointers

  • Invited Papers
  • Conference paper
  • First Online:
Algebraic Logic and Universal Algebra in Computer Science (ALUACS 1988)

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

Abstract

This paper presents an algebraic formulation, and proof, of the folk theorem to the effect that all the recursive types defined using “products and sums” (e.g., NATURAL-NUMBERs, STACKs, TREEs, etc.) can be implemented using pointers.

This paper is in final form and no version of it will be submitted for publication elsewhere.

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.

8 References

  1. Reference Manual for the ADA Programming Language. United States Department of Defense, Washington, DC, 1982.

    Google Scholar 

  2. N. A. Habermann and D. E. Perry. Ada for Experienced Programmers. Addison-Wesley, 1983.

    Google Scholar 

  3. Saunders MacLane. Categories for the Working Mathematician. Springer-Verlag, New York, 1971.

    Google Scholar 

  4. A. Van Wijngaarden. Revised Report on the Algorithmic Language ALGOL 68. 1969.

    Google Scholar 

  5. Eric G. Wagner. Basic categorical concepts for computer scientists. Tutorial presented at Fourth Workshop on Mathematical Foundations of Programming Language Semantics, May 1988, — final written version in preparation.

    Google Scholar 

  6. Eric G. Wagner. Semantics of block structured languages with pointers. In Proceedings of the 3rd Annual Workshop on the Mathematical Foundations of Programming Language Semantics, Springer Verlag, 1987.

    Google Scholar 

  7. Eric G. Wagner. On declarations. In Proceedings of the International Workshop on Categorical Methods in Computer Science, 1989.

    Google Scholar 

  8. Kathleen Jenson and Niklaus Wirth. PASCAL User Manual and Report. Lecture Notes in Computer Science, 18, Springer-Verlag, New York, 1978.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematical Sciences Department, IBM Research Division, T. J. Watson Research Center, 10598, Yorktown Heights, NY

    Eric G. Wagner

Authors
  1. Eric G. Wagner
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Clifford H. Bergman Roger D. Maddux Don L. Pigozzi

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wagner, E.G. (1990). All recursive types defined using products and sums can be implemented using pointers. In: Bergman, C.H., Maddux, R.D., Pigozzi, D.L. (eds) Algebraic Logic and Universal Algebra in Computer Science. ALUACS 1988. Lecture Notes in Computer Science, vol 425. Springer, New York, NY. https://doi.org/10.1007/BFb0043080

Download citation

  • DOI: https://doi.org/10.1007/BFb0043080

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-97288-6

  • Online ISBN: 978-0-387-34804-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation