Abstract
For modeling the λΓ-calculus, we must reflect in the model the fact that the set Γ of input values is a proper subset of the whole set Λ. In the setting of filter λΓ-models, this implies that every type system ∇ inducing a filter λΓ-model must be such that I(∇) ⊂ F(∇).
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-Value 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_12
Download citation
DOI: https://doi.org/10.1007/978-3-662-10394-4_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-05746-5
Online ISBN: 978-3-662-10394-4
eBook Packages: Springer Book Archive