Search Sciweavers | Sciweavers

142 search results - page 4 / 29

» Total Termination of Term Rewriting

click to vote

ENTCS
2008

97views more ENTCS 2008»

Termination of Lazy Rewriting Revisited

13 years 7 months ago

Download www.logic.at

Lazy rewriting is a proper restriction of term rewriting that dynamically restricts the reduction of certain arguments of functions in order to obtain termination. In contrast to ...

Felix Schernhammer, Bernhard Gramlich

claim paper

Read More »

click to vote

RTA
2009
Springer

86views Theoretical Computer Science» more RTA 2009»

Proving Termination of Integer Term Rewriting

14 years 2 months ago

Download verify.rwth-aachen.de

Carsten Fuhs, Jürgen Giesl, Martin Plück...

claim paper

Read More »

click to vote

CADE
2006
Springer

127views Logical Reasoning» more CADE 2006»

Matrix Interpretations for Proving Termination of Term Rewriting

13 years 11 months ago

Download www.imn.htwk-leipzig.de

Jörg Endrullis, Johannes Waldmann, Hans Zante...

claim paper

Read More »

click to vote

CORR
2008
Springer

92views Education» more CORR 2008»

Automated Termination Proofs for Logic Programs by Term Rewriting

13 years 7 months ago

Download tocl.acm.org

Peter Schneider-Kamp, Jürgen Giesl, Alexander...

claim paper

Read More »

click to vote

TOPLAS
2011

89views more TOPLAS 2011»

Automated termination proofs for haskell by term rewriting

13 years 2 months ago

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers