23201 search results - page 75 / 4641 » Rewriting Systems with Data |
109
click to vote
LPAR
2010
Springer
14 years 11 months ago
2010
Springer
Matrix interpretations can be used to bound the derivational complexity of term rewrite systems. In particular, triangular matrix interpretations over the natural numbers are known...
132
click to vote
AGTIVE
1999
Springer
15 years 5 months ago
1999
Springer
Abstract. In the paper Support for Design Patterns through Graph Transformation Tools in this volume, we have already outlined the global structure of a tool that allows for the an...
CSL
2009
Springer
15 years 7 months ago
2009
Springer
We investigate the relationship between two independently developed termination techniques for rst and higher-order rewrite systems. On the one hand, sized-types based termination...
111
click to vote
CSL
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We give the first mechanized proof of the fact that for showing termination of a term rewrite system, we may restrict to well-formed terms using just the function symbols...
105
click to vote
PADL
2007
Springer
15 years 7 months ago
2007
Springer
Abstract The Haskell String type is notoriously inefficient. We introduce a new data type, ByteString, based on lazy lists of byte arrays, combining the speed benefits of strict a...