Calculs ascendants du programme d'Ackermann : analyse du programme de J. Arsac
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1977)
- Volume: 11, Issue: 2, page 113-126
- ISSN: 0988-3754
Access Full Article
top
How to cite
topBerry, G.. "Calculs ascendants du programme d'Ackermann : analyse du programme de J. Arsac." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 11.2 (1977): 113-126. <http://eudml.org/doc/92045>.
@article{Berry1977,
author = {Berry, G.},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
language = {fre},
number = {2},
pages = {113-126},
publisher = {EDP-Sciences},
title = {Calculs ascendants du programme d'Ackermann : analyse du programme de J. Arsac},
url = {http://eudml.org/doc/92045},
volume = {11},
year = {1977},
}
TY - JOUR
AU - Berry, G.
TI - Calculs ascendants du programme d'Ackermann : analyse du programme de J. Arsac
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1977
PB - EDP-Sciences
VL - 11
IS - 2
SP - 113
EP - 126
LA - fre
UR - http://eudml.org/doc/92045
ER -
References
top- 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. Zbl0358.68018
- 2. D. W. BARRON, Techniques récursives en programmation, Dunod, Paris, 1970.
- 3. G. BERRY, Bottom-up Computations of Recursive Programs. R.A.I.R.O., 10, n° 3. mars 1976, p. 47 à 82. MR411222
- 4. G. BERRY, Calculs ascendants des Programmes Récursifs, Thèse de 3e cycle, Université, Paris VII, Paris, avril 1976.
- 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.
- 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. Zbl0343.68014MR451816
- 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. Zbl0305.68066MR411238
- 8. P. FLAJOLET, Algorithmes d'Exploration d'Arbres, A paraître en Rapport Laboria, IRIA.
- 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. MR428789
- 10. G. HUET, G. KAHN et al., MENTOR Système d'édition et de transformation de programmes. A paraître en Rapport Laboria, IRIA.
- 11. J. MORRIS, Another Recursion Induction Principle. Comm. ACM, 14, 1971, p. 351-354. Zbl0226.68026MR290963
- 12. D. PARK, Fixpoint Induction and Proof of Program Properties. Machine Intelligence 5, Edinburgh University Press, 1969, p. 59-77. Zbl0219.68007MR323149
- 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. Zbl0365.05027MR445906
- 14. H. G. RICE, Recursion and Iteration, Comm. ACM, 8, 1965, p. 114-115. Zbl0129.10304
- 15. D. W. RITCHIE, Program structure and Computational Complexity. Ph. D. Thesis, Harvard, 1967.
- 16. R. SETHI et J. D. ULLMAN, The generation of Optimal Code for Arithmetic Expressions. Journal of ACM, 17, 1970, p. 715-728. Zbl0212.18802MR275722
- 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. Zbl0327.68006
- 18. J. VUILLEMIN, Notes de cours, Université d'Orsay, 1976.
- 19. A. YASUHARA, Recursive Functions theory and Logic, Academic Press, New York, 1971. Zbl0254.02002
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.