A semantics of multiple inheritance.
Proc. of the international symposium on Semantics of data types
On understanding types, data abstraction, and polymorphism
ACM Computing Surveys (CSUR) - The MIT Press scientific computation series
Toward a typed foundation for method specialization and inheritance
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An interpretation of objects and object types
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A lambda calculus of objects with self-inflicted extension
Proceedings of the 13th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
The Equivalence of Two Semantic Definitions for Inheritance in Object-Oriented Languages
Proceedings of the 7th International Conference on Mathematical Foundations of Programming Semantics
Notes on Typed Object-Oriented Programming
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
A Theory of Primitive Objects - Untyped and First-Order Systems
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
TACS '97 Proceedings of the Third International Symposium on Theoretical Aspects of Computer Software
Matching Constraints for the Lambda Calculus of Objects
TLCA '97 Proceedings of the Third International Conference on Typed Lambda Calculi and Applications
A Subtyping for the Fisher-Honsell-Mitchell Lambda Calculus of Objects
CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
A Delegation-based Object Calculus with Subtying
FCT '95 Proceedings of the 10th International Symposium on Fundamentals of Computation Theory
Full Abstraction for First-Order Objects with Recursive Types and Subtyping
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Interpretations of Extensible Objects and Types
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
| Hi-index | 0.00 |
We provide a translation of Fisher-Honsell-Mitchell's delegation-based object calculus with subtyping into a λ-calculus with extensible records. The target type system is an extension of the system Fω of types depending on 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.