@article{ITA_1976__10_1_47_0, author = {Berry, G.}, title = {Bottom-up computation of recursive programs}, journal = {Revue fran\c{c}aise d'automatique informatique recherche op\'erationnelle. Informatique th\'eorique}, pages = {47--82}, publisher = {Dunod-Gauthier-Villars}, address = {Paris}, volume = {10}, number = {R1}, year = {1976}, mrnumber = {411222}, language = {en}, url = {http://archive.numdam.org/item/ITA_1976__10_1_47_0/} }
TY - JOUR AU - Berry, G. TI - Bottom-up computation of recursive programs JO - Revue française d'automatique informatique recherche opérationnelle. Informatique théorique PY - 1976 SP - 47 EP - 82 VL - 10 IS - R1 PB - Dunod-Gauthier-Villars PP - Paris UR - http://archive.numdam.org/item/ITA_1976__10_1_47_0/ LA - en ID - ITA_1976__10_1_47_0 ER -
%0 Journal Article %A Berry, G. %T Bottom-up computation of recursive programs %J Revue française d'automatique informatique recherche opérationnelle. Informatique théorique %D 1976 %P 47-82 %V 10 %N R1 %I Dunod-Gauthier-Villars %C Paris %U http://archive.numdam.org/item/ITA_1976__10_1_47_0/ %G en %F ITA_1976__10_1_47_0
Berry, G. Bottom-up computation of recursive programs. Revue française d'automatique informatique recherche opérationnelle. Informatique théorique, Tome 10 (1976) no. R1, pp. 47-82. http://archive.numdam.org/item/ITA_1976__10_1_47_0/
1. Calculs ascendants des programmes récursifs. Thèse de 3e cycle, Université Paris VII, 1976.
,2. Proving Properties of Programs by Structural Induction. Computer Journal, vol. 12, 1969, p. 41-48. | Zbl
.3. Storage Requirements for Deterministic Polynomial Time Recognizible Languages. Proc. 6th annual symposium on theory of Computing, Seattle, Washington, 1974, p. 33-39. | MR | Zbl
and .4. On Formalised Computer Programs. Journal of Computer and System Sciences, vol. 4, No. 3, 1970, p. 220-250. | MR | Zbl
, and .5. Mathematical theory of Computation. McGraw-Hill, (Computer science series), 1975. | MR | Zbl
.6. Fixpoint Approach to the Theory of Computation. Comm. ACM, vol. 15, No. 7, 1972, p. 528-536. | MR | Zbl
and .7. 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. Another Recursion Induction Principle. Comm. ACM, vol. 14, No. 5, 1971, p. 351-354. | MR | Zbl
.9. On the Interpretation of Recursive Program Schemes, Symposia Mathematica, Vol. XV, Instituto Nazionale di Alta Matematica, Italy, 1975, p. 255-281. | MR | Zbl
.10. Fixpoint Induction and Proofs of Program Properties, Machine Intelligence 5, Edinburgh University press, 1969, p. 59-77. | MR | Zbl
.11. Recursion and Iteration. Comm. ACM, vol. 8, No. 2, 1965, p. 114-115. | Zbl
.12. Outline of a Mathematical Theory of Computation. Programming research group monography n° 2, Oxford University, 1970.
.13. Towards a Mathematical Semantles for Programming Languages. Programming research group monography No. 6, Oxford University, 1972.
and .14. Proof Techniques for Recursive Programs. Ph. D. thesis, Computer Science Department, Stanford University, U.S.A., 1973.
.15. 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.
.