Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Replace this file with prentcsmacro.sty for your meeting, or with entcsmacro.sty for your meeting. Both can be
 

Summary: Replace this file with prentcsmacro.sty for your meeting,
or with entcsmacro.sty for your meeting. Both can be
found at the ENTCS Macro Home Page.
A PVS Theory for Term Rewriting Systems
Andr´e L. Galdino1,2
Grupo de Teoria da Computa¸c~ao, Departamento de Matem´atica, Universidade de Bras´ilia
Bras´ilia D.F., Brazil &
Departamento de Matem´atica, Universidade Federal de Goi´as
Catal~ao, Brazil
Mauricio Ayala-Rinc´on1,3
Grupo de Teoria da Computa¸c~ao, Departamento de Matem´atica, Universidade de Bras´ilia
Bras´ilia D.F., Brazil
Abstract
A theory, called trs, for Term Rewriting Systems in the theorem Prover PVS is described. This theory is
built on the PVS libraries for finite sequences and sets and a previously developed PVS theory named ars
for Abstract Reduction Systems which was built on the PVS libraries for sets. Theories for dealing with
the structure of terms, for replacements and substitutions jointly with ars allow for adequate specifications
of notions of term rewriting such as critical pairs and formalization of elaborated criteria from the theory of
Term Rewriting Systems such as the Knuth-Bendix Critical Pair Theorem. On the other hand, ars specifies
definitions and notions such as reduction, confluence and normal forms as well as non basic concepts such

  

Source: Ayala-Rincón, Mauricio - Departamento de Matemática, Universidade de Brasília

 

Collections: Mathematics