A Basis for a Mathematical Theory of Computation (1963)

by John Mccarthy
Venue:Computer Programming and Formal Systems
Citations:182 - 6 self

Documents Related by Co-Citation

299 The mechanical evaluation of expressions – P J Landin - 1964
505 Assigning meanings to programs – R W Floyd - 1967
1225 A Calculus of Communicating Systems – R Milner - 1980
81 Proving Properties of Programs by Structural Induction – R. M. Burstall - 1969
80 Correctness of a compiler for arithmetic expressions – John Mccarthy, James Painter - 1967
2972 Communication and Concurrency – R Milner - 1989
3119 Communicating Sequential Processes – C. A. R. Hoare - 2004
148 Call-by-name, call-by-value and the lambda-calculus – G D Plotkin
1182 A Structural Approach to Operational Semantics – G. D. Plotkin - 1981
184 Combinatory Logic – H B Curry, R Feys - 1958
99 Metafunctions: Proving Them Correct and Using Them Efficiently as New Proof Procedures – R S Boyer, J S Moore - 1981
27 The function of FUNCTION in LISP or why the FUNARG problem should be called the environment problem – J Moses - 1970
31 Anatomy of LISP – J R Allen - 1978
636 Structure and Interpretation of Computer Programs – H Abelson, G J Sussman, J Sussman - 1985
164 The next 700 programming languages – P J Landin - 1966
57 A Program Verifier – J C King - 1970
290 Functions as processes – R Milner - 1992
21 Incremental reduction in the lambda calculus – J Field, T Teitelbaum - 1990
9 Incremental compilation via partial evaluation – R S Sundaresh, P Hudak - 1991