EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 26 / No 3 (1992) RAIRO-Theor. Inf. Appl., 26 3 (1992) 221-242 References
Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 26, Number 3, 1992
Page(s) 221 - 242
DOI https://doi.org/10.1051/ita/1992260302211
Published online 01 February 2017
  1. [Ar.Ni. 1] A. ARNOLD et M. NIVAT, The metric space of infinite trees. Algebraic and topological properties, Annales Societatis Matkernaticae Polonae, Séries IV : Fund. Inform., 1980, III, 4, p. 445-476. [MR: 604273] [Zbl: 0453.68021] [Google Scholar]
  2. [Ber.2] J. BERSTEL, Mots sans carré et morphismes itérés, Discrete Math., 1980, 29, p. 235-244. [MR: 560766] [Zbl: 0444.20050] [Google Scholar]
  3. [Ber. 3] J. BERSTEL, Some recent results on squarefree words, Conférence au « Symposium for Theoretical Aspect of Computer Science », (STACS'84), Paris, avril 1984. [MR: 773306] [Zbl: 0582.68042] [Google Scholar]
  4. [B.B.C. 4] G. BLANC, N. BLEUZEN-GUERNALEC et S. COUPET, Kleene Functor and Logic Programming, Laboratoire de Mathématiques de Marseille, 1989. [Google Scholar]
  5. [Bl.Blg. 5] G. BLANC et N. BLEUZEN-GUERNALEC, Topologie et Décidabilité dans les Algèbres de mots infinis, Rapport technique, Dept. de Math., Marseille-Luminy, 1990. [Google Scholar]
  6. [Cla. 6] K. L. CLARK, Negation as Failure, in Logic and Database, H. GALLAIRE et J. MINKER éd., Plenum Press, New York, 1978, p. 293-322. [Google Scholar]
  7. [Col. 7] A. COLMERAUER, Prolog and Infinite Trees, in Logic Programming, K. L. CLARK et S. A. TARNLUND éd., Academic Press, New York, 1982, p. 231-251. [MR: 754008] [Google Scholar]
  8. [Col. 8] A. COLMERAUER, Une introduction à Prolog III, Note du G.I.A., Université d'Aix-Marseille-II, 1989. [Google Scholar]
  9. [Coup. 9] S. COUPET-GRIMAL, Deux arguments pour les arbres infinis en Prolog, Thèse de Doctorat de l'Université d'Aix-Marseille-II, 1988. [Google Scholar]
  10. [Cour. 10] B. COURCELLE, Fundamental properties of infinite Trees, Theoret. Comput. Sci., 1983, 25, (2), p. 95-169. [MR: 693076] [Zbl: 0521.68013] [Google Scholar]
  11. [v.Em.Ko. 11] M. H. VAN EMDEN et R. A. KOWALSKI, The semantics of Predicate Logic as a programming Language, J. A.C.M., 1976, 23, 4, p. 733-742. [MR: 455509] [Zbl: 0339.68004] [Google Scholar]
  12. [v.Em.Ll. 12] M. H. VAN EMDEN et W. LLOYD, A logical reconstruction of Prolog II, Proc. 2nd Conference on Logic Programming, Uppsala, Sweden, 1984, p. 35-40. [Zbl: 0594.68033] [Google Scholar]
  13. [Ja.La. 13] J. JAFFAR et J. L. LASSEZ, Constraint Logic Programming, Technical Report, Dept. of Comp. Sci., Monash University, juin 1986. [Google Scholar]
  14. [Ja.La. 14] J. JAFFAR et J. L. LASSEZ, Constraint Logic Programming, in Proc. Conf. on Principles of Programming Languages, 1987. [Google Scholar]
  15. [J.L.M. 15] J. JAFFAR, J. L. LASSEZ et M. J. MAHER, A logical foundation for Prolog II, technical report n 45, Monash University, 1985. [Google Scholar]
  16. [J.L.M. 16] J. JAFFAR, J. L. LASSEZ et M. J. MAHER, Some issues and trends in the semantics of Logic Programming, Proc. 3rd International Conference on Logic Programming LNCS 225, Springer-Verlag, 1986. [Google Scholar]
  17. [Ja.St. 17] J. JAFFAR et P. STUCKEY, Semantics of infinite tree logic programming, Theoret. Comput. Sci., 1986, 46, p. 141-158. [MR: 869203] [Zbl: 0621.68054] [Google Scholar]
  18. [Llo. 18] J. W. LLOYD, Foundation of Logic Programming, Symbolic Computation, Springer-Verlag, 1984. [Zbl: 0547.68005] [Google Scholar]
  19. [Mac. 19] A. MACINTYRE, Model Completeness, in Handbook of Mathematical Logic, J. BARWISE éd., North-Holland, 1978. [Google Scholar]
  20. [Mah. 20] M. J. MAHER, Complete axiomatization of the algebras of finite, rational and infinite trees, Draft of paper in 3rd Logic in Computer Science Conference, Edinburgh, 1988. [Google Scholar]
  21. [Ni.Pe. 21] M. NIVAT et D. PERRIN, Automata on Infinite Words, École de Printemps d'Informatique Théorique, Le Mont-Dore, mai 1984, Lecture Notes in Comput. Sci., 192 [Zbl: 0563.00019] [Google Scholar]
  22. [Re.Sa.22] A. RESTIVO et S. SALEMI, Overlap free words on two symbols, Lecture Notes in Comput. Sci., 1984, 192, p. 198-206. [MR: 814744] [Zbl: 0572.20038] [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.