Modèles non déterministes de types abstraits
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 16 (1982) no. 3, pp. 225-244.
@article{ITA_1982__16_3_225_0,
     author = {Lescanne, Pierre},
     title = {Mod\`eles non d\'eterministes de types abstraits},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {225--244},
     publisher = {EDP-Sciences},
     volume = {16},
     number = {3},
     year = {1982},
     zbl = {0491.68013},
     mrnumber = {686914},
     language = {fr},
     url = {http://www.numdam.org/item/ITA_1982__16_3_225_0/}
}
TY  - JOUR
AU  - Lescanne, Pierre
TI  - Modèles non déterministes de types abstraits
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1982
DA  - 1982///
SP  - 225
EP  - 244
VL  - 16
IS  - 3
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/ITA_1982__16_3_225_0/
UR  - https://zbmath.org/?q=an%3A0491.68013
UR  - https://www.ams.org/mathscinet-getitem?mr=686914
LA  - fr
ID  - ITA_1982__16_3_225_0
ER  - 
Lescanne, Pierre. Modèles non déterministes de types abstraits. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 16 (1982) no. 3, pp. 225-244. http://www.numdam.org/item/ITA_1982__16_3_225_0/

1. G. Birkoff, On the Structure of Abstract Algebras, Proc. Cambridge Phil. Soc. vol. 31, 1935, p. 433-454. | JFM 61.1026.07 | Zbl 0013.00105

2. G. Birkoff et J. D. Lipson, Heterogeneous Algebras, Journal of Combinatorial Theory, vol. 8, 1970, p. 115-133. | MR 250887 | Zbl 0211.02003

3. D. Benson, Parameter Passing in Nondeterministie Recursive Programs, J. Comput. System Sc., vol. 19, 1979, p. 50-62. | MR 546233 | Zbl 0418.68011

4. M. N. Bleichner et M. Schneider, Completion of Partially Ordered Set and Universal Algebras, Acta Math. Acad Sc. Hungaricae, vol. 17, 1966, p. 271-301. | MR 202641 | Zbl 0144.25502

5. M. N. Bleichner, M. Schneider et R. L. Wilson, Permanence on Identities on Algebras, Algebra Universalis, vol. 3, 1973, p. 75-93. | MR 337723 | Zbl 0273.08010

6. P. M. Cohn, Universal Algebra, HARPER and Row, éd., New York, 1965. | MR 175948 | Zbl 0141.01002

7. B. Courcelle et J. C. Raoult, Completions of Ordered Magmas, Fundamenta Informaticae, vol. III.1, 1980, p. 105-116. | MR 588060 | Zbl 0463.06005

8. L. Fuchs, On Partially Ordered Algebras I, Colloquium Math., vol. 14, 1966, p. 115-130. | EuDML 262894 | MR 184888 | Zbl 0201.34702

9. L. Fuchs, On Partially Ordered Algebras II, Acta Univ. Szegediensis, vol. 26, 1965, p. 34-41. | MR 180514 | Zbl 0192.09603

10. N. D. Gautam, The Validity of Complex Algebras, Arch. Math. Logik Grundlagenforsh., vol. 3, 1957, p. 117-127. | MR 92750 | Zbl 0081.26005

11. J. A. Goguen, J. W. Thatcher, E. G. Wagner etJ. B. Wright, Initial Algebra Semanticsand Continuons Algebras, J. Assoc. Comput. Mach., vol. 24 1977, p. 68-85. | Zbl 0359.68018

12. G. Gratzer, Universal Algebra, Van Nostrand, 1968. | MR 248066 | Zbl 0182.34201

12. J. V. Guttag. E. Horowitz et D. R. Musser, Abstract Data Types and Software Validation, Comm. Assoc. Comput. Mach., vol. 21 1978, p. 1048-1064. | MR 513969 | Zbl 0387.68012

14. G. Huet, Confluent Reduction: Abstract Properties and Applications to Term Rewriting Systems, J. Assoc. Comput. Mach., vol. 27, 1980, p. 797-821. | MR 594700 | Zbl 0458.68007

15. D. Kapur, Toward a Theory for Abstract Data Types, Massachusetts Institute of Technology, Ph. D. Thesis, May 1980, MIT/LCS/TR-237.

16. D. E. Knuth, The Art of Computer Programming, vol. 1: Fundamental Algorithms, Addison Wesley, Reading, Mass., 1968. | MR 378456

17. P. Lescanne, Algèbres de mots et Algèbre Universelle, Colloque A.F.C.E.T-S.M.F., tome II, 1978, p. 147-156. | Zbl 0487.08010

18. P. Lescanne, Étude algébrique et relationnelle des types abstraits et de leurs représentations, Thèse d'État, Institut National Polytechnique de Lorraine, Centre de Recherche en Informatique de Nancy, C.R.I.N. 79-T-059, 1979.

19. B. Liskov, R. Atkinson, T. Bloom, E. Moss, J. G. Schaffert, R. Scheifler et A. Snyder, CLU Reference Manual, Lecture Notes in Computer Science, vol. 114, 1981. | Zbl 0463.68009

20. P. Marchand, Langages d'Arbres, Langages dans les Algèbres Libres, Thèse d'État, Université de Nancy 1, Centre de Recherche en Informatique de Nancy, C.R.I.N. 81-T-030, 1981.

21. R. S. Pierce, Introduction to the Theory of Abstract Algebras, Holt, Rinehart and Wilson, 1968. | MR 227070

22. B. K. Rosen, Tree-Manipulation Systems and Church-Rosser Theorems, J. Assoc.Comput. Mach., vol. 20, 1973, p. 160-187. | MR 331850 | Zbl 0267.68013

23. A. Shafaat, On Variettes Closed under the Construction of Power Algebras, Bull. Austral. Math. Soc, vol. 11, 1974, p. 213-218. | MR 364055 | Zbl 0295.08002

24. P. A. Subrahmanyam, Nondetermimsm in Abstract Data Types8th Int. Coll. on Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 115, 1981, p. 148-164. | Zbl 0468.68017

25. B. L. Van Der Waerden, Moderne Algebra, Springer Verlag, Berlin, 1930. | JFM 56.0138.01 | Zbl 0002.00804

26. M. Wand: Mathematical Foundations of Formal Languages Theory, MAC TR-108, Massachusetts Institute of Technology, Project MAC, Cambridge, Massachusetts, 1973.