A narrowing-based theorem prover

  • Ulrich Fraus
  • Heinrich Hußmann
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 488)


This work presents a theorem prover for inductive proofs within an equational theory which supports the verification of universally quantified equations. This system, called TIP, is based on a modification of the well-known narrowing algorithm. Particulars of the implementation are stated and practical experiences are summarized.


  1. [Fr, Hu 90]
    U. Fraus, H. Hußmann: A Narrowing-Based Theorem Prover (long version). Internal report, University of Passau, 1990Google Scholar
  2. [Gu 75]
    J. V. Guttag: The specification and application to programming of abstract data types. Ph.D. thesis, University of Toronto, Toronto, 1975.Google Scholar
  3. [Re 90]
    U. S. Reddy: Term Rewriting Induction. CADE 10, Lecture Notes in Computer Science 249, 1990, 162–177.Google Scholar
  4. [Wi e.a. 83]
    M. Wirsing, P. Pepper, H. Partsch, W. Dosch, M. Broy: On hierarchies of abstract data types. Acta Informatica 20, 1983, 1–33.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Ulrich Fraus
    • 1
  • Heinrich Hußmann
    • 2
  1. 1.Bayerisches Forschungszentrum für Wissensbasierte SystemeUniversität PassauPassauGermany
  2. 2.Institut für InformatikTechnische Universität MünchenMünchen 2Germany

Personalised recommendations