Abstract
To model a λΛ-theory, it is necessary to reflect in the model the fact that the set of input values coincides with the whole set Λ. So it is natural to ask that in every model the set D and the set of semantic input values I must coincide. In a filter model, it must be F(C, ∇) = I(C, ∇), so T(C) = I(C).
This is a preview of subscription content, log in via an institution to check access.
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
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Rocca, S.R.D., Paolini, L. (2004). Call-by-Name Denotational Semantics. In: The Parametric Lambda Calculus. Texts in Theoretical Computer Science. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-10394-4_11
Download citation
DOI: https://doi.org/10.1007/978-3-662-10394-4_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-05746-5
Online ISBN: 978-3-662-10394-4
eBook Packages: Springer Book Archive