Advertisement

Orme an implementation of completion procedures as sets of transitions rules

  • Pierre Lescanne
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 449)

References

  1. [Bac87]
    L. Bachmair. Proof methods for equational theories. PhD thesis, University of Illinois, Urbana-Champaign, 1987. Revised version, August 1988.Google Scholar
  2. [BDH86]
    L. Bachmair, N. Dershowitz, and J. Hsiang. Orderings for equational proofs. In Proceedings Symp. Logic in Computer Science, pages 346–357, Boston (Massachusetts USA), 1986.Google Scholar
  3. [BN89]
    L. Bachmair and Dershowitz N. Completion for rewriting modulo a congruence. Theoretical Computer Science, 67(2–3):173–202, October 1989.Google Scholar
  4. [FOR87]
    Projet FORMEL. The CAML Anthology. July 1987. Internal Document.Google Scholar
  5. [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
  6. [PMA*89]
    P. Weis, M. V. Aponte, A. Laville, M. Mauny, and A. Suárez. The CAML Manuel Reference. Technical Report, Projet Formel, INRIA-ENS, 1989. Version 2.6.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-LorraineVandœuvre-lès-NancyFrance

Personalised recommendations