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.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor information
Authors and Affiliations
Corresponding author
Rights 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)