(2013). Cartesian closed 2-categories and permutation equivalence in higher-order rewriting. Logical Methods in Computer Science.
Successfully copied to clipboard
Copying to clipboard failed
Chicago Style (17th ed.) Citation
"Cartesian Closed 2-categories and Permutation Equivalence in Higher-order Rewriting."
Logical Methods in Computer Science 2013.
Successfully copied to clipboard
Copying to clipboard failed
MLA (9th ed.) Citation
"Cartesian Closed 2-categories and Permutation Equivalence in Higher-order Rewriting."
Logical Methods in Computer Science, 2013.
Successfully copied to clipboard
Copying to clipboard failed
Warning: These citations may not always be 100% accurate.