Binding Performance at Language Design Time
An important research goal in software engineering and programming languages is the development of principles underlying the specification of computable problems, the translation of these problems into efficient and correct programs, and the performance analysis of these programs. This paper uncovers some of these principles, which are used to design a problem specification language L1 restricted to problems that can be compiled automatically into programs whose worst case asymptotic time and space complexities are linear in the input/output space. Any problem expressible in L1 can be compiled into a linear cost program. A compiler for L1 has been implemented in the RAPTS transformational programming system.
J. Cai and R. Paige, "Binding Performance at Language Design Time," Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, Association for Computing Machinery (ACM), Jan 1987.
The definitive version is available at http://dx.doi.org/10.1145/41625.41633
14th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages
Mathematics and Statistics
Article - Conference proceedings
© 1987 Association for Computing Machinery (ACM), All rights reserved.