Functional programming; Haskell, Gofer; type theory.Clearly, it is preferable to make this definition as weak as possible, permitting a larger class of models, while at the same ... with call-by-value semantics and hence our results are restricted to languages with lazy or call-by-name semantics . We discuss this point more fully in Section 5.9. We have already seen how the type inference algorithm can be used to describe the relationship between the set of allanbsp;...
|Author||:||Mark P. Jones|
|Publisher||:||Cambridge University Press - 2003-10-16|