66 search results - page 2 / 14 » Rewriting Haskell Strings |
RTA
2007
Springer
13 years 11 months ago
2007
Springer
The use of automata techniques to prove the termination of string rewrite systems and left-linear term rewrite systems is advocated by Geser et al. in a recent sequence of papers. ...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
A partial monoid P is a set with a partial multiplication
LPAR
2010
Springer
13 years 2 months ago
2010
Springer
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...
AAECC
2008
Springer
13 years 4 months ago
2008
Springer
We consider unary term rewriting, i.e., term rewriting with unary signatures where all function symbols are either unary or constants. Terms over such signatures can be transformed...
TOPLAS
2011
12 years 11 months ago
2011