An Interpretation of Extensible Objects

Gérard Boudol, Silvano Dal Zilio
In FCT'99 — 12th International Symposium on Fundamentals of Computation Theory, aug 1999.

 PDF  DOI〈10.1007/3-540-48321-7_11〉

Abstract

#

We provide a translation of Fisher-Honsell-Mitchell’s delegation-based object calculus with subtyping into a lambda-calculus with extensible records. The target type system is an extension of the system Fω of dependent types with recursion, extensible records and a form of bounded universal quantification. We show that our translation is computationally adequate, that the typing rules of Fisher-Honsell-Mitchell’s calculus can be derived in a rather simple and natural way, and that our system enjoys the standard subject reduction property.

Citation

#

@InProceedings{DalzilioS:interpextobj,
   author    = {Boudol, Gérard and {Dal Zilio}, Silvano},
   title     = {{An Interpretation of Extensible Objects}},
   booktitle = {FCT'99 -- 12th International Symposium on Fundamentals of Computation Theory},
   series    = {Lecture Notes in Computer Science},
   volume    = {1684},
   publisher = {Springer-Verlag},
   doi = {10.1007/3-540-48321-7_11},
   pages     = {148--160},
   month     = aug, 
   year      = 1999
}