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

330 The mechanical evaluation of expressions – P J Landin - 1964
563 Assigning meanings to programs – R W Floyd - 1967
1329 A calculus of communicating systems – R Milner - 1980
89 Proving Properties of Programs by Structural Induction – R. M. Burstall - 1969
84 Correctness of a compiler for arithmetic expressions – John Mccarthy, James Painter - 1967
3204 Communication and Concurrency – R Milner - 1989
3400 Communicating Sequential Processes – C. A. R. Hoare - 1985
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
69 Incremental computation via function caching – W Pugh, T Teitelbaum - 1989
46 Static caching for incremental computation – Yanhong A. Liu, Scott D. Stoller, Tim Teitelbaum - 1998
2611 Dynamic Programming – R Bellman - 1957
231 Data structures for mobile data – Julien Basch, Leonidas J. Guibas, John Hershberger - 1997
171 Call-by-name, call-by-value, and the lambda calculus – G Plotkin - 1975
1286 A Structural Approach to Operational Semantics – G. D. Plotkin - 1981
207 Modal Logics – Robert Feys - 1965