Abstract
As a support for writing software, a comprehensive set of problem oriented languages appears preferable to any so-called universal language, as soon as static checking is sufficient to ensure type correctness of the mixed language program. We lay the basis for a mixed language system where this requirement is fulfilled. The general outline of the system is first sketched. Detailed consideration is then given to our basic constructs for establishing communication between languages, namely “standard” types and “foreign” types. “Abstract” types, such as defined in CLU, are finally shown to be a particular class of “foreign” types.
Similar content being viewed by others
References
C. A. Lang,Languages for writing systems programs, inSoftware Engineering Techniques, Buxton and Randell Ed., Nato Conference report, pp. 101–106, April 1970.
C. M. Geschke, J. H. Morris and E. W. Satterthwaite,Some experience with MESA, Commun. Ass. Comput. Mach., vol. 20, pp. 540–553, August 1977.
D. L. Parnas,On the criteria to be used in decomposing systems into modules, Commun. Ass. Comput. Mach., vol. 15, pp. 1053–1058, December 1972.
B. H. Liskov and S. N. Zilles,Programming with abstract data types, inProc. ACM-SIGPLAN conf. on Very High Level Languages, also SIGPLAN Notices, vol. 9, pp. 50–59, April 1974.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Darondeau, P., Le Guernic, P. & Raynal, M. Types in a mixed language system. BIT 21, 245–254 (1981). https://doi.org/10.1007/BF01941461
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01941461