EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 11 / No 3 (1977) RAIRO. Inform. théor., 11 3 (1977) 213-236 References
Free Access
Issue
RAIRO. Inform. théor.
Volume 11, Number 3, 1977
Page(s) 213 - 236
DOI https://doi.org/10.1051/ita/1977110302131
Published online 01 February 2017
  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. [Google Scholar]
  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. [EuDML: 92049] [Zbl: 0358.68018] [Google Scholar]
  3. 3. J. ARSAC, La construction de programmes structurés, Dunod, Paris, 1977. [Zbl: 0451.68014] [Google Scholar]
  4. 4. D. BERRY, Implementation of a Contour Model Lambda-Calculus Machine, TR n° 71-44. Brown University 1971. [Google Scholar]
  5. 5. C. BÖHM and W. GROSS, Introduction to the CUCH, Automata Theory, E. R. Caianello, Ed. Academic Press, 1966, p. 35-65. [Zbl: 0192.06903] [Google Scholar]
  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. [Google Scholar]
  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. [Zbl: 0145.24204] [Google Scholar]
  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. [Zbl: 0277.68026] [Google Scholar]
  9. 9. R. CASTANET, Sémantique formelle des opérateurs d'un language de liste, RAIRO, R-3, 1974, p. 19-36. [EuDML: 92008] [MR: 366631] [Zbl: 0325.68012] [Google Scholar]
  10. 10. G. COUSINEAU, Transformations de programmes itératifs, in Programmation B. Robinet, Ed., Dunod, 1977, p. 53-74. [Google Scholar]
  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. [Google Scholar]
  12. 12. H. B. CURRY, R. FEYS and W. CRAIG, Combinatory Logic, Vol. 1. North-Holland, 1958. [MR: 94298] [Zbl: 0081.24104] [Google Scholar]
  13. 13. M. J. FISCHER, Lambda-Calculus Schemata, Proc. ACM Conference on Proving Assertions About Programs. Las Cruces, 1972, p. 104-109. [Google Scholar]
  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. [MR: 335242] [Zbl: 0269.02005] [Google Scholar]
  15. 15. P. J. LANDIN, A Lambda-Calculus Approach, Advances in Programming and Non-Numerical Computation. Pergamon Press, 1966, p. 97-141. [Zbl: 0203.16406] [Google Scholar]
  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. [Zbl: 0134.33403] [Google Scholar]
  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. [MR: 428751] [Google Scholar]
  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. [Zbl: 0101.10413] [Google Scholar]
  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. [Google Scholar]
  20. 20. J. H. MORRIS, Lambda-Calculus Models of Programming Languages, Ph. D., MIT, 1968. [Google Scholar]
  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. [Zbl: 0308.68011] [Google Scholar]
  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. [MR: 368466] [Zbl: 0279.68008] [Google Scholar]
  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. [Zbl: 0193.15101] [Google Scholar]
  24. 24. J. C. REYNOLDS, Definitional Interpreters for Higher-Order. Programming Languages. Proc. 25th ACM, National Conference, 1972, p. 717-740. [Google Scholar]
  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. [MR: 443410] [Zbl: 0277.68012] [Google Scholar]
  26. 26. B. ROBINET, Contributions à l'étude de réalités informatiques, Thèse de Doctorat. Université Pierre-et-Marie-Curie. Paris, 1974. [Google Scholar]
  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. [EuDML: 92043] [MR: 483652] [Zbl: 0354.68027] [Google Scholar]
  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. [MR: 403293] [Zbl: 0279.02014] [Google Scholar]
  29. 29. G. RUGGIU, De l'organigramme à la formule, Thèse de Doctorat. Université Pierre et Marie Curie, Paris, 1974. [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.