Sciweavers

882 search results - page 6 / 177
» A Taste of Rewrite Systems
Sort
View
TOPLAS
1998
52views more  TOPLAS 1998»
13 years 7 months ago
Within ARM's Reach: Compilation of Left-Linear Rewrite Systems via Minimal Rewrite Systems
A new compilation technique for left-linear term-rewriting systems is presented, where rewrite rules are transformed into so-called minimal rewrite rules. These minimal rules have...
Wan Fokkink, Jasper Kamperman, Pum Walters
LPAR
2010
Springer
13 years 5 months ago
Infinite Families of Finite String Rewriting Systems and Their Confluence
We introduce parameterized rewrite systems for describing infinite families of finite string rewrite systems depending upon non-negative integer parameters, as well as ways to reas...
Jean-Pierre Jouannaud, Benjamin Monate
FROCOS
2011
Springer
12 years 7 months ago
Harnessing First Order Termination Provers Using Higher Order Dependency Pairs
Many functional programs and higher order term rewrite systems contain, besides higher order rules, also a significant first order part. We discuss how an automatic termination p...
Carsten Fuhs, Cynthia Kop
FLOPS
2010
Springer
14 years 2 months ago
Complexity Analysis by Graph Rewriting
Recently, many techniques have been introduced that allow the (automated) classification of the runtime complexity of term rewrite systems (TRSs for short). In this paper we show ...
Martin Avanzini, Georg Moser
ENTCS
2000
80views more  ENTCS 2000»
13 years 7 months ago
Behavioral and Coinductive Rewriting
Behavioral rewriting di ers from standard rewriting in taking account of the weaker inference rules of behavioral logic, but it shares much with standard rewriting, including noti...
Joseph A. Goguen, Kai Lin, Grigore Rosu