Sciweavers

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

31

Voted

RTA
2000
Springer

favoriteEmaildiscussreport

98views Theoretical Computer Science» more RTA 2000»

Termination and Confluence of Higher-Order Rewrite Systems

14 years 2 months ago

Termination and Confluence of Higher-Order Rewrite Systems

Download www-rocq.inria.fr

Frédéric Blanqui

Real-time Traffic

RTA 2000 | Theoretical Computer Science |

claim paper

Related Content

» Harnessing First Order Termination Provers Using Higher Order Dependency Pairs

» A TypeBased Termination Criterion for DependentlyTyped HigherOrder Rewrite Systems

» HigherOrder NonModularity

» Universal Algebra for Termination of HigherOrder Rewriting

» HigherOrder Critical Pairs

» Undecidable Properties on LengthTwo String Rewriting Systems

» Termination in HigherOrder Concurrent Calculi

» HigherOrder Narrowing

» A HigherOrder KnuthBendix Procedure and Its Applications

Post Info
More Details (n/a)

Added	25 Aug 2010
Updated	25 Aug 2010
Type	Conference
Year	2000
Where	RTA
Authors	Frédéric Blanqui

Comments (0)