Free Access
Issue
RAIRO. Inform. théor.
Volume 11, Number 2, 1977
Page(s) 91 - 112
DOI https://doi.org/10.1051/ita/1977110200911
Published online 01 February 2017
  1. 1. E. ASHCROFT, Z. MANNA. The translation of GOTO programs into WHILE programs IFIP conference, North Holland Publishing Company, 1971, p. 250-255. [MR: 400762]
  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° 14), p. 112-128. [MR: 443399] [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. [MR: 495078] [Zbl: 0362.68030]
  7. 7. R. M. BURSTALL et J. DARLINGTON, A system which automatically improves programs, Acta Informatica, 6, 1976, p. 41-60. [Zbl: 0323.68008]
  8. 8. G. BERRY, Bottom up computation of recursive functions, RAIRO, 10, 1976, n° 3, p. 47-82. [EuDML: 92028] [MR: 411222]
  9. 9. F. COUSINEAU, Transformation de programmes itératifs, in Programmation, B. Robinet, Ed., Dunod, Paris, 1977, p. 53-74. [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. [MR: 235771] [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. [Zbl: 0179.23105]
  14. 14. J. IRLIK, Translating some recursive procedures into iterative schemes, in Programmation, B. Robinet, Ed., Dunod, Paris, 1976, p. 39-52.
  15. 15. D. E. KNUTH, Structured programming with GO TO statements, ACM Computing survey, Vol. 6, n° 4, déc. 1974. [Zbl: 0301.68014]
  16. 16. R. KOSARAJU, Analysis of structured programs. Journal of computer ans Systems science, 9, 1974, p. 232-255. [MR: 400768] [Zbl: 0293.68014]
  17. 17. H. LEDGARD et M. MARCOTTY, A genealogy of control structures. Com. ACM, 18, 1975, p. 629-639. [Zbl: 0313.68024]
  18. 18. Z. MANNA, Mathematical theory of computation, Addison Wesley, 1974. [MR: 400771] [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. [Zbl: 0308.68011]
  20. 20. W. W. PETERSON, T. KASAMI et N. TOKURA, A on the capabilities of WHILE, REPEAT and EXIT statements. [Zbl: 0279.68008]
  21. 21. H. G. RICE, Recursion and iteration, Com. ACM, 8, 1965, p. 114-115. [Zbl: 0129.10304]
  22. 22. J. VUILLEMIN, Proof techniques for recursive programs. PhD thesis Computer science department Stanford University, 1973.

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.