Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/association-for-computing-machinery/symbol-manipulation-by-threaded-lists-SQp7MvtTF4
References (17)
-
= 0 I 12 I Z -A(z) , seqe(Z, 23) , 15 I 12 I Zt5 -
Z -d, seqe(Z, 15b), 22 I C 0, Z -d, seqe(Z, 21 ), 19 I -
A, x), div (R 2 L(R), RI, R 2 L(R), A, x), exit I 3 j ) diff(R, x, S ) a -
I C = 0 I seqe (Z, exit) -
Z•, 15 I seqe(Z, 18), seqe(Z, 21), list (d) , d -Z, 17 I 17 I Z¢ij -
J. McCarthy (1959)
Recursive functions of symbolic expressions and their computation by machine, Part ICommunications of the ACM, 3
-
1 L(Sf) +-0, 3 I :3 j -1 I simp(S, x), exit I' ) -
J. Shaw, A. Newell, H. Simon, T. Ellis (1958)
A command structure for complex information processing -
Pl l C = "X" IT, 18 I F -
I L 2 (R ) = 0 I simp(Z, y ), exit I 3 I ) -
D), z., lb I 5 I -
19 l F, 19b I P3 II list(n), count(X, A, n ) 26 ll P-1 11 list (m), count(X, D, m) P-11 ', P41 I m = n I T -
list (C), seql (Z, 25), 23b I count -
)) I Zt -~("+ -
J. Robinson (1950)
General recursive functions, 1
-
R. Robinson (1947)
Primitive recursive functionsBulletin of the American Mathematical Society, 53
-
3 I E +-false, f +-0, exit 3 I e = 0 I e +-c -f -l, -1 t copy(Z, Zl ), thread (Zl
- Publisher
- Association for Computing Machinery
- Copyright
- Copyright © 1960 by ACM Inc.
- ISSN
- 0001-0782
- DOI
- 10.1145/367177.367202
- Publisher site
- See Article on Publisher Site
Abstract
i'airl:i 2,1~{I u~.l tO : eally, most Ill0r(, We shall (:tefi,~(~ il i,~ col~junction with lhe functions ~[f/]and t[,~l, which give the /rausformations thai ~ undergoesbetween the points S a,~d T respeclively and the exit. We h~ve r[~] = [~rH[~I-' ~'[f,[~ll; T - ~ s[fd~]]l (Signal Corps), the U.S. Air Force (Office of Scientific Research, Air Research and Development Command), and the U.S. N a v y (Office of Naval Research)). The author also wishes to acknowledge the personal financiM support of the Alfred P. Sloa.n Foun(l't,tion.. ~ti0ns~ )8sell. Given a flowch'trt with a single, entrance and a single exit, it is easy ~(, write down the recursive function that gives the tr'msformation of tim state vector from entrance to exit in terms of the corresponding functions for the computation blocks and the predicates of tile branch points. In general, we proceed as follows. In figure 6, let ~ be an n-way branch point, and let fi, ... , f, be the computations leading to branch points fl~, f12, ' " , fl . . . . l~et 4) be the function that transforms between fl and the exit of the chart, and let (b~ , • "
Journal
Communications of the ACM – Association for Computing Machinery
Published: Apr 1, 1960