Skip to main content

Part of the book series: Undergraduate Topics in Computer Science ((UTICS))

  • 2978 Accesses

Abstract

This chapter opens a new part of the book, dedicated to types. The language PCF is extended by adding types. A type verification algorithm is described and the application to the static detection of errors is discussed in length. This chapter also describes the denotational semantics of PCF with types.

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 29.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 39.95
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

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Gilles Dowek .

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag London Limited

About this chapter

Cite this chapter

Dowek, G., Lévy, JJ. (2011). PCF with Types. In: Introduction to the Theory of Programming Languages. Undergraduate Topics in Computer Science. Springer, London. https://doi.org/10.1007/978-0-85729-076-2_5

Download citation

  • DOI: https://doi.org/10.1007/978-0-85729-076-2_5

  • Publisher Name: Springer, London

  • Print ISBN: 978-0-85729-075-5

  • Online ISBN: 978-0-85729-076-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics