Sciweavers

882 search results - page 8 / 177
» A Taste of Rewrite Systems
Sort
View
91
Voted
CORR
2010
Springer
128views Education» more  CORR 2010»
15 years 16 days ago
Partial monoids: associativity and confluence
A partial monoid P is a set with a partial multiplication
Laurent Poinsot, Gérard Duchamp, Christophe...
101
Voted
CORR
2006
Springer
100views Education» more  CORR 2006»
15 years 14 days ago
Using groups for investigating rewrite systems
We describe several technical tools that prove to be efficient for investigating the rewrite systems associated with an equational specification. These tools consist in introducing...
Patrick Dehornoy
92
Voted
FOSSACS
2007
Springer
15 years 6 months ago
The Rewriting Calculus as a Combinatory Reduction System
The last few years have seen the development of the rewriting calculus (also called rho-calculus or ρ-calculus) that uniformly integrates first-order term rewriting and λ-calcul...
Clara Bertolissi, Claude Kirchner
100
Voted
DSL
2009
14 years 10 months ago
A Haskell Hosted DSL for Writing Transformation Systems
KURE is a Haskell hosted Domain Specific Language (DSL) for writing transformation systems based on rewrite strategies. When writing transformation systems, a significant amount of...
Andy Gill
86
Voted
PLILP
1998
Springer
15 years 4 months ago
Solution to the Problem of Zantema on a Persistent Property of Term Rewriting Systems
A property P of term rewriting systems is persistent if for any many-sorted term rewriting system R, R has the property P if and only if its underlying term rewriting system (R), ...
Takahito Aoto