Implementation of completion by transition rules + control: ORME

  • Pierre Lescanne
Invited Talk
Part of the Lecture Notes in Computer Science book series (LNCS, volume 463)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AK90]
    M. Adi and C. Kirchner. AC-unification race: the system solving approach. In Proceedings of DISCO'90, Capri (Italy), 1990.Google Scholar
  2. [Bac87]
    L. Bachmair. Proof methods for equational theories. PhD thesis, University of Illinois, Urbana-Champaign, 1987. Revised version, August 1988.Google Scholar
  3. [Ben86]
    J. Bentley. Programming pearls: literate programming. Communications of the Association for Computing Machinery, 29(5):364–369, 1986.Google Scholar
  4. [CSY89]
    S.C. Chou, W.F. Schelter, and J.G. Yang. Characteristics sets and Gröbner bases in geometry theorem proving. In H. Aït-Kaci and M. Nivat, editors, Resolution of Equations in Algebraic Structures, pages 33–91, Academic Press, INC, New York, 1989.Google Scholar
  5. [Ham90]
    A. Habacha Hamada. Implantation d'un algorithme de complétion conditionnelle basé sur le raisonnement par cas. Rapport interne, Centre de Recherche en Informatique de Nancy, Vandœuvre-lès-Nancy, 1990.Google Scholar
  6. [Knu84]
    D. E. Knuth. Literate programming. The Computer Journal, 27(2):97–111, 1984.Google Scholar
  7. [Les89]
    P. Lescanne. Completion procedures as transition rules + control. In M. Diaz and F. Orejas, editors, TAPSOFT'89, pages 28–41, Springer-Verlag, Lecture Notes in Computer Science, 1989. Vol. 351.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Pierre Lescanne
    • 1
  1. 1.Centre de Recherche en Informatique de Nancy (CNRS) and INRIA-LorraineCampus ScientifiqueVandœuvre-lès-NancyFrance

Personalised recommendations