Sciweavers

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

75

TOPLAS
2011

89views more TOPLAS 2011»

Automated termination proofs for haskell by term rewriting

14 years 10 months ago

Automated termination proofs for haskell by term rewriting

Download www.win.tue.nl

Jürgen Giesl, Matthias Raffelsieper, Peter Sc

Real-time Traffic

TOPLAS 2011 |

claim paper

Related Content

» Automated Incremental Termination Proofs for Hierarchically Defined Term Rewriting Systems

» Automated Termination Proofs for Logic Programs by Term Rewriting

» Termination of Fair Computations in Term Rewriting

» Termination of justfair computations in term rewriting

» A3PAT an approach for certified automated termination proofs

» Automated Termination Proofs for Java Programs with Cyclic Data

» On Tree Automata that Certify Termination of LeftLinear Term Rewriting Systems

» Cdiprover3 A Tool for Proving Derivational Complexities of Term Rewriting Systems

» The sizechange principle and dependency pairs for termination of term rewriting

Post Info
More Details (n/a)

Added	15 May 2011
Updated	15 May 2011
Type	Journal
Year	2011
Where	TOPLAS
Authors	Jürgen Giesl, Matthias Raffelsieper, Peter Schneider-Kamp, Stephan Swiderski, René Thiemann

Comments (0)