A model for implementing Euclid modules and type templates

Abstract

The structuring of data has become a central theme in programming language research. The ultimate utility of data structuring techniques such as clustering and type parameterization mechanisms will, however be determined in large part by our ability to provide understandable and efficient implementations. This paper presents an implementation model for the data clustering and type parameterization facilities in Euclid. This model provides a basis for understanding the compile-time and run-time mechanisms necessary to support these features. It is an extension of the implementation model that has traditionally been used for Algol-like languages. Another implementation model (for CLU) has been described in [Atkinson, et.al., 1978].