Hostname: page-component-745bb68f8f-b6zl4 Total loading time: 0 Render date: 2025-01-15T16:45:37.521Z Has data issue: false hasContentIssue false
  • English
  • Français

The recursive record semantics of objects revisited

Published online by Cambridge University Press:  14 April 2004

GÉRARD BOUDOL
GÉRARD BOUDOL
Affiliation:
INRIA Sophia Antipolis, BP 93 – 06902 Sophia Antipolis Cedex, France
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

In a call-by-value language, representing objects as recursive records requires using an unsafe fixpoint. We design, for a core language including extensible records, a type system which rules out unsafe recursion and still supports the construction of a principal type for each typable term. We illustrate the expressive power of this language with respect to object-oriented programming by introducing a sub-language for “mixin-based” programming.

Type
Article
Information
Journal of Functional Programming , Volume 14 , Issue 3 , May 2004 , pp. 263 - 315
Copyright
© 2004 Cambridge University Press
Submit a response

Discussions

No Discussions have been published for this article.