Sciweavers

Share ➚
RTA   2011 International Conference on Rewriting Techniques and Applications
Wall of Fame | Most Viewed RTA-2011 Paper
RTA
2011
Springer
47views Theoretical Computer Science» more  RTA 2011»
Maximal Completion
8 months 8 days ago
Maximal Completion
Download  www.jaist.ac.jp
Given an equational system, completion procedures compute an equivalent and complete (terminating and confluent) term rewrite system. We present a very simple and efficient compl...
Dominik Klein, Nao Hirokawa
claim paper
Read More »
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
IdReadViewsTitleStatus
1Download preprint from source47
Maximal Completion
claim
2Download preprint from source47
Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting
claim
Spread the Word
Explore & Download
Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
Productivity Tools
International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
Document Tools
PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
Image Tools
JPG to PS JPG to PDF Extract Images from PDF Image Converter
Sciweavers
About Community Report Bug Request Feature Privacy Policy Terms of Use Contact

Copyright © 2009-2011 Sciweavers LLC. All rights reserved.

books