Integrating subtyping, matching and type quantification: A practical perspective

6Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We report on our experience gained in designing, implementing and using a strongly-typed persistent programming language (TooL) which integrates object types, subtyping, type matching, and type quantification. Our work complements recent type-theoretical studies of sub-typing and type matching by focusing on the issue of how to integrate both concepts into a practical, orthogonal programming language. We also shed some light on the subtle typing issues which we encountered during the construction of a substantial bulk data library where it was necessary to trade-off subtyping against type matching. Our practical experience suggests that the benefits of an integration of subtyping and type matching are achieved at the expense of a significant increase in modeling complexity.

Cite

CITATION STYLE

APA

Gawecki, A., & Matthes, F. (1996). Integrating subtyping, matching and type quantification: A practical perspective. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1098, pp. 26–47). Springer Verlag. https://doi.org/10.1007/bfb0053055

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free