Type checking, separate compilation and reusability

Authors:
Michael R. Levy
Affiliations:
University of Victoria, Victoria, B.C. V8W 2Y2, Canada
Venue:
SIGPLAN '84 Proceedings of the 1984 SIGPLAN symposium on Compiler construction
Year:
1984

Citing 5
Cited 4

A Scheme for the Automatic Inference of Variable Types

Journal of the ACM (JACM)
An Efficient Unification Algorithm

ACM Transactions on Programming Languages and Systems (TOPLAS)
Inferring types in Smalltalk

POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A type-checking program linkage system for pascal

ICSE '78 Proceedings of the 3rd international conference on Software engineering
Nesting in Ada programs is for the birds

SIGPLAN '80 Proceedings of the ACM-SIGPLAN symposium on The ADA programming language

The AdaPIC Tool Set: Supporting Interface Control and Analysis Throughout the Software Development Process

IEEE Transactions on Software Engineering
Smartest recompilation

POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The cost of selective recompilation and environment processing

ACM Transactions on Software Engineering and Methodology (TOSEM)
Interface control and incremental development in the PIC environment

ICSE '85 Proceedings of the 8th international conference on Software engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

A strategy for performing type checking on programs built out of separately compiled parts is presented. This strategy is used in a programming environment that allows small components of a software system to be reconfigured in different ways. The strategy works by inferring type schemas for all of the undeclared functions used by a component and then unifying each schema with a program library when a configuration is built.