@article{ITA_1982__16_3_225_0, author = {Lescanne, Pierre}, title = {Mod\`eles non d\'eterministes de types abstraits}, journal = {RAIRO. Informatique th\'eorique}, pages = {225--244}, publisher = {EDP-Sciences}, volume = {16}, number = {3}, year = {1982}, mrnumber = {686914}, zbl = {0491.68013}, language = {fr}, url = {http://archive.numdam.org/item/ITA_1982__16_3_225_0/} }
Lescanne, Pierre. Modèles non déterministes de types abstraits. RAIRO. Informatique théorique, Tome 16 (1982) no. 3, pp. 225-244. http://archive.numdam.org/item/ITA_1982__16_3_225_0/
1. On the Structure of Abstract Algebras, Proc. Cambridge Phil. Soc. vol. 31, 1935, p. 433-454. | JFM | Zbl
,2. Heterogeneous Algebras, Journal of Combinatorial Theory, vol. 8, 1970, p. 115-133. | MR | Zbl
et ,3. Parameter Passing in Nondeterministie Recursive Programs, J. Comput. System Sc., vol. 19, 1979, p. 50-62. | MR | Zbl
,4. Completion of Partially Ordered Set and Universal Algebras, Acta Math. Acad Sc. Hungaricae, vol. 17, 1966, p. 271-301. | MR | Zbl
et ,5. Permanence on Identities on Algebras, Algebra Universalis, vol. 3, 1973, p. 75-93. | MR | Zbl
, et ,6. Universal Algebra, HARPER and Row, éd., New York, 1965. | MR | Zbl
,7. Completions of Ordered Magmas, Fundamenta Informaticae, vol. III.1, 1980, p. 105-116. | MR | Zbl
et ,8. On Partially Ordered Algebras I, Colloquium Math., vol. 14, 1966, p. 115-130. | EuDML | MR | Zbl
,9. On Partially Ordered Algebras II, Acta Univ. Szegediensis, vol. 26, 1965, p. 34-41. | MR | Zbl
,10. The Validity of Complex Algebras, Arch. Math. Logik Grundlagenforsh., vol. 3, 1957, p. 117-127. | MR | Zbl
,11. Initial Algebra Semanticsand Continuons Algebras, J. Assoc. Comput. Mach., vol. 24 1977, p. 68-85. | Zbl
, , et ,12. Universal Algebra, Van Nostrand, 1968. | MR | Zbl
,12. Abstract Data Types and Software Validation, Comm. Assoc. Comput. Mach., vol. 21 1978, p. 1048-1064. | MR | Zbl
. et ,14. Confluent Reduction: Abstract Properties and Applications to Term Rewriting Systems, J. Assoc. Comput. Mach., vol. 27, 1980, p. 797-821. | MR | Zbl
,15. Toward a Theory for Abstract Data Types, Massachusetts Institute of Technology, Ph. D. Thesis, May 1980, MIT/LCS/TR-237.
,16. The Art of Computer Programming, vol. 1: Fundamental Algorithms, Addison Wesley, Reading, Mass., 1968. | MR
,17. Algèbres de mots et Algèbre Universelle, Colloque A.F.C.E.T-S.M.F., tome II, 1978, p. 147-156. | Zbl
,18. É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. CLU Reference Manual, Lecture Notes in Computer Science, vol. 114, 1981. | Zbl
, , , , , et ,20. 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. Introduction to the Theory of Abstract Algebras, Holt, Rinehart and Wilson, 1968. | MR
,22. Tree-Manipulation Systems and Church-Rosser Theorems, J. Assoc.Comput. Mach., vol. 20, 1973, p. 160-187. | MR | Zbl
,23. On Variettes Closed under the Construction of Power Algebras, Bull. Austral. Math. Soc, vol. 11, 1974, p. 213-218. | MR | Zbl
,24. Nondetermimsm in Abstract Data Types8th Int. Coll. on Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 115, 1981, p. 148-164. | Zbl
,25. Moderne Algebra, Springer Verlag, Berlin, 1930. | JFM | Zbl
,26. Mathematical Foundations of Formal Languages Theory, MAC TR-108, Massachusetts Institute of Technology, Project MAC, Cambridge, Massachusetts, 1973.
: