EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 11 / No 2 (1977) RAIRO. Inform. théor., 11 2 (1977) 113-126 References
Free Access
Issue
RAIRO. Inform. théor.
Volume 11, Number 2, 1977
Page(s) 113 - 126
DOI https://doi.org/10.1051/ita/1977110201131
Published online 01 February 2017
  1. 1. J. ARSAC, Emploi de méthodes constructives en programmation : un dossier la fonction d'Ackermann, R.A.I.R.O., ce même numéro, article précédant celui-ci. [EuDML: 92049] [Zbl: 0358.68018] [Google Scholar]
  2. 2. D. W. BARRON, Techniques récursives en programmation, Dunod, Paris, 1970. [Google Scholar]
  3. 3. G. BERRY, Bottom-up Computations of Recursive Programs. R.A.I.R.O., 10, n° 3. mars 1976, p. 47 à 82. [EuDML: 92028] [MR: 411222] [Google Scholar]
  4. 4. G. BERRY, Calculs ascendants des Programmes Récursifs, Thèse de 3e cycle, Université, Paris VII, Paris, avril 1976. [Google Scholar]
  5. 5. G. BERRY et J. J. LEVY, Minimal and Optimal Computations of Recursive Programs. Proc. 4 th Annual ACM SIGACT-SIGPLAN Conference on Principles of Programming Languages, Los Angeles, California, janvier 1977, p. 215-226. [Google Scholar]
  6. 6. R. BURSTALL et J. DARLINGTON, A Transformation System for Developing Recursive Programs, Department of Artificial Intelligence, University of Edinburgh, U.K., Research Report No. 19, 1976. [Zbl: 0343.68014] [MR: 451816] [Google Scholar]
  7. 7. S. A. COOK, An observation of Time-Storage Trade-off. Proc. 5 th annual ACM Symposium on Theory of Computation, Austin, Texas, 1973, p. 29-33. [MR: 411238] [Zbl: 0305.68066] [Google Scholar]
  8. 8. P. FLAJOLET, Algorithmes d'Exploration d'Arbres, A paraître en Rapport Laboria, IRIA. [Google Scholar]
  9. 9. J. HOPCROFT, W. PAUL et L. VALIANT, On time versus Space and Related Problems. Proc. 16 th Annual Symposium on Foundations of Computer Science, Berkeley, California, 1975, p. 57-64. [MR: 428789] [Google Scholar]
  10. 10. G. HUET, G. KAHN et al., MENTOR Système d'édition et de transformation de programmes. A paraître en Rapport Laboria, IRIA. [Google Scholar]
  11. 11. J. MORRIS, Another Recursion Induction Principle. Comm. ACM, 14, 1971, p. 351-354. [MR: 290963] [Zbl: 0226.68026] [Google Scholar]
  12. 12. D. PARK, Fixpoint Induction and Proof of Program Properties. Machine Intelligence 5, Edinburgh University Press, 1969, p. 59-77. [MR: 323149] [Zbl: 0219.68007] [Google Scholar]
  13. 13. W. PAUL, R. TARJAN et J. CELONI, Space bounds for a game of pebbles. Proc 8th Annual ACM Symposium on Theory of Computing, Hershey, Pennsylvania, 1976, p. 149-160. [MR: 445906] [Zbl: 0365.05027] [Google Scholar]
  14. 14. H. G. RICE, Recursion and Iteration, Comm. ACM, 8, 1965, p. 114-115. [Zbl: 0129.10304] [Google Scholar]
  15. 15. D. W. RITCHIE, Program structure and Computational Complexity. Ph. D. Thesis, Harvard, 1967. [Google Scholar]
  16. 16. R. SETHI et J. D. ULLMAN, The generation of Optimal Code for Arithmetic Expressions. Journal of ACM, 17, 1970, p. 715-728. [MR: 275722] [Zbl: 0212.18802] [Google Scholar]
  17. 17. J. VUILLEMIN, Syntaxe, Sémantique et Axiomatique d'un Langage de Programmation simple, Thèse de doctorat ès Sciences Mathématiques, Université Paris VI, Paris, 1974. [Zbl: 0327.68006] [Google Scholar]
  18. 18. J. VUILLEMIN, Notes de cours, Université d'Orsay, 1976. [Google Scholar]
  19. 19. A. YASUHARA, Recursive Functions theory and Logic, Academic Press, New York, 1971. [Zbl: 0254.02002] [Google Scholar]

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.