Bottom-up computation of recursive programs
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 10 (1976) no. R1, p. 47-82
@article{ITA_1976__10_1_47_0,
     author = {Berry, G.},
     title = {Bottom-up computation of recursive programs},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     publisher = {EDP-Sciences},
     volume = {10},
     number = {R1},
     year = {1976},
     pages = {47-82},
     mrnumber = {411222},
     language = {en},
     url = {http://http://www.numdam.org/item/ITA_1976__10_1_47_0}
}
Berry, G. Bottom-up computation of recursive programs. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 10 (1976) no. R1, pp. 47-82. http://www.numdam.org/item/ITA_1976__10_1_47_0/

1. G. Berry, Calculs ascendants des programmes récursifs. Thèse de 3e cycle, Université Paris VII, 1976.

2. R. Burstall. Proving Properties of Programs by Structural Induction. Computer Journal, vol. 12, 1969, p. 41-48. | Zbl 0164.46202

3. S. Cook and R. Sethi. Storage Requirements for Deterministic Polynomial Time Recognizible Languages. Proc. 6th annual symposium on theory of Computing, Seattle, Washington, 1974, p. 33-39. | MR 421161 | Zbl 0412.68078

4. D. Luckham, D. Park and M. Paterson. On Formalised Computer Programs. Journal of Computer and System Sciences, vol. 4, No. 3, 1970, p. 220-250. | MR 275717 | Zbl 0209.18704

5. Z. Manna. Mathematical theory of Computation. McGraw-Hill, (Computer science series), 1975. | MR 400771 | Zbl 0353.68066

6. Z. Manna and J. Vuillemin. Fixpoint Approach to the Theory of Computation. Comm. ACM, vol. 15, No. 7, 1972, p. 528-536. | MR 440993 | Zbl 0245.68011

7. R. Milner. Implementation and Applications of Scott's Logic for Computable Functions. Proceedings ACM Conference on Proving assertions about programs, Las Cruces, New Mexico, 1972, p. 1-5.

8. J. H. Morris. Another Recursion Induction Principle. Comm. ACM, vol. 14, No. 5, 1971, p. 351-354. | MR 290963 | Zbl 0226.68026

9. M. Nivat. On the Interpretation of Recursive Program Schemes, Symposia Mathematica, Vol. XV, Instituto Nazionale di Alta Matematica, Italy, 1975, p. 255-281. | MR 391563 | Zbl 0346.68041

10. D. Park. Fixpoint Induction and Proofs of Program Properties, Machine Intelligence 5, Edinburgh University press, 1969, p. 59-77. | MR 323149 | Zbl 0219.68007

11. H. G. Rice. Recursion and Iteration. Comm. ACM, vol. 8, No. 2, 1965, p. 114-115. | Zbl 0129.10304

12. D. Scott. Outline of a Mathematical Theory of Computation. Programming research group monography n° 2, Oxford University, 1970.

13. D. Scott and C. Strachey. Towards a Mathematical Semantles for Programming Languages. Programming research group monography No. 6, Oxford University, 1972.

14. J. Vuillemin. Proof Techniques for Recursive Programs. Ph. D. thesis, Computer Science Department, Stanford University, U.S.A., 1973.

15. J. Vuillemin. Syntaxe, sémantique et axiomatique d'un language de programmation simple. Thèse de doctorat d'état ès-sciences mathématiques, Université Paris VI, Paris, 1974.