Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

LICS
1991
IEEE

favoriteEmaildiscussreport

106views Automated Reasoning» more LICS 1991»

Higher-Order Critical Pairs

13 years 7 months ago

Higher-Order Critical Pairs

Download www.lsi.upc.edu

Abstract. We extend the termination proof methods based on reduction orderings to higher-order rewriting systems `a la Nipkow using higher-order pattern matching for ﬁring rules, and accommodate for any use of eta, as a reduction, as an expansion or as an equation. As a main novelty, we provide with a mechanism for transforming any reduction ordering including beta-reduction, such as the higher-order recursive path ordering, into a reduction ordering for proving termination of rewriting `a la Nipkow. Non-trivial examples are carried out.

Tobias Nipkow

Real-time Traffic

Automated Reasoning | La Nipkow | LICS 1991 | Reduction Ordering | Termination Proof Methods |

claim paper

Related Content

» Harnessing First Order Termination Provers Using Higher Order Dependency Pairs

» Extracting Higher Order Critical Points and Topological Simplification of 3D Vector Fields

» Visualization of higher order singularities in vector fields

» Learning to Represent Spatial Transformations with Factored HigherOrder Boltzmann Machines

» Higher order motion models and spectral clustering

» A Design Structure for Higher Order Quotients

» Modeling regulatory sites with higher order positiondependent weight matrices

» A Higher Order MRFModel for StereoReconstruction

» Higher Order Image Pyramids

Post Info
More Details (n/a)

Added	27 Aug 2010
Updated	27 Aug 2010
Type	Conference
Year	1991
Where	LICS
Authors	Tobias Nipkow

Comments (0)