Skip to main content

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4180))

  • 337 Accesses

Abstract

Most specification languages for mathematical theories support definition mechanisms for sets that are inductively generated by a set of constructors and recursive functions on these under the heading of abstract data types. Prominent examples of abstract data types are natural numbers, lists, trees, etc. The module ADT presented in this chapter extends OMDoc by a concise syntax for abstract data types that follows the model used in the Casl (Common Abstract Specification Language [CoF04]) standard.

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

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 16.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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.

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Kohlhase, M. (2006). Abstract Data Types (Module ADT). In: OMDoc – An Open Markup Format for Mathematical Documents [version 1.2]. Lecture Notes in Computer Science(), vol 4180. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11826095_19

Download citation

  • DOI: https://doi.org/10.1007/11826095_19

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics