Abstract
In the previous part of the book we have introduced and studied an imperative language called IMP. In this chapter we move our attention to functional languages. In particular, we introduce HOFL, a simple higher-order functional language that allows for the explicit construction of infinitely many types. We overview Church and Curry type theories. Then, we present a lazy operational semantics, which corresponds to a call-by-name strategy, namely actual parameters are passed to functions without evaluating them. This view is contrasted with the eager evaluation semantics, which corresponds to a call-by-value strategy, where all actual parameters are evaluated before being passed to functions. The operational semantics evaluates (well-typed) terms to suitable canonical forms.
Typing is no substitute for thinking. (Richard Hamming)
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2017 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Bruni, R., Montanari, U. (2017). Operational Semantics of HOFL. In: Models of Computation. Texts in Theoretical Computer Science. An EATCS Series. Springer, Cham. https://doi.org/10.1007/978-3-319-42900-7_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-42900-7_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-42898-7
Online ISBN: 978-3-319-42900-7
eBook Packages: Computer ScienceComputer Science (R0)