A Semantics for : a Calculus with Overloading and Late-binding

T. Studer
2001 Journal of Logic and Computation  
Up to now there was no interpretation available for λ-calculi featuring overloading and late-binding, although these are two of the main principles of any object-oriented programming language. In this paper we provide a new semantics for a stratified version of Castagna's λ {} , a λ-calculus combining overloading with late-binding. The model-construction is carried out in EETJ + (Tot) + (F-I N ), a system of explicit mathematics. We will prove the soundness of our model with respect to
more » ... , type-checking and reductions. Furthermore, we show that our semantics yields a solution to the problem of loss of information in the context of type dependent computations.
doi:10.1093/logcom/11.4.527 fatcat:6wnqyvktnbeknhlq6y7taob7v4