- B1 BEECH, D. "A structural view of PL/I ." Computing Surveys 2, 1 (March 1970), 33-64. Google Scholar
- B2 BERRY, D.M. "Block structure: retention or deletion?" In Proc. 3rd Annual ACM Symposium on Theory of Computing, ACM, New York, 1971, 86-100. Google Scholar
- B3 BERRY, D. M. "Definition of the contour model in the Vienna Definition Language." TR 71-40, Center for Computer and Information Sciences, Brown University, Providence, R. I., April 1971.Google Scholar
- B4 BROOKER, R. A.; AND D. MORRIS. "A general translation program for phrase structure languages." J.ACM 9, 1 (Jan. 1962), 1-10. Google Scholar
- D1 DENNIS, J. B.; ANn S. PATIL, "Computation structures." Notes for MIT course 6.232, Sept. 1970.Google Scholar
- F1 FELDMAN, J. A. "A formal semantics for computer languages and its application in a compiler-compiler." Comm. ACM 9, 1 (Jan. 1966), 3-9. Google Scholar
- F2 FLOYD, R.W. "Assigning meanings to programs." In Proc. Symposium on. Appl. Math., Vol. 19, Amer. Math. Soc., 1967.Google Scholar
- H1 HENHAPL, W.; AND C. B. JONES. "The block structure concept and some possible implementations with proofs of equivalence." TR 25.104, IBM Lab. Vienna, April 1970.Google Scholar
- H2 HOARE, C. A. R. "Proof of a program: FIND." Comm. ACM 14, 1 (Jan. 1971), 39-45. Google Scholar
- H3 HOPCROFT, J.; AND J. ULLMAN. Formal languages and their relation to automata. Addison-Wesley Publ. Co., Reading, Mass., 1969. Google Scholar
- I1 IRONS, E. T. "A syntax directed compiler for ALGOL 60." Comm. ACM 4, 1 (Jan. 1961), 51-55. Google Scholar
- J1 JOHNSTON, J. B. "The contour model of block structured processes." In Proc. Symposium on Data Structures in Programming Languages, J. T. Tou& P. Wegner (Eds.), SIGPLAN Notices 6, 2 (Feb. 1971), 55-82. Google Scholar
- K1 KLEENE, S. C. Introduction to mathematics. Van Nostrand, New York, 1952.Google Scholar
- K2 KNUTH, D .E . "The semantics of contextfree languages." Mathematical System Theory 2, 2 (1968).Google Scholar
- L1 LANDIN, P .J . "The mechanical evaluation of expressions." Computer J. 6, 4 (Jan. 1964), 308-320.Google Scholar
- L2 LAUER, P. "Formal definition of ALGOL 60." TR 25.088, IBM Lab. Vienna, Dec. 1968.Google Scholar
- L3 LEwis, P. M.; AND R. E. STEARNS. "Syntaxdirected transduction." J. ACM 15, 3 (July 1968), 465-488. Google Scholar
- L4 LEWIS, P.M.; AND R. E. STEARNS. "Property grammars and table machines." Information and Control 14, 6 (June 1969), 524-549.Google Scholar
- L5 LONDON, R.L. "Proving programs correct: some techniques and examples." BIT 10, 2 (1970), 168-182.Google Scholar
- L6 LUCAS, P. "Two constructive realizations of the block concept and their equivalence." TR 25.085, IBM Lab. Vienna, Dec. 1968.Google Scholar
- L7 LUCAS, P.; ET AL. "Method and notation for the formal definition of programming languages." TR 25.087, 1BM Lab. Vienna, 1968.Google Scholar
- L8 LUCAS, P.; AND K. WALK. "On the formal description of PL/I." Annual Reviews of Automatic Programming 6, 3 (1969).Google Scholar
- L9 LUCKHAM, D. C.; D. M. R. PARK; AND M. S. PATERSON. "On formalized computer programs." J. Computer and System Sciences 4, 3 (June 1970), 220-249.Google Scholar
- M1 MANNA, Z. "Properties of programs and the first-order predicate calculus." J. ACM 16, 2 (April 1969), 244-255. Google Scholar
- M2 McCARTHY, J. "Towards a mathematical science of computation." In Proc. IFIP Cong. 1962, North-Holland Publ. Co., Amsterdam, 1963.Google Scholar
- M3 McCARTHY, J. "A basis for a mathematical science of computation." In Formal programming languages, Braffort & Hirschberg (Eds.), North-Holland Publ. Co., Amsterdam, 1963.Google Scholar
- M4 McCARTHY, J. "A formal description of a subset of ALGOL." In Formal language description languages for computer programming, T. B. Steel, Jr. (Ed.), North-H011and Publ. Co., Amsterdam, 1966, 1-12.Google Scholar
- M5 MCCARTHY, J.; ET AL. The LISP 1.5 programming manual. MIT Press, Cambridge, Mass., 1965.Google Scholar
- M6 McCARTHY, J.; AND J. PAINTER. "Correctness of a compiler for arithmetic expressions." In Proc. Symposium on Appl. Math., Vol. 19, Amer. Math. Sot., 1967.Google Scholar
- M7 McGOWAN, C. "Correctness results for lambda calculus interpreters." PhD Thesis, Cornell University, 1971; available as TR 71- 34, Center for Computer and Information Sciences, Brown University, Providence, R. I., Feb. 1971. Google Scholar
- N1 NAUR, P. (ED.) "Revised report on the algorithmic language ALGOL 60." Comm. ACM 6, 1 (Jan. 1963), 1-17. Google Scholar
- P1 PATERSON, M.S. "Equivalence problems in a model of computation." PhD Thesis, Cambridge University, 1967; available as MIT Artificial Intelligence Laboratory Memo. No. 1, Cambridge, Mass., Nov. 1970.Google Scholar
- R1 ROSENBERG, A. L. "Addressable data graphs." In Proc. 8rd Annual ACM Symposium on Theory of Computing, ACM, New York, 1971, 138-150. Google Scholar
- S1 SHEPHERDSON, J. C.; AND H. E. STURGIS. "Computability of recursive functions." J. ACM 10, 2 (April 1963), 217-255. Google Scholar
- S2 STANDISH, T. "Datastructures: an axiomatic approach." Unpublished report, Feb. 1971.Google Scholar
- V1 VAN WIJNGAARDEN; ET AL. "Report on the algorithmic language ALGOL 68." Numerische Mathematik 14, 2 (1969), 84-218.Google Scholar
- W1 WALK, K.; ET AL. "Abstract syntax and interpretation of PL/I, Version III." TR 25.098, IBM Lab. Vienna, April 1969.Google Scholar
- W2 WEGNER, P. Programming languages, information structures and machine organization. McGraw-Hill Book Co., New York, 1968. Google Scholar
- W3 WEGNER, P. "Three computer cultures." In Advances in computers, Vol. 10, F. L. Alt& M. Rubinoff (Eds.), Academic Press, New York, 1970, 7-78.Google Scholar
- W4 WEGNER, P. "Programming language semantics." In Courant Inst. Symposium on Formal Semantics, Prentice-Hall, Inc., Englewood Cliffs, N. J., 1971.Google Scholar
- W5 WFGNER, P. "Data structure models in programming languages." In Proc. Symposium on Data Structures in Programming Languages, J. T. Tou & P. Wegner (Eds.), SIGPLAN Notices 6, 2 (Feb. 1971), 1-54. Google Scholar
- W6 WEONER, P. "Operational semantics of programming languages." In Proc. ACM Conf. on Proving Assertions about Programs, a joint publication of SIGPLAN and SIGACT, SIGPLAN Notices 7, 1 (Jan. 1972), 128-141. Google Scholar
- W7 WIRTH, N.; AND H. WEBER. "EULER: a generalization of ALGOL and its formal definition : part I." Carom. ACM 9, 1 (Jan. 1966), 13-23; "Part II." Comm. ACM 9, 2 (Feb. 1966), 89-99. Google Scholar
Recommendations
Vienna definition language
Encyclopedia of Computer ScienceThe Vienna Definition Language (VDL) is a language for defining the syntax and semantics of programming languages. It consists of a syntactic metalanguage for defining the syntax of program and data structures (q.v.) and a semantic metalanguage that ...
Integrated language definition testing: enabling test-driven language development
OOPSLA '11: Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applicationsThe reliability of compilers, interpreters, and development environments for programming languages is essential for effective software development and maintenance. They are often tested only as an afterthought. Languages with a smaller scope, such as ...
Integrated language definition testing: enabling test-driven language development
OOPSLA '11The reliability of compilers, interpreters, and development environments for programming languages is essential for effective software development and maintenance. They are often tested only as an afterthought. Languages with a smaller scope, such as ...
Comments