Article

Tribe: a simple virtual class calculus

Authors:

Sophia Drossopoulou,

Tobias WrigstadAuthors Info & Claims

AOSD '07: Proceedings of the 6th international conference on Aspect-oriented software development

Pages 121 - 134

https://doi.org/10.1145/1218563.1218578

Published: 14 March 2007 Publication History

Abstract

Beginning with BETA, a range of programming language mechanisms such as virtual classes (class-valued attributes of objects) have been developed to allow inheritance in the presence of mutually dependent classes. This paper presents Tribe, a type system which generalises and simplifies other formalisms of such mechanisms, by treating issues which are inessential for soundness, such as the precise details of dispatch and field initialisation, as orthogonal to the core formalism. Tribe can support path types dependent simultaneously on both classes and objects, which is useful for writing library code, and ubiquitous access to an object's family, which offers family polymorphism without the need to drag around family arguments. Languages based on Tribe will be both simpler and more expressive than existing designs, while having a simpler type system, serving as a useful basis for future language designs.

References

[1]

Ivica Aracic, Vaidas Gasiunas, Mira Mezini, and Klaus Ostermann. An overview of Caesar J. Transactions on Aspect-Oriented Software Development, LNCS, 3880:135--173, February 2006.

Digital Library

[2]

David Aspinall and Martin Hofmann. Dependent types. Chapter in {26}.

[3]

Gilad Bracha. The Programming Language Jigsaw: Mixins, Modularity and Multiple Inheritance. PhD thesis, University of Utah, 1992.

Digital Library

[4]

David Clarke. Object Ownership and Containment. PhD thesis, School of Computer Science and Engineering, University of New South Wales, Sydney, Australia, 2001.

Digital Library

[5]

David Clarke. Nested classes, nested objects, and ownership. Invited talk at FOOL/WOOD, January 2006.

[6]

David Clarke, Sophia Drossopoulou, James Noble, and Tobias Wrigstad. Tribe: More types for virtual classes, available from http://slurp.doc.ic.ac.uk/pubs.html#tribe, December 2005.

[7]

David Clarke and Tobias Wrigstad. External uniqueness is unique enough. In Proceedings of the 17th European Conference on Object-Oriented Programming (ECOOP), Darmstadt, Germany, 2003.

[8]

Vincent Cremet, François Garillot, Sergueï Lenglet, and Martin Odersky. A core calculus for Scala type checking. In Rastislav Kralovic and Pawel Urzyezyn, editors, Mathematical Foundations of Computer Science 2006, 31st International Symposium, MFCS 2006, Stará Lesná, Slovakia, August 28-September 1, 2006, Proceedings, volume 4162 of Lecture Notes in Computer Science, pages 1--23. Springer, 2006.

Digital Library

[9]

Robert DeLine and Manuel Fähndrich. The Fugue protocol checker: Is your software baroque? Technical Report MSR-TR-2004-07, Microsoft Research, 2003.

[10]

Erik Ernst. gBeta---A Language with Virtual Attributes, Block Structure, and Propagating, Dynamic Inheritiance. PhD thesis, University of Aarhus, Denmark, 1999.

[11]

Erik Ernst. Family polymorphism. In Proceedings of the 15th European Conference on Object-Oriented Programming, London, UK, 2001. Springer-Verlag.

Digital Library

[12]

Erik Ernst, Klaus Ostermann, and William R. Cook. A virtual class calculus. In Proceedings of Principles of Programming Languages (POPL), Charleston, South Carolina, USA, January 2006.

Digital Library

[13]

Martin Odersky et al. An overview of the Scala programming language. Technical Report IC/2004/64, EPFL Lausanne, Switzerland, 2004.

[14]

Manuel Fähndrich and K. Rustan M. Leino. Declaring and checking non-null types in an object-oriented language. In OOPSLA '03: Proceedings of the 18th annual ACM SIGPLAN conference on Object-oriented programing, systems, languages, and applications, 2003.

Digital Library

[15]

Types Forum. Completeness of subtype judgments. Discussions April 25 and onwards, 2006. http://lists.seas.upenn.edu/pipermail/types-list.

[16]

James Gosling, Bill Joy, Guy Steele, and Gilad Bracha. Java Language Specification. Addison-Wesley Professional, 3rd edition, 2005.

Digital Library

[17]

Atsushi Igarashi, Chieri Saito, and Mirko Viroli. Lightweight family polymorphism. In Proceedings of the 3rd Asian Symposium on Programming Languages and Systems (APLAS'05), volume 3780 of LNCS, Tsukuba, Japan, 2005.

Digital Library

[18]

Paul Jolly, Sophia Drossopoulou, Christopher Anderson, and Klaus Ostermann. Simple dependent types: Concord. In 6th ECOOP Workshop on Formal Techniques for Java-like Languages, June 2004.

[19]

Kitt. Wikipedia Article. http://en.wikipedia.org/wiki/KITT.

[20]

Ole Lehrmann Madsen and Birger Møller-Pedersen. Virtual classes--- a powerful mechanism in object-oriented programming. In OOPSLA '89: Proceedings of the 4th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications, 1989.

Digital Library

[21]

Ole Lehrmann Madsen, Birger Møller-Pedersen, and Kristen Nygaard. Object-Oriented Programming in the BETA Programming Language. Addison-Wesley, Reading, MA, USA, 1993.

Digital Library

[22]

Jan-Willem Maessen and Xiaowei Shen. Improving the Java memory model using CRF. In OOPSLA '00: Proceedings of the 15th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications, 2000.

Digital Library

[23]

Mira Mezini and Klaus Ostermann. Conquering aspects with Caesar. In Mehmet Aksit, editor, Proceedings of the 2nd International Conference on Aspect-Oriented Software Development (AOSD), pages 90--100, Boston, USA, March 2003.

Digital Library

[24]

Nathaniel Nystrom, Sephen Chong, and Andrew C. Myers. Scalable extensibility via nested inheritance. In Proceedings of Objects, Programming Langages, Systems and Applications (OOPSLA), Vancouver, Canada, October 2004.

Digital Library

[25]

Martin Odersky, Vincent Cremet, Christine Röckl, and Matthias Zenger. A nominal theory of objects with dependent types. In Luca Cardelli, editor, ECOOP 2003 - Object-Oriented Programming, 17th European Conference, Darmstadt, Germany, July 21--25, 2003, Proceedings, volume 2743 of Lecture Notes in Computer Science, pages 201--224. Springer, 2003.

[26]

Benjamin Pierce, editor. Advanced Topics in Types and Programming Languages. MIT Press, 2004.

Digital Library

[27]

Nathanael Schärli, Stéphane Ducasse, Oscar Nierstrasz, and Andrew P. Black. Traits: Composable units of behaviour. In Luca Cardelli, editor, ECOOP 2003 - Object-Oriented Programming: 17th European Conference, volume 2473 of Lecture Notes In Computer Science, pages 248--274. Springer-Verlag, July 2003.

[28]

Bjarne Stroustroup. The C++Programming Language. Addison-Wesley, 3rd edition, 1997.

Digital Library

[29]

Andrew K. Wright and Matthias Felleisen. A syntactic approach to type soundness. Information and Computation, 115(1):38--94, 1994.

Digital Library

[30]

Tobias Wrigstad. Ownership-Based Alias Management. PhD thesis, Department of Computer and Systems Science, Royal Institute of Technology, Kista, Stockholm, May 2006.

Cited By

Ye WSun YOliveira B(2024)Imperative Compositional Programming: Type Sound Distributive Intersection Subtyping with References via Bidirectional TypingProceedings of the ACM on Programming Languages10.1145/36897828:OOPSLA2(2010-2039)Online publication date: 8-Oct-2024
https://dl.acm.org/doi/10.1145/3689782
Kravchuk-Kirilyuk AFeng GIskander JZhang YAmin N(2024)Persimmon: Nested Family Polymorphism with Extensible Variant TypesProceedings of the ACM on Programming Languages10.1145/36498368:OOPSLA1(698-724)Online publication date: 29-Apr-2024
https://dl.acm.org/doi/10.1145/3649836
Jin EAmin NZhang Y(2023)Extensible Metatheory Mechanization via Family PolymorphismProceedings of the ACM on Programming Languages10.1145/35912867:PLDI(1608-1632)Online publication date: 6-Jun-2023
https://dl.acm.org/doi/10.1145/3591286
Show More Cited By

Index Terms

Tribe: a simple virtual class calculus
1. Software and its engineering
  1. Software notations and tools
    1. Formal language definitions
    2. General programming languages
      1. Language features
2. Theory of computation
  1. Formal languages and automata theory
  2. Semantics and reasoning
    1. Program constructs
    2. Program semantics

Recommendations

Coinductive Axiomatization of Recursive Type Equality and Subtyping

We present new sound and complete axiomatizations of type equality and subtype inequality for a first-order type language with regular recursive types. The rules are motivated by coinductive characterizations of type containment and type equality via ...
On the power of coercion abstraction
POPL '12

Erasable coercions in System F-eta, also known as retyping functions, are well-typed eta-expansions of the identity. They may change the type of terms without changing their behavior and can thus be erased before reduction. Coercions in F-eta can model ...
System F with coercion constraints
CSL-LICS '14: Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)

We present a second-order λ-calculus with coercion constraints that generalizes a previous extension of System F with parametric coercion abstractions by allowing multiple but simultaneous type and coercion abstractions, as well as recursive coercions ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

AOSD '07: Proceedings of the 6th international conference on Aspect-oriented software development

March 2007

246 pages

ISBN:1595936157

DOI:10.1145/1218563

Conference Chair:
Brian Barry
Bedarra Research Labs, Canada

Copyright © 2007 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Google Inc.
IBMR: IBM Research
AOSA: Aspect-Oriented Software Association
AOSD-Europe: European Network of Excellence on Aspect-Oriented Software Development
Eclipse Foundation

In-Cooperation

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 14 March 2007

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

AOSD07

Sponsor:

IBMR
AOSA

AOSD07: 6th International Conference on Aspect-Oriented Software Development

March 12 - 16, 2007

British Columbia, Vancouver, Canada

Acceptance Rates

Overall Acceptance Rate 41 of 139 submissions, 29%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

65
Total Citations
View Citations
528
Total Downloads

Downloads (Last 12 months)3
Downloads (Last 6 weeks)0

Reflects downloads up to 27 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Ye WSun YOliveira B(2024)Imperative Compositional Programming: Type Sound Distributive Intersection Subtyping with References via Bidirectional TypingProceedings of the ACM on Programming Languages10.1145/36897828:OOPSLA2(2010-2039)Online publication date: 8-Oct-2024
https://dl.acm.org/doi/10.1145/3689782
Kravchuk-Kirilyuk AFeng GIskander JZhang YAmin N(2024)Persimmon: Nested Family Polymorphism with Extensible Variant TypesProceedings of the ACM on Programming Languages10.1145/36498368:OOPSLA1(698-724)Online publication date: 29-Apr-2024
https://dl.acm.org/doi/10.1145/3649836
Jin EAmin NZhang Y(2023)Extensible Metatheory Mechanization via Family PolymorphismProceedings of the ACM on Programming Languages10.1145/35912867:PLDI(1608-1632)Online publication date: 6-Jun-2023
https://dl.acm.org/doi/10.1145/3591286
Zhang WSun YOliveira B(2021)Compositional ProgrammingACM Transactions on Programming Languages and Systems10.1145/346022843:3(1-61)Online publication date: 3-Sep-2021
https://dl.acm.org/doi/10.1145/3460228
Willis JWu NPickering M(2020)Staged selective parser combinatorsProceedings of the ACM on Programming Languages10.1145/34090024:ICFP(1-30)Online publication date: 3-Aug-2020
https://dl.acm.org/doi/10.1145/3409002
Montagu BJensen T(2020)Stable relations and abstract interpretation of higher-order programsProceedings of the ACM on Programming Languages10.1145/34090014:ICFP(1-30)Online publication date: 3-Aug-2020
https://dl.acm.org/doi/10.1145/3409001
Selsam DHudon Sde Moura L(2020)Sealing pointer-based optimizations behind pure functionsProceedings of the ACM on Programming Languages10.1145/34089974:ICFP(1-20)Online publication date: 3-Aug-2020
https://dl.acm.org/doi/10.1145/3408997
Giarrusso PStefanesco LTimany ABirkedal LKrebbers R(2020)Scala step-by-step: soundness for DOT with step-indexed logical relations in IrisProceedings of the ACM on Programming Languages10.1145/34089964:ICFP(1-29)Online publication date: 3-Aug-2020
https://dl.acm.org/doi/10.1145/3408996
Darragh PAdams M(2020)Parsing with zippers (functional pearl)Proceedings of the ACM on Programming Languages10.1145/34089904:ICFP(1-28)Online publication date: 3-Aug-2020
https://dl.acm.org/doi/10.1145/3408990
Schuster PBrachthäuser JOstermann K(2020)Compiling effect handlers in capability-passing styleProceedings of the ACM on Programming Languages10.1145/34089754:ICFP(1-28)Online publication date: 3-Aug-2020
https://dl.acm.org/doi/10.1145/3408975
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents