×

Emploi de méthodes constructives en programmation. Un dossier: La fonction d’Ackermann. (French) Zbl 0358.68018


MSC:

68N01 General topics in the theory of software
PDFBibTeX XMLCite
Full Text: EuDML

References:

[1] 1. E. ASHCROFT, Z. MANNA. The translation of GOTO programs into WHILE programs IFIP conference, North Holland Publishing Company, 1971, p. 250-255. MR400762
[2] 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^\circ 14), p. 112-128. Zbl0291.68030 MR443399 · Zbl 0291.68030
[3] 3. J. ARSAC, Méthodes et outils en programmation, in Panorama de la nouveauté informatique en France. colloque AFCET, 1976, p. 123-146.
[4] 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] 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] 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. Zbl0362.68030 MR495078 · Zbl 0362.68030 · doi:10.1137/0205029
[7] 7. R. M. BURSTALL et J. DARLINGTON, A system which automatically improves programs, Acta Informatica, 6, 1976, p. 41-60. Zbl0323.68008 · Zbl 0323.68008 · doi:10.1007/BF00263742
[8] 8. G. BERRY, Bottom up computation of recursive functions, RAIRO, 10, 1976, n^\circ 3, p. 47-82. MR411222
[9] 9. F. COUSINEAU, Transformation de programmes itératifs, in Programmation, B. Robinet, Ed., Dunod, Paris, 1977, p. 53-74. Zbl0401.00016 · Zbl 0401.00016
[10] 10. R. W. FLOYD, D. E. KNUTH, Notes on avoiding GO TO statements. Information processing letters, 1, 1971, p. 23-31. · Zbl 1260.68047
[11] 11. R. W. FLOYD, Assigning meanings to programs. Symposia in applied mathematics, Vol. 19. Rhode Island. American mathematical society, 1967, p. 19-32. Zbl0189.50204 MR235771 · Zbl 0189.50204
[12] 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] 13. C. A. R. HOARE, An axiomatic basis for computer programming. Com. ACM, 12, 1969, p. 576-580. Zbl0179.23105 · Zbl 0179.23105 · doi:10.1145/363235.363259
[14] 14. J. IRLIK, Translating some recursive procedures into iterative schemes, in Programmation, B. Robinet, Ed., Dunod, Paris, 1976, p. 39-52. · Zbl 0345.68010
[15] 15. D. E. KNUTH, Structured programming with GO TO statements, ACM Computing survey, Vol. 6, n^\circ 4, déc. 1974. Zbl0301.68014 · Zbl 0301.68014
[16] 16. R. KOSARAJU, Analysis of structured programs. Journal of computer ans Systems science, 9, 1974, p. 232-255. Zbl0293.68014 MR400768 · Zbl 0293.68014 · doi:10.1016/S0022-0000(74)80043-7
[17] 17. H. LEDGARD et M. MARCOTTY, A genealogy of control structures. Com. ACM, 18, 1975, p. 629-639. Zbl0313.68024 · Zbl 0313.68024 · doi:10.1145/361219.361222
[18] 18. Z. MANNA, Mathematical theory of computation, Addison Wesley, 1974. Zbl0353.68066 MR400771 · Zbl 0353.68066
[19] 19. L. NOLIN et G. RUGGIU, Formalization of Exel. ACM symposium on principles of programming languages, Boston, oct. 1973, p. 108-119. Zbl0308.68011 · Zbl 0308.68011
[20] 20. W. W. PETERSON, T. KASAMI et N. TOKURA, A on the capabilities of WHILE, REPEAT and EXIT statements. Zbl0279.68008 · Zbl 0279.68008 · doi:10.1145/355609.362337
[21] 21. H. G. RICE, Recursion and iteration, Com. ACM, 8, 1965, p. 114-115. Zbl0129.10304 · Zbl 0129.10304 · doi:10.1145/363744.363781
[22] 22. J. VUILLEMIN, Proof techniques for recursive programs. PhD thesis Computer science department Stanford University, 1973.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.