Abstract
Although very high level languages offer advantages in expressivity, their naive implementations frequently suffer from run-time inefficiencies. In this paper we review some of the work aimed at improving the execution characteristics of such languages.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Goldberg, P.C., The Design of Very High Level Languages. This volume.
APL/360 Primer. IBM Corp. Doc. No. GH20-0689.
Schwartz, J., On Programming, An Interim Report on the SETL Project. Comp. Sci. Dept., Courant Inst., New York Univ., 1973.
Aho, A.V., and Ullman, J.D., Principles of Compiler Design, Addison-Wesley, Reading, Mass., 1977.
Weihl, W.E., Interprocedural Data Flow Analysis in the Presence of Pointers, Procedure and Label Variables. Proc., Seventh Annual ACM Symposium on the Principles of Programming Languages, 1980.
Harrison, W.H., and Johnson, S,C., Debate: The Role of Global Optimization in Compilers of the Future. Proc., Eigth Annual ACM Symposium on the Principles of Programming Languages, 1981.
Abrams, P.S., An APL Machine. Tech. Report No. 3, Digital Systems Laboratory, Stanford Electronics, Stanford, Calif., Feb., 1970.
Hassitt, A., and Lyon, L.E., Efficient Evaluation of Array Subscripts of Arrays, IBM J. of Research and Development, 16, 1, Jan., 1972.
Perlis, A.J., Steps Toward an APL Compiler, Computer Science Research Report 24, Yale U., January, 1974.
Guibas, L.J., and Wyatt, D.K., Compilation and Delayed Evaluation in APL. Proc. Fifth Annual ACM Symposium on Principles of Programming Languages, 1978.
Henderson, P. and Morris, J.H., A Lazy Evaluator, Proc. Third ACM Symposium on Principles of Programming Languages, 1976.
Van Dyke, E.J., A Dynamic Incremental Compiler for an Interpretive Language, Hewlett-Packard Journal 28, 11, July, 1977.
Bauer, A.M., and Saal, H.J., Does APL Really Need Runtime Checking?, Software-Practice and Experience 4, 1974.
Schwartz, J. T., Automatic Data Structure Choice in a Language of Very High Level, Comm. ACM 18, 12, 1975.
Dewar, R.B.K., et al, Programming by Refinement as Exemplified by the SETL Representation Sublanguage, ACM Trans, on Prog. Languages and Systems 1, 1, 1979.
Schonberg, E., et al, An Automatic Technique of Selection of Data Representations in SETL Programs, ACM Trans, on Prog. Languages and Systems 3, 2, 1981.
Freudenberger, S.F. et al, Experience with the SETL Optimizer, to appear.
Allen, F. E., Control Flow Analysis, Proc. Symp. Compiler Optimization, SIGPLAN Notices 5, 1970.
Allen, F.E., and Cocke J., A Program Data Flow Analysis Procedure, Comm. ACM 19, 3, 1976.
Tenenbaum, A., Automatic Type Analysis in a Very High Level Language, Ph.D. Dissertation, New York Univ., Oct., 1974.
Kaplan, M.A., and Ullman, J.D., A General Scheme for the Inference of Variable Types, Proc. Fifth Annual ACM Symposium on Principles of Programming Languages, 1978.
Suzuki, N., Inferring Types in Smalltalk, Proc. Eigth Annual ACM Symposium on Principles of Programming Languages, 1981.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1983 D. Reidel Publishing Company
About this paper
Cite this paper
Goldberg, P.C. (1983). Implementation Considerations in Very High Level Languages. In: Biermann, A.W., Guiho, G. (eds) Computer Program Synthesis Methodologies. NATO Advanced Study Institutes Series, vol 95. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-7019-9_5
Download citation
DOI: https://doi.org/10.1007/978-94-009-7019-9_5
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-009-7021-2
Online ISBN: 978-94-009-7019-9
eBook Packages: Springer Book Archive