Skip to main content

Part of the book series: Modern Birkhäuser Classics ((MBC))

  • 798 Accesses

Abstract

Let T be some type. Consider the data type “stack of elements of type T”. Values of that type are sequences of values of type T.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer Science+Business Media New York

About this chapter

Cite this chapter

Shen, A. (1997). Data types. In: Algorithms and Programming. Modern Birkhäuser Classics. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-0-8176-4761-2_6

Download citation

  • DOI: https://doi.org/10.1007/978-0-8176-4761-2_6

  • Publisher Name: Birkhäuser, Boston, MA

  • Print ISBN: 978-0-8176-4760-5

  • Online ISBN: 978-0-8176-4761-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics