Abstract
In this chapter we exploit the domain theory from Chapter 8 to define the (lazy) denotational semantics of HOFL. For each type τ we introduce a corresponding domain (V τ )⊥ which is defined inductively over the structure of τ and such that we can assign an element of the domain (V τ )⊥ to each (closed and typable) term t with type τ. Moreover, we introduce the notion of environment, which assigns meanings to variables, and can be exploited to define the denotational semantics of (typable) terms with variables. Interestingly, all constructions we use are continuous, so that we are able to assign meaning also to any (typable) term that is recursively defined. We conclude the chapter by showing some important properties of the denotational semantics; in particular, that it is compositional.
Work out what you want to say before you decide how you want to say it. (Christopher Strachey’s first law of logical design)
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). Denotational 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_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-42900-7_9
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)