Static type checking of multi-methods

Agrawal, Rakesh; DeMichiel, Linda G.; Lindsay, Bruce G.

doi:10.1145/117954.117963

Cited by 61 publications

(28 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This is analogous to the problem that arises in multiple dispatching as needed for multi-methods (cf. [1,6]), since choosing a method requires the run-time type not of a single input element, but of a set of input elements. Thus, the method whose run-time types most closely match the statically specified types should be dispatched at run-time.…”

Section: (D))mentioning

confidence: 99%

A Comparison of Rule Inheritance in Model-to-Model Transformation Languages

Wimmer

Kappel

Kusel

et al. 2011

Theory and Practice of Model Transformations

View full text Add to dashboard Cite

Abstract. Although model transformations presumably play a major role in Model-Driven Engineering, reuse mechanisms such as inheritance have received little attention so far. In this paper, we propose a comparison framework for rule inheritance in declarative model-to-model transformation languages, and provide an in-depth evaluation of three prominent representatives thereof, namely ATL, ETL (declarative subsets thereof), and TGGs. The framework provides criteria for comparison along orthogonal dimensions, covering static aspects, which indicate whether a set of inheriting transformation rules is well-formed at compiletime, and dynamic aspects, which describe how inheriting rules behave at run-time. The application of this framework to dedicated transformation languages shows that, while providing similar syntactical inheritance concepts, they exhibit different dynamic inheritance semantics and offer basic support for checking static inheritance constraints, only.

show abstract

Section: (D))mentioning

confidence: 99%

A Comparison of Rule Inheritance in Model-to-Model Transformation Languages

Wimmer

Kappel

Kusel

et al. 2011

Theory and Practice of Model Transformations

View full text Add to dashboard Cite

show abstract

“…In this section, we introduce our notations for the types and methods of a schema, mostly defined in [ADL91]. Then, we define the behavioral consistency rules and how they impact on structural consistency through encapsulation.…”

Section: Schema Consistencymentioning

confidence: 99%

“…We focus on the motivations for such an approach and the type checking of statements in the presence of exceptions to behavioral consistency. Our results apply to object-oriented databases that support run-time method selection using either a single method's argument (mono-methods) or all method's arguments (multi-methods) as in recent systems like CLOS [BDG 88], Polyglot [ADL91], and Cecil [Cha92].…”

Section: Introductionmentioning

confidence: 99%

Type-safe relaxing of schema consistency rules for flexible modelling in OODBMS

Amiel¹,

Bellosta

Dujardin

et al. 1996

The VLDB Journal The International Journal on Very Large Data B

View full text Add to dashboard Cite

Object-oriented databases enforce behavioral schema consistency rules to guarantee type safety, i.e., that no run-time type error can occur. When the schema must evolve, some schema updates may violate these rules. In order to maintain behavioral schema consistency, traditional solutions require significant changes to the types, the type hierarchy and the code of existing methods. Such operations are very expensive in a database context. To ease schema evolution, we propose to support exceptions to the behavioral consistency rules without sacrificing type safety. The basic idea is to detect unsafe statements in a method code at compile-time and check them at run-time. The run-time check is performed by a specific clause that is automatically inserted around unsafe statements. This check clause warns the programmer of the safety problem and lets him provide exception-handling code. Schema updates can therefore be performed with only minor changes to the code of methods. Key-words:Object-oriented databases, schema evolution, type safety, covariance, contravariance. Relachement des règles de cohérence de schéma avec typage sûr pour une modélisation souple dans les SGBDOO Résumé : Les bases de donnéesà objets imposent aux schémas des règles de cohérence qui garantissent la sûreté de typage, c'est-à-dire qu'aucune erreur de type ne peut survenirà l'exécution. Lorsque le schéma doitévoluer, certaines misesà jour peuvent violer ces règles. Pour conserver la cohérence comportementale du schéma, les solutions traditionnelles nécessitent des modifications significatives des types, de leur hiérarchie ainsi que du code des méthodes pré-existantes. Ces opé-rations sont très coûteuses pour une base de donnée. Afin de faciliter l'évolution de schéma, nous proposons de supporter des exceptionsà ces règles de cohérence, sans sacrifier la sûreté de typage pour autant. L'idée essentielle est de détecter les instructions non sûresà la compilation, et de les vérifierà l'exécution. La vérification est effectuée graceà une opération particulière qui entoure automatiquement toute instruction non sûre. Cette opération avertit le programmeur du problème de sûreté, et lui permet de fournir le code de traitement de l'exception. Les misesà jour du schéma peuvent ainsiêtre effectuées, avec seulement des modifications mineures du code des méthodes.

show abstract

“…The message-passing style of method invocation restricts the way in which relations between objects can be expressed [2].…”

Section: Introductionmentioning

confidence: 99%

“…In order to model a computational domain such as the matrix domain it is desirable to also support functions with more than one argument, corresponding to multi-methods [2] in object-oriented languages. This provides a natural way to represent, e.g., matrix operators applied on various kinds of matrix representations.…”

Section: Introductionmentioning

confidence: 99%

Representing Matrices Using Multi-Directional Foreign Functions

Orsborn

Risch

Flodin

2004

The Functional Approach to Data Management

View full text Add to dashboard Cite

New application areas for database technology such as computer-aided design and analysis systems require a semantically rich data model, high performance, extensibility, and application oriented queries. We have built a system for finite element analysis using a functional database management system to represent multiple matrix representations. The functional data model is well suited for managing the data complexity and representation needs of such applications. Our application domain needs multiple customized numerical data representations, user-defined (foreign) functions, multiply inherited types, and overloading of multiargument functions. Type inheritance and overloading requires the support for late binding of function calls in queries. Furthermore, queries may use functions as relationships which means that the system needs to process inverses of both tabulated and foreign functions, multi-directional functions. It is shown how to model matrix algebra operators using multidirectional foreign functions and how to process queries to these functions.

show abstract

Static type checking of multi-methods

Cited by 61 publications

References 10 publications

A Comparison of Rule Inheritance in Model-to-Model Transformation Languages

A Comparison of Rule Inheritance in Model-to-Model Transformation Languages

Type-safe relaxing of schema consistency rules for flexible modelling in OODBMS

Representing Matrices Using Multi-Directional Foreign Functions

Contact Info

Product

Resources

About