TEMPO: A Unified Treatment of Binding Time and Parameter Passing Concepts in Programming Languages pp 103-107 | Cite as
Conlusions
Chapter
First Online:
Keywords
Programming Language Assembly Language Denotational Semantic Text Dynamic Binding Time
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
- [1]American National Standard COBOL (ANS X3.23-1968), American National Standards Institute, New York, 1968.Google Scholar
- [2]American National Standard FORTRAN (ANS X3.9-1966), American National Standards Institute, New York, 1966.Google Scholar
- [3]American National Standard Programming Language PL/I (ANS X3.53-1976), American National Standards Institute, New York, 1977.Google Scholar
- [4]Birtwistle, Graham M., Ole-Johan Dahl, Bjørn Myhrhaug & Kristen Nygaard, SIMULA BEGIN, Auerbach Publishers, Philadelphia, 1973.Google Scholar
- [5]Bobrow, Daniel G. & Bertram Raphael, New Programming Languages for Artificial Intelligence Research, Computing Surveys, vol. 6, no. 3, September 1974, pp. 155–174.Google Scholar
- [6]Church, Alonzo, The Calculi of Lambda-Conversion, Princeton University Press, Princeton, 1941.Google Scholar
- [7]Dahl, Ole-Johan, Edsger W. Dijkstra & C. A. R. Hoare, Structured Programming, Academic Press, New York, 1972.Google Scholar
- [8]Dennis, Jack B., First Version of a Data Flow Procedure Language, Proceedings of a Symposium on Programming, Institut de Programmation, University of Paris, Paris, France, April 1974, pp. 241–271.Google Scholar
- [9]Griswold, Ralph E., J. F. Poage & I. P. Polonsky, The SNOBOL4 Programming Language, second edition, Prentice-Hall, Inc., Englewood Cliffs, New Jersey, 1971.Google Scholar
- [10]Guttag, John V., The Specification and Application to Programming of Abstract Data Types, Technical Report CSRG-59, Computer Science Research Group, University of Toronto, Toronto, Canada, September 1975.Google Scholar
- [11]Hoare, C. A. R. & Peter E. Lauer, Consistent and Complementary Formal Theories of the Semantics of Programming Languages, Acta Informatica, vol. 3, 1974, pp. 135–153.Google Scholar
- [12]Iverson, Kenneth E., A Programming Language, John Wiley, New York, 1962.Google Scholar
- [13]Jones, Neil D. & Steven S. Muchnick, Binding Time Optimization in Programming Languages: An Approach to the Design of an Ideal Language, Conference Record of the Third ACM SIGACT — SIGPLAN Symposium on Principles of Programming Languages, Atlanta, Georgia, January 1976, pp. 77–94.Google Scholar
- [14]Kernighan, Brian W. & Dennis M. Ritchie, The C Programming Language, Prentice-Hall, Englewood Cliffs, N. J., 1978.Google Scholar
- [15]Leavenworth, B. M., Syntax Macros and Extended Translation, Communications of the ACM, vol. 9, no. 11, November 1966, pp. 790–793.Google Scholar
- [16]Ledgard, Henry, A Model For Type Checking — with an Application to Algol 60, Communications of the ACM, vol. 15, no. 11, November 1972, pp. 956–966.Google Scholar
- [17]Liskov, Barbara H. & Stephen N. Zilles, Programming with Abstract Data Types, SIGPLAN Notices, vol. 6, no. 4, April 1974, pp. 50–59.Google Scholar
- [18]Marcotty, Michael, Henry F. Ledgard & Gregor V. Bochmann, A Sampler of Formal Definitions, Computing Surveys, vol. 8, no. 2, June 1976, pp. 191–276.Google Scholar
- [19]McCarthy, John, Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part 1, Communications of the ACM, vol. 3, no. 4, April 1960, pp. 184–195.Google Scholar
- [20]Milne, Robert & Christopher Strachey, A Theory of Programming Language Semantics, Chapman & Hall, London; John Wiley, New York, 1976.Google Scholar
- [21]Naur, Peter, et al., Report on the Algorithmic Language ALGOL 60, Communications of the ACM, vol. 3, no. 5, May 1960, pp. 299–314.Google Scholar
- [22]Naur, Peter, et al., Revised Report on the Algorithmic Language ALGOL 60, Communications of the ACM, vol. 6, no. 1, January 1963, pp. 1–17.Google Scholar
- [23]Pratt, Terrence W., Programming Languages: Design and Implementation, Prentice-Hall, Inc., Englewood Cliffs, New Jersey, 1975.Google Scholar
- [24]Richards, Martin, BCPL, A Tool For Compiler Writing and System Programming, 1969 Spring Joint Computer Conference Proceedings, pp. 557–566.Google Scholar
- [25]Siklóssy, Laurent, Let's Talk LISP, Prentice-Hall, Inc., Englewood Cliffs, New Jersey, 1976.Google Scholar
- [26]Steele, Guy L., Jr., & Gerald J. Sussman, LAMBDA: The Ultimate Imperative, AI Memo No. 353, Massachusetts Institute of Technology, March 1976.Google Scholar
- [27]Stoy, Joseph E., Denotational Semantics: The Scott — Strachey Approach to Programming Language Theory, M.I.T. Press, Cambridge, Mass., 1977.Google Scholar
- [28]Sussman, Gerald J. & Guy L. Steele Jr., SCHEME: An Interpreter for Extended Lambda Calculus, AI Memo No. 349, Massachusetts Institute of Technology, December 1975.Google Scholar
- [29]Teitelman, Warren, INTERLISP Reference Manual, Xerox Palo Alto Research Center, Palo Alto, Calif., 1974.Google Scholar
- [30]Tesler, Lawrence G., Horace J. Enea & David C. Smith, The LISP70 Pattern Matching System, Third International Joint Conference on Artificial Intelligence, Stanford, California, August 1973, pp. 671–676.Google Scholar
- [31]Wegner, Peter, Data Structure Models for Programming Languages, Proceedings of a Symposium on Data Structures in Programming Languages, SIGPLAN Notices, vol. 6, no. 2, February 1971, pp. 1–54.Google Scholar
- [32]van Wijngaarden, A. et al. (ed.), Revised Report on the Algorithmic Language ALGOL 68, Springer — Verlag, Berlin, 1976.Google Scholar
- [33]Wirth, Niklaus, Algorithms + Data Structures = Programs, Prentice-Hall, Englewood Cliffs, N.J., 1976.Google Scholar
- [34]Wirth, Niklaus, The Programming Language PASCAL, Acta Informatica, vol. 1, no. 1, 1971, pp. 35–63.Google Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 1978