(2012). A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems. Logical Methods in Computer Science.
Successfully copied to clipboard
Copying to clipboard failed
Chicago Style (17th ed.) Citation
"A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems."
Logical Methods in Computer Science 2012.
Successfully copied to clipboard
Copying to clipboard failed
MLA (9th ed.) Citation
"A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems."
Logical Methods in Computer Science, 2012.
Successfully copied to clipboard
Copying to clipboard failed
Warning: These citations may not always be 100% accurate.