An imperative type hierarchy with partial products
A type hierarchy for a programming language defines an ordering on the types such that any application for small types may be reused for all larger types. The imperative facet makes this non-trivial; the straight-forward definitions will yield an inconsistent system. We introduce a new type constructor, the partial product, and show how to define a consistent hierarchy in the context of fully recursive types. A simple polymorphism is derived by introducing a notion of placeholder types. By extending the partial product types to include structural invariants we obtain a particularly appropriate notation for defining recursive types, that is superior to traditional type sums and products. We show how the ordering on types extends to an ordering on types with invariants. We allow the use of least upper bounds in type definitions and show how to compute upper bounds of invariants.
Unable to display preview. Download preview PDF.
- [Barendregt84]H. Barendregt. “The Lambda Calculus, Its Syntax and Semantics.”, North Holland, 1984.Google Scholar
- [Cardelli84]L. Cardelli. “A semantics of multiple inheritance.” In Semantics of Data Types, LNCS 173, Springer-Verlag 1984.Google Scholar
- [Cardelli85]L. Cardelli. “Amber.” Proceedings of the Treizieme Ecole de Printemps d'Informatique Theorique, May 1985.Google Scholar
- [Dahl70]O.J. Dahl, B. Myrhaug, K. Nygaard, “Simula Information, Common Base Language.”, Norwegian Computing Center, October 1970.Google Scholar
- [Reynolds85]J.C. Reynolds, “Three approaches to type structure.”, In Mathematical Foundations of Software Development, LNCS 185, Springer-Verlag, 1985.Google Scholar
- [Tennent88]R.D. Tennent, “Denotational Semantics of Algol-Like Languages.”, To appear in Handbook of Logic in Computer Science, Vol.II, Oxford University Press.Google Scholar
- [Wirth88]N. Wirth, “Type Extensions.”, In Transactions on Programming Languages and Systems, Vol.10, No.2, 1988.Google Scholar