Skip to main content

Part of the book series: Texts and Monographs in Computer Science ((MCS))

  • 194 Accesses

Abstract

In Section 2 we will define “lists of E” in terms of the least fixed point specification

$$E*:: = 1 + E \times E*$$

(i.e., “a list is the empty list (1 = }Λ}) or an element of E followed by a list). But the parenthetical explication just given works only in Set, whereas the specification works in any category in which polynomial functors have least fixed points. In this sense E is a “parameter” for the “lists-of-” specifier. The specific parameter E may itself arise from another data type specification and may live in a category of arbitrary complexity subject to the technical needs of semantics.

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.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag New York

About this chapter

Cite this chapter

Manes, E.G., Arbib, M.A. (1986). Parametric Specification. In: Algebraic Approaches to Program Semantics. Texts and Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-4962-7_12

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-4962-7_12

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4612-9377-4

  • Online ISBN: 978-1-4612-4962-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics