A combinatory logic model of programming languages.

[1]  J. M. Cadiou,et al.  Recursive definitions of partial functions and their computations , 1972, Proving Assertions About Programs.

[2]  S K Abdali,et al.  Simple lambda-calculus model of programming languages , 1973 .

[3]  P. J. Landin.  The Mechanical Evaluation of Expressions , 1964, Comput. J..

[4]  P. J. Landin,et al.  Correspondence between ALGOL 60 and Church's Lambda-notation , 1965, Commun. ACM.

[5]  Friedrich L. Bauer,et al.  Revised report on the algorithm language ALGOL 60 , 1963, CACM.

[6]  P. Wegner.  Programming Languages, Information Structures, and Machine Organization. , 1968 .

[7]  Ralph L. London,et al.  The current state of proving programs correct , 1972, ACM Annual Conference.

[8]  Donald E. Knuth,et al.  Examples of formal semantics , 1971, Symposium on Semantics of Algorithmic Languages.

[9]  James H. Morris,et al.  Lambda-calculus models of programming languages. , 1969 .

[10]  A. Church.  The calculi of lambda-conversion , 1941 .

[11]  M. Schönfinkel.  Über die Bausteine der mathematischen Logik , 1924 .

[12]  S. C. Kleene,et al.  Introduction to Metamathematics , 1952 .

[13]  R J Orgass,et al.  A theory of programming languages. , 1969, Studium generale; Zeitschrift fur die Einheit der Wissenschaften im Zusammenhang ihrer Begriffsbildungen und Forschungsmethoden.

[14]  Robin Milner,et al.  Implementation and applications of Scott's logic for computable functions , 1972, Proving Assertions About Programs.

[15]  Terrence Pratt.  Formal definition of programming languages , 1973, SIGP.

[16]  Clement Leo Mcgowan,et al.  Correctness Results For Lambda Calculus Interpreters , 1970 .

[17]  Henry F. Ledgard.  A model for type checking: with an application to ALGOL 60 , 1972, CACM.

[18]  Zohar Manna,et al.  Fixpoint approach to the theory of computation , 1972, CACM.