Un modèle fonctionnel des structures de contrôle

B. Robinet

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1977)

  • Volume: 11, Issue: 3, page 213-236
  • ISSN: 0988-3754

How to cite

top

Robinet, B.. "Un modèle fonctionnel des structures de contrôle." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 11.3 (1977): 213-236. <http://eudml.org/doc/92054>.

@article{Robinet1977,
author = {Robinet, B.},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
language = {fre},
number = {3},
pages = {213-236},
publisher = {EDP-Sciences},
title = {Un modèle fonctionnel des structures de contrôle},
url = {http://eudml.org/doc/92054},
volume = {11},
year = {1977},
}

TY - JOUR
AU - Robinet, B.
TI - Un modèle fonctionnel des structures de contrôle
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1977
PB - EDP-Sciences
VL - 11
IS - 3
SP - 213
EP - 236
LA - fre
UR - http://eudml.org/doc/92054
ER -

References

top
  1. 1. J. ARSAC, L. NOLIN, G. RUGGIU et J. P. VASSEUR, Le système de Programmation Structurée EXEL Revue Technique Thomson CSF,Vol. 6, N° 3, 1974, p. 715-736. 
  2. 2. J. ARSAC, Emploi de méthodes constructives en programmation, Un dossier de programmation : la fonction d'Ackermann. R.A.I.R.O., Informatique Théorique, Vol. 11, N° 2, 1977, p. 91-112. Zbl0358.68018
  3. 3. J. ARSAC, La construction de programmes structurés, Dunod, Paris, 1977. Zbl0451.68014
  4. 4. D. BERRY, Implementation of a Contour Model Lambda-Calculus Machine, TR n° 71-44. Brown University 1971. 
  5. 5. C. BÖHM and W. GROSS, Introduction to the CUCH, Automata Theory, E. R. Caianello, Ed. Academic Press, 1966, p. 35-65. Zbl0192.06903
  6. 6. C. BÖHM, The CUCH as a Formal and Description Language, Formal languages, Description languages for Computer Programming, T. B. Steel, Ed. North-Holland Pub., 1966, p. 179-197. 
  7. 7. C. BÖHM and G. JACOPINI, Flow Diagrams, Turing Machines and Languages with Only Two Formation Rules, Comm. ACM, Vol. 9, N° 5, 1966, p. 365-371. Zbl0145.24204
  8. 8. C. BOHM et M. DEZANI, A CUCH-Machine : the Automatic Treatment of Bound Variables, Int. journal of Comp. and Inf. Sciences, Vol. 1, N° 2, 1972, p. 171-186. Zbl0277.68026
  9. 9. R. CASTANET, Sémantique formelle des opérateurs d'un language de liste, RAIRO, R-3, 1974, p. 19-36. Zbl0325.68012MR366631
  10. 10. G. COUSINEAU, Transformations de programmes itératifs, in Programmation B. Robinet, Ed., Dunod, 1977, p. 53-74. 
  11. 11. G. COUSINEAU, Les arbres à feuilles indicées : un cadre algébrique pour l'étude des structures de contrôle, Thèse de Doctorat. Université Paris 7, 1977. 
  12. 12. H. B. CURRY, R. FEYS and W. CRAIG, Combinatory Logic, Vol. 1. North-Holland, 1958. Zbl0081.24104MR94298
  13. 13. M. J. FISCHER, Lambda-Calculus Schemata, Proc. ACM Conference on Proving Assertions About Programs. Las Cruces, 1972, p. 104-109. 
  14. 14. J. R. HINDLEY, B. LERCHER and J. P. SELDIN, Introduction to Combinatory Logic, London Mathematical Society. Lecture Notes Series 7. Cambridge University Press. 1972. Zbl0269.02005MR335242
  15. 15. P. J. LANDIN, A Lambda-Calculus Approach, Advances in Programming and Non-Numerical Computation. Pergamon Press, 1966, p. 97-141. Zbl0203.16406
  16. 16. P. J. LANDIN, A Correspondance Between Algol 60 and Church's Lambda-Notation, Comm. ACM, Vol. 8, N° 2, 3, 1965, p. 89-101 et 158-165. Zbl0134.33403
  17. 17. P. LUCAS, On the Semantics of Programming Languages and Software Devices, Formal Semantics of Programming Languages. R. Rustin, Ed., Prentice-Hall Inc., 1972, p. 41-57. MR428751
  18. 18. J. MCCARTHY, Recursive Functions of Symbolic Expressions and their Computation by Machine, Part I. Comm. ACM, Vol. 3, N° 4, 1960, p. 184-195. Zbl0101.10413
  19. 19. J. MICHEL, Évaluation automatique de formules de la Logique Combinatoire, Application aux techniques de preuve. Thèse de Spécialité. Université Pierre-et-Marie-Curie, 1976. 
  20. 20. J. H. MORRIS, Lambda-Calculus Models of Programming Languages, Ph. D., MIT, 1968. 
  21. 21. L. NOLIN and G. RUGGIU, Formalization of EXEL Conference Record of ACM Symposium on Principles of Programming Languages, Boston, 1973, p. 108-119. Zbl0308.68011
  22. 22. W. W. PETERSON, T. KASAMI and N. TOKURA, On the Capabilities of While, Repeat and Exit Statements, Comm. ACM, Vol. 16, N° 8, 1973, p. 503-512. Zbl0279.68008MR368466
  23. 23. J. C. REYNOLDS, GEDANKEN. A Simple Typeless Language Based on the Principle of Completeness and the Reference Concept, Comm. ACM, Vol. 13, N° 5, p. 308-319, 1970. Zbl0193.15101
  24. 24. J. C. REYNOLDS, Definitional Interpreters for Higher-Order. Programming Languages. Proc. 25th ACM, National Conference, 1972, p. 717-740. 
  25. 25. B. ROBINET, Un modèle sémantique pour un langage simple de programmation, 1. Fachtagung uber Automatentheorie und Formale Sprachen. Lecture Notes in Computer Science, N° 2, Springer-Verlag, 1973, p. 301-310. Zbl0277.68012MR443410
  26. 26. B. ROBINET, Contributions à l'étude de réalités informatiques, Thèse de Doctorat. Université Pierre-et-Marie-Curie. Paris, 1974. 
  27. 27. B. ROBINET et F. NOZIK, Sémantique des structures de contrôle. R.A.I.R.O., Informatique théorique, Vol. 11, N° 1, 1977, p. 63-74. Zbl0354.68027MR483652
  28. 28. G. RUGGIU, Les types et les appels de procédure, in Automata, Languages and Programming. M. Nivat, Ed., North-Holland, 1973, p. 319-330. Zbl0279.02014MR403293
  29. 29. G. RUGGIU, De l'organigramme à la formule, Thèse de Doctorat. Université Pierre et Marie Curie, Paris, 1974. 

NotesEmbed ?

top

You 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.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.