Sciweavers

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

12

JLP
2010

favoriteEmaildiscussreport

85views more JLP 2010»

Characterizing and proving operational termination of deterministic conditional term rewriting systems

12 years 11 months ago

Characterizing and proving operational termination of deterministic conditional term rewriting systems

Download www.logic.at

Felix Schernhammer, Bernhard Gramlich

Real-time Traffic

JLP 2010 |

claim paper

Related Content

» Proving Termination of Rewrite Systems Using Bounds

» Proving operational termination of membership equational programs

» Polygraphs for termination of leftlinear term rewriting systems

» Proving Liveness with Fairness Using Rewriting

» Reducing RightHand Sides for Termination

» Enhancing dependency pair method using strong computability in simplytyped term rewriting

» Innermost Termination of Rewrite Systems by Labeling

» Termination orders for 3dimensional rewriting

» Confluence of Conditional Rewrite Systems

Post Info
More Details (n/a)

Added	19 May 2011
Updated	19 May 2011
Type	Journal
Year	2010
Where	JLP
Authors	Felix Schernhammer, Bernhard Gramlich

Comments (0)