Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

86

Voted

RTA
1995
Springer

65views Theoretical Computer Science» more RTA 1995»

Rewrite Systems for Integer Arithmetic

15 years 6 months ago

Rewrite Systems for Integer Arithmetic

Download igitur-archive.library.uu.nl

H. R. Walters, Hans Zantema

Real-time Traffic

RTA 1995 | Theoretical Computer Science |

claim paper

Related Content

» Rewriting Induction Linear Arithmetic Decision Procedure

» A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs

» Infinite Families of Finite String Rewriting Systems and Their Confluence

» Valiants model and the cost of computing integers

» Unbounded ProofLength SpeedUp in Deduction Modulo

» FunctionalBased Synthesis of Systolic Online Multipliers

» MUNCH Automated Reasoner for Sets and Multisets

» Certified Exact Real Arithmetic Using Coinduction in Arbitrary Integer Base

» A Sequent Calculus for Integer Arithmetic with Counterexample Generation

Post Info
More Details (n/a)

Added	26 Aug 2010
Updated	26 Aug 2010
Type	Conference
Year	1995
Where	RTA
Authors	H. R. Walters, Hans Zantema

Comments (0)