no. 2
Emploi de méthodes constructives en programmation. Un dossier : la fonction d'Ackermann
RAIRO. Informatique théorique, Tome 11 (1977) no. 2, pp. 91-112 
@article{ITA_1977__11_2_91_0,
     author = {Arsac, Jacques J.},
     title = {Emploi de m\'ethodes constructives en programmation. {Un} dossier : la fonction {d'Ackermann}},
     journal = {RAIRO. Informatique th\'eorique},
     pages = {91--112},
     year = {1977},
     publisher = {Centrale des revues, Dunod-Gauthier-Villars},
     address = {Montreuil},
     volume = {11},
     number = {2},
     zbl = {0358.68018},
     language = {fr},
     url = {https://www.numdam.org/item/ITA_1977__11_2_91_0/}
}
TY  - JOUR
AU  - Arsac, Jacques J.
TI  - Emploi de méthodes constructives en programmation. Un dossier : la fonction d'Ackermann
JO  - RAIRO. Informatique théorique
PY  - 1977
SP  - 91
EP  - 112
VL  - 11
IS  - 2
PB  - Centrale des revues, Dunod-Gauthier-Villars
PP  - Montreuil
UR  - https://www.numdam.org/item/ITA_1977__11_2_91_0/
LA  - fr
ID  - ITA_1977__11_2_91_0
ER  - 
%0 Journal Article
%A Arsac, Jacques J.
%T Emploi de méthodes constructives en programmation. Un dossier : la fonction d'Ackermann
%J RAIRO. Informatique théorique
%D 1977
%P 91-112
%V 11
%N 2
%I Centrale des revues, Dunod-Gauthier-Villars
%C Montreuil
%U https://www.numdam.org/item/ITA_1977__11_2_91_0/
%G fr
%F ITA_1977__11_2_91_0
Arsac, Jacques J. Emploi de méthodes constructives en programmation. Un dossier : la fonction d'Ackermann. RAIRO. Informatique théorique, Tome 11 (1977) no. 2, pp. 91-112. https://www.numdam.org/item/ITA_1977__11_2_91_0/

1. E. Ashcroft, Z. Manna. The translation of GOTO programs into WHILE programs IFIP conference, North Holland Publishing Company, 1971, p. 250-255. | MR

2. J. Arsac, Langages sans étiquettes et transformations de programmes, in Automata, Languages and Programming, 2nd Colloquium, J. Loeckx, Ed. Springer 1974 (Lecture Notes in Computer Science n° 14), p. 112-128. | Zbl | MR

3. J. Arsac, Méthodes et outils en programmation, in Panorama de la nouveauté informatique en France. colloque AFCET, 1976, p. 123-146.

4. J. Arsac, Nouvelles leçons de programmation. Ouvrage à paraître. Dunod, 1977. Aussi, en version abrégée, publication de l'Institut de Programmation, Paris, 1975.

5. J. Arsac, L. Nolin, G. Ruggiu et J. P. Vasseur, Le système de programmation structurée EXEL. Revue technique Thomson-CSF, 6, 1974, p. 715-736.

6. E. Ashcroft et W. W. Wadge, Lucid, a formal System for writing and proving programs. SIAM journal on Computing, 5, 1976, p. 336-354. | Zbl | MR

7. R. M. Burstall et J. Darlington, A system which automatically improves programs, Acta Informatica, 6, 1976, p. 41-60. | Zbl

8. G. Berry, Bottom up computation of recursive functions, RAIRO, 10, 1976, n° 3, p. 47-82. | MR | Numdam

9. F. Cousineau, Transformation de programmes itératifs, in Programmation, B. Robinet, Ed., Dunod, Paris, 1977, p. 53-74. | Zbl

10. R. W. Floyd, D. E. Knuth, Notes on avoiding GO TO statements. Information processing letters, 1, 1971, p. 23-31.

11. R. W. Floyd, Assigning meanings to programs. Symposia in applied mathematics, Vol. 19. Rhode Island. American mathematical society, 1967, p. 19-32. | Zbl | MR

12. S. L. Gerhardt, Knowledge about programs. A model and case study. IEEE conference on reliable software, Los Angeles, 1975. IEEE cat. 75 CHO 940, p. 89-93.

13. C. A. R. Hoare, An axiomatic basis for computer programming. Com. ACM, 12, 1969, p. 576-580. | Zbl

14. J. Irlik, Translating some recursive procedures into iterative schemes, in Programmation, B. Robinet, Ed., Dunod, Paris, 1976, p. 39-52.

15. D. E. Knuth, Structured programming with GO TO statements, ACM Computing survey, Vol. 6, n° 4, déc. 1974. | Zbl

16. R. Kosaraju, Analysis of structured programs. Journal of computer ans Systems science, 9, 1974, p. 232-255. | Zbl | MR

17. H. Ledgard et M. Marcotty, A genealogy of control structures. Com. ACM, 18, 1975, p. 629-639. | Zbl

18. Z. Manna, Mathematical theory of computation, Addison Wesley, 1974. | Zbl | MR

19. L. Nolin et G. Ruggiu, Formalization of Exel. ACM symposium on principles of programming languages, Boston, oct. 1973, p. 108-119. | Zbl

20. W. W. Peterson, T. Kasami et N. Tokura, A on the capabilities of WHILE, REPEAT and EXIT statements. | Zbl

21. H. G. Rice, Recursion and iteration, Com. ACM, 8, 1965, p. 114-115. | Zbl

22. J. Vuillemin, Proof techniques for recursive programs. PhD thesis Computer science department Stanford University, 1973.