Sciweavers

1000 search results - page 76 / 200
» Nominal rewriting systems
Sort
View
ENTCS
2007
168views more  ENTCS 2007»
15 years 5 months ago
Bytecode Rewriting in Tom
In this paper, we present a term rewriting based library for manipulating Java bytecode. We define a mapping from bytecode programs to algebraic terms, and we use Tom, an extensi...
Emilie Balland, Pierre-Etienne Moreau, Antoine Rei...
VLDB
2007
ACM
198views Database» more  VLDB 2007»
16 years 5 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...
LATIN
2004
Springer
15 years 11 months ago
Another View of the Gaussian Algorithm
Abstract. We introduce here a rewrite system in the group of unimodular matrices, i.e., matrices with integer entries and with determinant
Ali Akhavi, Céline Moreira Dos Santos
IEICET
2007
110views more  IEICET 2007»
15 years 5 months ago
A Higher-Order Knuth-Bendix Procedure and Its Applications
The completeness (i.e. confluent and terminating) property is an important concept when using a term rewriting system (TRS) as a computational model of functional programming lang...
Keiichirou Kusakari, Yuki Chiba
CADE
2012
Springer
13 years 8 months ago
Proving Non-looping Non-termination Automatically
We introduce a technique to prove non-termination of term rewrite systems automatically. Our technique improves over previous approaches substantially, as it can also detect non-lo...
Fabian Emmes, Tim Enger, Jürgen Giesl