Classboxes: an experiment in modeling compositional abstractions using explicit contexts

Authors:
Markus Lumpe;Jean-Guy Schneider
Affiliations:
Iowa State University, Atanasoff Hall, Ames;Swinburne University of Technology, Hawthorn, Australia
Venue:
SAVCBS '05 Proceedings of the 2005 conference on Specification and verification of component-based systems
Year:
2005

Citing 12
Cited 1

Self: The power of simplicity

OOPSLA '87 Conference proceedings on Object-oriented programming systems, languages and applications
Mixin-based inheritance

OOPSLA/ECOOP '90 Proceedings of the European conference on object-oriented programming on Object-oriented programming systems, languages, and applications
Software engineering (3rd ed.): a practitioner's approach

Software engineering (3rd ed.): a practitioner's approach
A lambda-calculus for dynamic binding

Theoretical Computer Science - Special issue: theoretical aspects of coordination languages
Communicating and mobile systems: the &pgr;-calculus

Communicating and mobile systems: the &pgr;-calculus
Component Software: Beyond Object-Oriented Programming

Component Software: Beyond Object-Oriented Programming
Essentials of Constraint Programming

Essentials of Constraint Programming
A form-based meta-model for software composition

Science of Computer Programming - Special issue on new software composition concepts
Classbox/J: controlling the scope of change in Java

OOPSLA '05 Proceedings of the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
C# to the Point

C# to the Point
Classboxes: controlling visibility of class extensions

Computer Languages, Systems and Structures
A lambda calculus with forms

SC'05 Proceedings of the 4th international conference on Software Composition

On the integration of classboxes into c#

SC'06 Proceedings of the 5th international conference on Software Composition

Quantified Score

Hi-index	0.00

Visualization

Abstract

The development of flexible and reusable abstractions for software composition has suffered from the inherent problem that reusability and extensibility are hampered by the dependence on position and arity of parameters. In order to address this issue, we have defined λF, a substitution-free variant of the λ-calculus where names are replaced with first-class namespaces and parameter passing is modeled using explicit contexts. We have used λF to define a model for classboxes, a dynamically typed module system for object-oriented languages that provides support for controlling both the visibility and composition of class extensions. This model not only illustrates the expressive power and flexibility of λF as a suitable formal foundation for compositional abstractions, but also assists us in validating and extending the concept of classboxes in a language-neutral way.