Systèmes de déduction pour les arbres et les schémas de programmes (I)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 14 (1980) no. 3, pp. 247-278.
@article{ITA_1980__14_3_247_0,
     author = {Enjalbert, P.},
     title = {Syst\`emes de d\'eduction pour les arbres et les sch\'emas de programmes {(I)}},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {247--278},
     publisher = {EDP-Sciences},
     volume = {14},
     number = {3},
     year = {1980},
     zbl = {0441.68007},
     mrnumber = {593490},
     language = {fr},
     url = {http://archive.numdam.org/item/ITA_1980__14_3_247_0/}
}
TY  - JOUR
AU  - Enjalbert, P.
TI  - Systèmes de déduction pour les arbres et les schémas de programmes (I)
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1980
DA  - 1980///
SP  - 247
EP  - 278
VL  - 14
IS  - 3
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/ITA_1980__14_3_247_0/
UR  - https://zbmath.org/?q=an%3A0441.68007
UR  - https://www.ams.org/mathscinet-getitem?mr=593490
LA  - fr
ID  - ITA_1980__14_3_247_0
ER  - 
Enjalbert, P. Systèmes de déduction pour les arbres et les schémas de programmes (I). RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 14 (1980) no. 3, pp. 247-278. http://archive.numdam.org/item/ITA_1980__14_3_247_0/

1. J. Arsac La construction de programmes structurés, Dunod, Paris, 1977. | Zbl 0451.68014

2. M. A. Arbib et S. Alagic, Proof Rules for « Gotos », Acta Informatica, vol. 11, 1979, p. 139-148.

3. L. Banakowski, A. Kreczmar, G. Mirkowska, H. Rasiowa et A. Salwicki, An Introduction to Algorithmic Logic. Mathematical Investigations in the Theory of Programs, in Banach Center Publications V. 2 Mathematical Foundations of Computer Science, P. W. N. Polish Scientific Publishers, 1977, Warsaw, p. 7-99. | Zbl 0358.68035

4. J. W. De Bakker, Recursive Programs as Predicate Transformers, in Formal descriptions of programing concepts, E. J. NEUHOLD, éd., North-Holland, 1978, p. 165-202. | MR 537905 | Zbl 0392.68006

5. Chang Keisler, Model Theory, N.-H. Amsterdam. | Zbl 0697.03022

6. S. A. Cook, Soundness and Completeness for an Axiom System for Program Verification, J.S.I.A.M. on Computing, vol. 7, 1978, p. 70-90. | MR 495086 | Zbl 0374.68009

7. M. Clint et C. A. R. Hoare, Program Proving: Jumps and Functions, Acta Informatica, vol. 1, 1972, p. 214-224. | Zbl 0229.68003

8. B. Courcelle et M. Nivat, The algebraic Semantics of Recursive Program Schemes, in Proc. 7th Math. Found of Comput. Sc. Symposium, 1978, Lecture Notes in Comput. Sc., vol. 62, p. 16-30. | MR 519827 | Zbl 0384.68016

9. G. Cousineau Les arbres à feuilles indicées : un cadre algébrique de définition des structures de contrôle, Thèse d'État, Paris, 1977.

10. G. Cousineau, An algebraic definition of control structures, L.I.T.P. Report, 78-27 (à paraître dans Theor. Comp. Sci.). | Zbl 0456.68015

11. G. Cousineau, La programmation en EXEL, 1re partie; Revue Technique THOMSON-CSF, vol. 10, n°2, 1978, p. 209-234.

12. G. Cousineau, La Programmation en EXEL, 2e partie, Revue Technique THOMSON-CSF, vol. 11, n° 1, 1979, p. 13-35.

13. G. Cousineau et P. Enjalbert, Program Equivalence and Provability, in Proc. 8th Math. Found. of Comput. Sc. Symposium, 1979, Lecture Notes in Comput. Sc., n° 74, p. 237-245. | Zbl 0404.68014

14. E. W. Dijskra, Guarded Commands, Non Determinacy and Formal Derivations of Programs, Corn. Assoc. comput. Math., vol. 18, n° 8, 1975, p. 453-457. | MR 383808 | Zbl 0308.68017

15. Doner, Tree Acceptors and Some of their Applications, J. Comput. System Sci., vol. 4, 1970, p. 406-451. | MR 287977 | Zbl 0212.02901

16. D. Harel, Dynamic Logic, Springer Lecture Notes in Comput. Sc., vol. 68, 1979. | MR 567695 | Zbl 0403.03024

17. D. Harel, A. Meyer et V. R. Pratt, Computability and Completeness in Logics of Programs, Proc. 9th Annual A.C.M. Symposium on Theory of Computing, 1977, p. 261-268. | MR 495101

18. C. A. R. Hoare, An Axiomatic Basis for Computer Programing, Com. Assoc. Comput. Math., vol. 12, 1969, p. 576-580. | Zbl 0179.23105

19. C. A. R. Hoare et P. E. Lauer, Consistent and Complementary Formal Theories of the Semantics of Programming Languages, Acta Informatica, vol. 3, 1974, p. 135-153. | MR 464644 | Zbl 0264.68006

20. S. Igarashi, R. L. London et D. C. Luckman, Automatic Verification I..., Acta Informatica, vol. 4, 1975, p. 149-181.

21. M. Nivat, Chartes, arbres, Programmes itératifs, I.R.I.A.-S.E.S.O.R.I., Journées d'étude : Synthèse, Manipulation et transformation des programmes, 1978, p. 165-187.

22. L. Nolin et G. Ruggiu, A Formalization of EXEL, Assoc. Comput. Math. SIGACT-SIGPLAN Symposium on the Principle of Programming Languages, Boston, 1973. | Zbl 0308.68011

23. R. Parikh, Second Order Process Logic, 19th I.E.E.E. Symposium on Found. of Computer Science, 1978.

24. V. R. Pratt, Semantical Consideration on Floyd-Hoare Logic, 17th I.E.E.E. Symposium on Foundation of Computer Science, 1976, p. 109-121. | MR 502164

25. G. Ruggiu, De l'organigramme à la formule, Thèse d'État, Paris, 1973.

26. M. Wand, A new Incompleteness Result for Hoare's System, J. Assoc. Comput Mach., vol. 25, 1978, p. 168-175. | MR 474964 | Zbl 0364.68008