A model for implementing Euclid modules and type templates

Authors:
Richard C. Holt;David B. Wortman
Affiliations:
Computer Systems Research Group, University of Toronto, Toronto, Canada;Computer Systems Research Group, University of Toronto, Toronto, Canada
Venue:
SIGPLAN '79 Proceedings of the 1979 SIGPLAN symposium on Compiler construction
Year:
1979

Citing 6
Cited 7

Programming languages: design and implementation (2nd ed.)

Programming languages: design and implementation (2nd ed.)
The Euclid Language: a progress report

ACM '78 Proceedings of the 1978 annual conference
Aspects Of Implementing CLU

ACM '78 Proceedings of the 1978 annual conference
Notes on the design of Euclid

Proceedings of an ACM conference on Language design for reliable software
Report on the programming language Euclid

ACM SIGPLAN Notices
Algol-60 Implementation

Algol-60 Implementation

A Model for Implementing EUCLID Modules and Prototypes

ACM Transactions on Programming Languages and Systems (TOPLAS)
Sharing code among instances of Ada generics

SIGPLAN '84 Proceedings of the 1984 SIGPLAN symposium on Compiler construction
A programmer controlled approach to data and control abstraction

Proceedings of the 1983 ACM SIGPLAN symposium on Programming language issues in software systems
A runtime representation for Ada variables and types

SIGPLAN '80 Proceedings of the ACM-SIGPLAN symposium on The ADA programming language
A runtime representation for Ada variables and types

SIGPLAN '80 Proceedings of the ACM-SIGPLAN symposium on Ada programming language
Rationale for the design of the Ada programming language

ACM SIGPLAN Notices - Rationale for the deisgn of the Ada programming language
Euclid: a language for compiling quality software

AFIPS '81 Proceedings of the May 4-7, 1981, national computer conference

Quantified Score

Hi-index	0.00

Visualization

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].