Modèles non déterministes de types abstraits

Pierre Lescanne

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1982)

  • Volume: 16, Issue: 3, page 225-244
  • ISSN: 0988-3754

How to cite

top

Lescanne, Pierre. "Modèles non déterministes de types abstraits." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 16.3 (1982): 225-244. <http://eudml.org/doc/92163>.

@article{Lescanne1982,
author = {Lescanne, Pierre},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {nondeterministic models of abstract data types; algebraic sets in heterogeneous algebras},
language = {fre},
number = {3},
pages = {225-244},
publisher = {EDP-Sciences},
title = {Modèles non déterministes de types abstraits},
url = {http://eudml.org/doc/92163},
volume = {16},
year = {1982},
}

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
PB - EDP-Sciences
VL - 16
IS - 3
SP - 225
EP - 244
LA - fre
KW - nondeterministic models of abstract data types; algebraic sets in heterogeneous algebras
UR - http://eudml.org/doc/92163
ER -

References

top
  1. 1. G. BIRKOFF, On the Structure of Abstract Algebras, Proc. Cambridge Phil. Soc. vol. 31, 1935, p. 433-454. JFM61.1026.07
  2. 2. G. BIRKOFF et J. D. LIPSON, Heterogeneous Algebras, Journal of Combinatorial Theory, vol. 8, 1970, p. 115-133. Zbl0211.02003MR250887
  3. 3. D. BENSON, Parameter Passing in Nondeterministie Recursive Programs, J. Comput. System Sc., vol. 19, 1979, p. 50-62. Zbl0418.68011MR546233
  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. Zbl0144.25502MR202641
  5. 5. M. N. BLEICHNER, M. SCHNEIDER et R. L. WILSON, Permanence on Identities on Algebras, Algebra Universalis, vol. 3, 1973, p. 75-93. Zbl0273.08010MR337723
  6. 6. P. M. COHN, Universal Algebra, HARPER and Row, éd., New York, 1965. Zbl0141.01002MR175948
  7. 7. B. COURCELLE et J. C. RAOULT, Completions of Ordered Magmas, Fundamenta Informaticae, vol. III.1, 1980, p. 105-116. Zbl0463.06005MR588060
  8. 8. L. FUCHS, On Partially Ordered Algebras I, Colloquium Math., vol. 14, 1966, p. 115-130. Zbl0201.34702MR184888
  9. 9. L. FUCHS, On Partially Ordered Algebras II, Acta Univ. Szegediensis, vol. 26, 1965, p. 34-41. Zbl0192.09603MR180514
  10. 10. N. D. GAUTAM, The Validity of Complex Algebras, Arch. Math. Logik Grundlagenforsh., vol. 3, 1957, p. 117-127. Zbl0081.26005MR92750
  11. 11. J. A. GOGUEN, J. W. THATCHER, E. G. WAGNER et J. B. WRIGHT, Initial Algebra Semanticsand Continuons Algebras, J. Assoc. Comput. Mach., vol. 24 1977, p. 68-85. Zbl0359.68018
  12. 12. G. GRATZER, Universal Algebra, Van Nostrand, 1968. Zbl0182.34201MR248066
  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. Zbl0387.68012MR513969
  14. 14. G. HUET, Confluent Reduction: Abstract Properties and Applications to Term Rewriting Systems, J. Assoc. Comput. Mach., vol. 27, 1980, p. 797-821. Zbl0458.68007MR594700
  15. 15. D. KAPUR, Toward a Theory for Abstract Data Types, Massachusetts Institute of Technology, Ph. D. Thesis, May 1980, MIT/LCS/TR-237. 
  16. 16. D. E. KNUTH, The Art of Computer Programming, vol. 1: Fundamental Algorithms, Addison Wesley, Reading, Mass., 1968. Zbl0191.17903MR378456
  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. Zbl0487.08010
  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. 
  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. Zbl0463.68009
  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. 
  21. 21. R. S. PIERCE, Introduction to the Theory of Abstract Algebras, Holt, Rinehart and Wilson, 1968. MR227070
  22. 22. B. K. ROSEN, Tree-Manipulation Systems and Church-Rosser Theorems, J. Assoc.Comput. Mach., vol. 20, 1973, p. 160-187. Zbl0267.68013MR331850
  23. 23. A. SHAFAAT, On Variettes Closed under the Construction of Power Algebras, Bull. Austral. Math. Soc, vol. 11, 1974, p. 213-218. Zbl0295.08002MR364055
  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. Zbl0468.68017
  25. 25. B. L. VAN DER WAERDEN, Moderne Algebra, Springer Verlag, Berlin, 1930. Zbl0002.00804JFM56.0138.01
  26. 26. M. WAND: Mathematical Foundations of Formal Languages Theory, MAC TR-108, Massachusetts Institute of Technology, Project MAC, Cambridge, Massachusetts, 1973. 

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.