Sciweavers

23201 search results - page 16 / 4641
» Rewriting Systems with Data
Sort
View
FOSSACS
2007
Springer
14 years 1 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
VLDB
2007
ACM
198views Database» more  VLDB 2007»
14 years 8 months ago
The End of an Architectural Era (It's Time for a Complete Rewrite)
In previous papers [SC05, SBC+07], some of us predicted the end of "one size fits all" as a commercial relational DBMS paradigm. These papers presented reasons and exper...
Michael Stonebraker, Samuel Madden, Daniel J. Abad...
DSL
2009
13 years 5 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
PLILP
1998
Springer
13 years 12 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
JSC
2007
152views more  JSC 2007»
13 years 7 months ago
Complete involutive rewriting systems
Given a monoid string rewriting system M, one way of obtaining a complete rewriting system for M is to use the classical Knuth-Bendix critical pairs completion algorithm. It is we...
Gareth A. Evans, Christopher D. Wensley