Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
POLO ---A System for Termination Proofs using Polynomial Orderings \Lambda
 

Summary: POLO --- A System for Termination Proofs using
Polynomial Orderings \Lambda
J¨urgen Giesl
FB Informatik, Technische Hochschule Darmstadt,
Alexanderstr. 10, 64283 Darmstadt, Germany
Email: giesl@inferenzsysteme.informatik.th­darmstadt.de
Abstract
POLO is a system for both semi­automatic and fully automated ter­
mination proofs of term rewriting systems using polynomial orderings.
In this paper we describe the system's user interface and illustrate its
performance with some examples.
1 Introduction
In [Gie95a] and [Gie95b] we presented a method for automated termination
proofs of term rewriting systems using polynomial orderings. This technique
has been implemented in the POLO system. It runs under Common Lisp and
is available by anonymous ftp from kirmes.inferenzsysteme.informatik.
th­darmstadt.de under pub/termination.
To run the system please start your Lisp, compile the file polo.lisp, load
the compiled version and change the package to polo. More precisely, you have
to enter the following commands. User inputs are printed in bold face.

  

Source: Ábrahám, Erika - Fachgruppe Informatik, Rheinisch Westfälische Technische Hochschule Aachen (RWTH)

 

Collections: Computer Technologies and Information Sciences