On display optimization for Algol-like languages

Computer Languages - Tập 15 - Trang 27-39 - 1990
J.R. Nawrocki1, C.H.A. Koster2
1Osrodek Informatyki, Politechnika Poznanska, Pl. M. Curie 5, 60-965 Poznan, Poland
2Informatica I, Katholieke Universiteit, Toernooiveld 1, 6525 ED Nijmegen, The Netherlands

Tài liệu tham khảo

Dijkstra, 1969, Recursive programming Bartol, 1983, Semantics and implementation of prefixing at many levels Bauer, H., Becker, S. and Graham, S. Algol W implementation. Technical Report No. CS98, Computer Science Department, Stanford University. Brinch Hansen, 1973 Aho, 1986 Krause, 1985, Concatenation of program modules. An algebraic approach to the semantics and implementation problems Morrison, 1977, A method for implementing procedure entry and exit in block structured high level languages, Software—Pract. Exper., 7, 537, 10.1002/spe.4380070414 Harris, 1985, Resetting displays, SIGPLAN Not., 20, 73, 10.1145/988346.988356 Rohl, 1975 Clarke, 1979, Programming language constructs for which it is impossible to obtain good Hoare Axiom Systems, J. ACM, 26, 129, 10.1145/322108.322121 Cook, 1978, Soundness and completeness of an axiom system for program verification, SIAM J. Comput., 7, 70, 10.1137/0207005 Garey, 1979 Kubale, 1985, A generalized implicit enumeration algorithm for graph coloring, Commun. ACM, 28, 412, 10.1145/3341.3350 Murtagh, 1984, A less dynamic memory allocation scheme for ALGOL-like languages, 283 Christofides, 1975 Welsh, 1967, An upper bound for the chromatic number of a graph and its application to timetabling problems, Comput. J., 10, 85, 10.1093/comjnl/10.1.85