Orthogonal type extensions and reductions

ABSTRACT

In this paper we present a generalization of Oberon's record type extensions. Our extension mechanism is orthogonally applicable to all the conventional data types found in Pascal-like languages. In order to balance the type system, we present an inverse concept, type reductions, that also can be applied to all the programmer-defined data types. These concepts provide flexible and powerful means for expressing universal subtyping and supertyping in a statically-typed programming language, as well as many possibilities for reuse of data types via a sound mathematical characterization of assignment statements. The presented ideas are under implementation in Alberich, a programming language that can be considered as a natural descendant of Oberon.

REFERENCES

• 1: [BrL88] Bruce K. B., Longo G.: A Modest Model of Records, Inheritance and Bounded Quantification. In: Proc. of the 3rd Annual Symposium on Logic in Computer Science, Edinburgh, 1988. IEEE, 1988, 38-50.
• 2: Luca Cardelli, A semantics of multiple inheritance., Proc. of the international symposium on Semantics of data types, p.51-67, July 1984, Sophia-Antipolis, France
• 3: L. Cardelli, Structural subtyping and the notion of power type, Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.70-79, January 10-13, 1988, San Diego, California, United States [doi>10.1145/73560.73566]
• 4: [Car89] Cardelli L.: Typeful Programming. Report 45, Systems Research Center, DEC, 1989.
• 5: Luca Cardelli , Peter Wegner, On understanding types, data abstraction, and polymorphism, ACM Computing Surveys (CSUR), v.17 n.4, p.471-523, Dec. 1985 [doi>10.1145/6041.6042]
• 6: L. Cardelli , J. Donahue , M. Jordan , B. Kalsow , G. Nelson, The Modula–3 type system, Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.202-212, January 11-13, 1989, Austin, Texas, United States [doi>10.1145/75277.75295]
• 7: [KaS89] Karhinen A., Silander T.: An Oberon Compiler (in Finnish). Report C-1989-53, Department of Computer Science, University of Helsinki, 1989.
• 8: John C. Mitchell, Coercion and type inference, Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.175-185, January 15-18, 1984, Salt Lake City, Utah, United States [doi>10.1145/800017.800529]
• 9: [MöT89] Mössenböck H., Templ J.: Object Oberon - A Modest Object-Oriented Language. Structured Programming 10, 4, 1989, 199-207.
• 10: D. Rémy, Type checking records and variants in a natural extension of ML, Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.77-88, January 11-13, 1989, Austin, Texas, United States [doi>10.1145/75277.75284]
• 11: R. Stansifer, Type inference with subtypes, Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.88-97, January 10-13, 1988, San Diego, California, United States [doi>10.1145/73560.73568]
• 12: [Wan87] Wand M.: Complete Type Inference for Simple Objects. In: Proc. of the 2nd Annual Symposium on Logic in Computer Science, Ithaca, New York, 1987. IEEE, 1987, 37-44.
• 13: N. Wirth, Type extensions, ACM Transactions on Programming Languages and Systems (TOPLAS), v.10 n.2, p.204-214, April 1988 [doi>10.1145/42190.46167]
• 14: N. Wirth, From modula to Oberon, Software—Practice & Experience, v.18 n.7, p.661-670, July 1988 [doi>10.1002/spe.4380180706]
• 15: N. Wirth, The programming language Oberon, Software—Practice & Experience, v.18 n.7, p.671-690, July 1988 [doi>10.1002/spe.4380180707]

INDEX TERMS

Primary Classification:
  D. Software
  D.3 PROGRAMMING LANGUAGES

Additional Classification:
  F. Theory of Computation
  F.3 LOGICS AND MEANINGS OF PROGRAMS

General Terms:
Design, Languages, Theory