A Basis For A Mathematical Theory Of Computation (1963)

by John McCarthy
Venue:Computer Programming and Formal Systems
Citations:202 - 6 self

Documents Related by Co-Citation

333 The mechanical evaluation of expressions – P J Landin - 1964
571 Assigning meanings to programs – R W Floyd - 1967
3219 Communication and Concurrency – R Milner - 1990
3407 Communicating Sequential Processes – C. A. R. Hoare - 2004
1330 A Calculus of Communicating Systems – R Milner - 1980
89 Proving Properties of Programs by Structural Induction – R. M. Burstall - 1969
85 Correctness of a compiler for arithmetic expressions – John Mccarthy, James Painter - 1967
23 Incremental reduction in the lambda calculus – J Field, T Teitelbaum - 1990
10 Incremental compilation via partial evaluation – R S Sundaresh, P Hudak - 1991
41 Incremental Evaluation for Attribute Grammars with Application to Syntax-directed Editors – Alan J Demers, Thomas Reps, Tim Teitelbaum - 1981
70 Analysis and Caching of Dependencies – Martin Abadi , Butler Lampson, Jean-Jacques Levy - 1996
45 Caching Function Calls Using Precise Dependencies – Allan Heydon, Roy Levin, Yuan Yu - 2000
2593 On the theory of dynamic programming – Richard E Bellman - 1952
234 Data structures for mobile data – Julien Basch, Leonidas J. Guibas, John Hershberger - 1997
69 Incremental computation via function caching – W Pugh, T Teitelbaum - 1989
47 Static caching for incremental computation – Yanhong A. Liu, Scott D. Stoller, Tim Teitelbaum - 1998
171 Call-by-name, call-by-value, and the lambda calculus – Gordon Plotkin - 1975
126 A correspondence between ALGOL 60 and Church’s lambda notation – P J Landin - 1965
395 LCF considered as a programming language – G Plotkin - 1977