Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Second-Order Matching via Explicit Substitutions
 

Summary: Second-Order Matching via Explicit
Substitutions
Fl´avio L. C. de Moura 1
and Fairouz Kamareddine2
and Mauricio
Ayala-Rinc´on 1
1
Departamento de Matem´atica, Universidade de Bras´ilia, Bras´ilia D.F., Brasil.
flavio@mat.unb.br,ayala@mat.unb.br
2
School of Mathematical and Computer Sciences, Heriot-Watt University,
Edinburgh, Scotland. fairouz@macs.hw.ac.uk
Abstract. Matching is a basic operation extensively used in computa-
tion. Second-order matching, in particular, provides an adequate envi-
ronment for expressing program transformations and pattern recognition
for automated deduction. The past few years have established the ben-
efit of using explicit substitutions for theorem proving and higher-order
unification. In this paper, we will make use of explicit substitutions to
facilitate matching: we develop a second-order matching algorithm via
the -style of explicit substitutions. We introduce a convenient nota-

  

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

 

Collections: Mathematics