Robinet, Bernard; Nozick, Francois Semantique des structures de contrôle. (French) Zbl 0354.68027 RAIRO, Inf. Théor. 11, 63-74 (1977). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 1 ReviewCited in 4 Documents MSC: 68N01 General topics in the theory of software 68Q45 Formal languages and automata × Cite Format Result Cite Review PDF Full Text: EuDML References: [1] 1. J. ARSAC, Nouvelles leçons de programmation, Publications de l’Institut de Programmation, n^\circ IP 75-29. [2] 2. 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^\circ 3, 1974, p. 715-736. [3] 3. E. ASHCROFT et Z. MANNA, The Translation of < GO TO > Programs to < WHILE > Programs, I.F.I.P. 71, C. V. FREIMAN éd., North-Holland Pub., 1972, p. 250-255. MR400762 [4] 4. G. V. BOCHMANN, Multiple Exists From a Loop Without the Goto, Comm. A.C.M., vol. 16, n^\circ 6, 1973, p. 443-444. [5] 5. C. BÖHM et G. JACOPINI, Flow-diagrams, Turing Machines and Languages with Only Two Formation Rules, Comm. A.C.M., vol. 9, n^\circ 5, 1966, p. 365-371. Zbl0145.24204 · Zbl 0145.24204 · doi:10.1145/355592.365646 [6] 6. D. C. COOPER, Böhm and Jacopini’s Reduction of Flow Charts, Comm. A.C.M., vol. 10, n^\circ 8, 1967, p. 463-464. [7] 7. E. W. DIJKSTRA, Goto Statement Considered Harmful, Comm. A.C.M., vol. 11, n^\circ 3, 1968, p. 147-148. [8] 8. R. W. FLOYD, Assigning Meanings to Programs, Proc. of a Symposium in Applied Mathematics, Math. Aspects of Computer Science, A.M.S., 1967, p. 19-32. Zbl0189.50204 MR235771 · Zbl 0189.50204 [9] 9. P. HENDERSON, Derived Semantics for Some Programming Language Constructs, Comm. A.C.M., vol. 15, n^\circ 11, 1972, p. 967-973. Zbl0245.68030 · Zbl 0245.68030 · doi:10.1145/355606.361880 [10] 10. D. E. KNUTH et R. W. FLOYD, Notes on Avoiding <GO TO > Statements, Inf. Process. Letters, n^\circ 1, 1971, p. 23-31. · Zbl 1260.68047 [11] 11. J. KOTT, Remarques sur la structure des schémas de programmes. Automata, Languages and Programming, M. NIVAT éd., North-Holland Pub., 1973, p. 265-271. Zbl0262.68005 MR383811 · Zbl 0262.68005 [12] 12. B. LORHO, De la définition à la traduction des langages de programmation : méthode des attributs sémantiques, Thèse, Université Paul-Sabatier de Toulouse, 1974. [13] 13. J. MCCARTHY, Towards a mathematical Science of Computation, Proc. I.F.I.P. Cong., North Holland Pub. Co., 1962, p. 21-28. [14] 14. L. NOLIN et G. RUGGIU, Formalization of Exel, Proc. of the ACM Symp. on Principles of Programming Languages, Boston, 1973, p. 108-119. Zbl0308.68011 · Zbl 0308.68011 [15] 15. B. ROBINET, Un modèle fonctionnel des structures de contrôle, R.A.I.R.O., Informatique théorique (à paraître). Zbl0389.68015 · Zbl 0389.68015 [16] 16. B. ROBINET, About the Logical Foundations of Data Types, New Directions on Algorithmic Languages, 1976, S. SCHUMAN éd., Proc. of a WG. 2.1. Meeting. Zbl0383.68024 · Zbl 0383.68024 [17] 17. R. D. TENNENT, The Denotational Semantics of Programming Languages, Comm. A.C.M., vol. 19, n^\circ 8, 1976, p. 437-453. Zbl0337.68010 MR428771 · Zbl 0337.68010 · doi:10.1145/360303.360308 [18] 18. N. WIRTH, The Programming Language Pascal (Revised Report), E.T.H. Zürich, Berichte der Fachgruppe Computer Wissenschaften, n^\circ 5, 1972. · Zbl 0205.18603 [19] 19. W. A. WULF, D. B. RUSSELL et A. N. HABERMAN, Bliss : a Language for Programming Systems, Comm. A.C.M., vol. 14, n^\circ 12, 1971, p. 780-790. Zbl0224.68001 MR309353 · Zbl 0224.68001 · doi:10.1145/362919.362936 [20] 20. C. T. ZAHN, A Control Statement for Natural Top-down Programming, Programming Symposium, B. ROBINET éd., Springer-Verlag, Lecture Notes in Computer Science, vol. 19, 1974, p. 170-179. Zbl0293.68017 · Zbl 0293.68017 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.