882 search results - page 64 / 177 » A Taste of Rewrite Systems |
106
Voted
TCS
1998
15 years 7 days ago
1998
We provide a global technique, called neatening, for the study of modularity of left-linear Term Rewriting Systems. Objects called bubbles are identi ed as the responsibles of mos...
106
click to vote
CORR
2008
Springer
14 years 11 months ago
2008
Springer
In deduction modulo, a theory is not represented by a set of axioms but by a congruence on propositions modulo which the inference rules of standard deductive systems--such as for ...
CRYPTO
2004
Springer
15 years 6 months ago
2004
Springer
Recently proposed algebraic attacks [2, 6] and fast algebraic attacks [1, 5] have provided the best analyses against some deployed LFSR-based ciphers. The process complexity is exp...
80
Voted
ACS
2007
15 years 22 days ago
2007
We present various results of the last twenty years converging towards a homotopical theory of computation. This new theory is based on two crucial notions : polygraphs (introduce...
103
Voted
TLCA
2005
Springer
15 years 6 months ago
2005
Springer
Cut elimination is a central result of the proof theory. This paper proposes a new approach for proving the theorem for Gentzen’s intuitionistic sequent calculus LJ, that relies ...