Geodesic
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.

Voir la notice de l'article provenant de la source Numdam

@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},
     mrnumber = {686914},
     zbl = {0491.68013},
     language = {fr},
     url = {http://geodesic.mathdoc.fr/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
SP  - 225
EP  - 244
VL  - 16
IS  - 3
PB  - EDP-Sciences
UR  - http://geodesic.mathdoc.fr/item/ITA_1982__16_3_225_0/
LA  - fr
ID  - ITA_1982__16_3_225_0
ER  - 
%0 Journal Article
%A Lescanne, Pierre
%T Modèles non déterministes de types abstraits
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1982
%P 225-244
%V 16
%N 3
%I EDP-Sciences
%U http://geodesic.mathdoc.fr/item/ITA_1982__16_3_225_0/
%G fr
%F ITA_1982__16_3_225_0
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://geodesic.mathdoc.fr/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 | Zbl

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

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

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. | Zbl | MR

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

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

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

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

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

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

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

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

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. | Zbl | MR

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

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

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

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

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

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

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

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

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

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