EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 16 / No 3 (1982) RAIRO. Inform. théor., 16 3 (1982) 225-244 References
Free Access
Issue
RAIRO. Inform. théor.
Volume 16, Number 3, 1982
Page(s) 225 - 244
DOI https://doi.org/10.1051/ita/1982160302251
Published online 01 February 2017
  1. 1. G. BIRKOFF, On the Structure of Abstract Algebras, Proc. Cambridge Phil. Soc. vol. 31, 1935, p. 433-454. [JFM: 61.1026.07] [Google Scholar]
  2. 2. G. BIRKOFF et J. D. LIPSON, Heterogeneous Algebras, Journal of Combinatorial Theory, vol. 8, 1970, p. 115-133. [MR: 250887] [Zbl: 0211.02003] [Google Scholar]
  3. 3. D. BENSON, Parameter Passing in Nondeterministie Recursive Programs, J. Comput. System Sc., vol. 19, 1979, p. 50-62. [MR: 546233] [Zbl: 0418.68011] [Google Scholar]
  4. 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] [Google Scholar]
  5. 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] [Google Scholar]
  6. 6. P. M. COHN, Universal Algebra, HARPER and Row, éd., New York, 1965. [MR: 175948] [Zbl: 0141.01002] [Google Scholar]
  7. 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] [Google Scholar]
  8. 8. L. FUCHS, On Partially Ordered Algebras I, Colloquium Math., vol. 14, 1966, p. 115-130. [EuDML: 262894] [MR: 184888] [Zbl: 0201.34702] [Google Scholar]
  9. 9. L. FUCHS, On Partially Ordered Algebras II, Acta Univ. Szegediensis, vol. 26, 1965, p. 34-41. [MR: 180514] [Zbl: 0192.09603] [Google Scholar]
  10. 10. N. D. GAUTAM, The Validity of Complex Algebras, Arch. Math. Logik Grundlagenforsh., vol. 3, 1957, p. 117-127. [EuDML: 137738] [MR: 92750] [Zbl: 0081.26005] [Google Scholar]
  11. 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] [Google Scholar]
  12. 12. G. GRATZER, Universal Algebra, Van Nostrand, 1968. [MR: 248066] [Zbl: 0182.34201] [Google Scholar]
  13. 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] [Google Scholar]
  14. 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] [Google Scholar]
  15. 15. D. KAPUR, Toward a Theory for Abstract Data Types, Massachusetts Institute of Technology, Ph. D. Thesis, May 1980, MIT/LCS/TR-237. [Google Scholar]
  16. 16. D. E. KNUTH, The Art of Computer Programming, vol. 1: Fundamental Algorithms, Addison Wesley, Reading, Mass., 1968. [Zbl: 0191.17903] [MR: 378456] [Google Scholar]
  17. 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] [Google Scholar]
  18. 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. [Google Scholar]
  19. 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] [Google Scholar]
  20. 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. [Google Scholar]
  21. 21. R. S. PIERCE, Introduction to the Theory of Abstract Algebras, Holt, Rinehart and Wilson, 1968. [MR: 227070] [Google Scholar]
  22. 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] [Google Scholar]
  23. 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] [Google Scholar]
  24. 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] [Google Scholar]
  25. 25. B. L. VAN DER WAERDEN, Moderne Algebra, Springer Verlag, Berlin, 1930. [Zbl: 0002.00804] [JFM: 56.0138.01] [Google Scholar]
  26. 26. M. WAND: Mathematical Foundations of Formal Languages Theory, MAC TR-108, Massachusetts Institute of Technology, Project MAC, Cambridge, Massachusetts, 1973. [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.