@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}, publisher = {Centrale des revues, Dunod-Gauthier-Villars}, address = {Montreuil}, volume = {11}, number = {2}, year = {1977}, zbl = {0358.68018}, language = {fr}, url = {http://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 - http://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 http://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. http://www.numdam.org/item/ITA_1977__11_2_91_0/
1. The translation of GOTO programs into WHILE programs IFIP conference, North Holland Publishing Company, 1971, p. 250-255. | MR
, .2. 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. | MR | Zbl
,3. Méthodes et outils en programmation, in Panorama de la nouveauté informatique en France. colloque AFCET, 1976, p. 123-146.
,4. 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. Le système de programmation structurée EXEL. Revue technique Thomson-CSF, 6, 1974, p. 715-736.
, , et ,6. Lucid, a formal System for writing and proving programs. SIAM journal on Computing, 5, 1976, p. 336-354. | MR | Zbl
et ,7. A system which automatically improves programs, Acta Informatica, 6, 1976, p. 41-60. | Zbl
et ,8. Bottom up computation of recursive functions, RAIRO, 10, 1976, n° 3, p. 47-82. | Numdam | MR
,9. Transformation de programmes itératifs, in Programmation, B. Robinet, Ed., Dunod, Paris, 1977, p. 53-74. | Zbl
,10. Notes on avoiding GO TO statements. Information processing letters, 1, 1971, p. 23-31.
, ,11. Assigning meanings to programs. Symposia in applied mathematics, Vol. 19. Rhode Island. American mathematical society, 1967, p. 19-32. | MR | Zbl
,12. 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. An axiomatic basis for computer programming. Com. ACM, 12, 1969, p. 576-580. | Zbl
,14. Translating some recursive procedures into iterative schemes, in Programmation, B. Robinet, Ed., Dunod, Paris, 1976, p. 39-52.
,15. Structured programming with GO TO statements, ACM Computing survey, Vol. 6, n° 4, déc. 1974. | Zbl
,16. Analysis of structured programs. Journal of computer ans Systems science, 9, 1974, p. 232-255. | MR | Zbl
,17. A genealogy of control structures. Com. ACM, 18, 1975, p. 629-639. | Zbl
et ,18. Mathematical theory of computation, Addison Wesley, 1974. | MR | Zbl
,19. Formalization of Exel. ACM symposium on principles of programming languages, Boston, oct. 1973, p. 108-119. | Zbl
et ,20. A on the capabilities of WHILE, REPEAT and EXIT statements. | Zbl
, et ,21. Recursion and iteration, Com. ACM, 8, 1965, p. 114-115. | Zbl
,22. Proof techniques for recursive programs. PhD thesis Computer science department Stanford University, 1973.
,