(2025). A Characterization of Basic Feasible Functionals Through Higher-Order Rewriting and Tuple Interpretations. Logical Methods in Computer Science.
Successfully copied to clipboard
Copying to clipboard failed
Chicago Style (17th ed.) Citation
"A Characterization of Basic Feasible Functionals Through Higher-Order Rewriting and Tuple Interpretations."
Logical Methods in Computer Science 2025.
Successfully copied to clipboard
Copying to clipboard failed
MLA (9th ed.) Citation
"A Characterization of Basic Feasible Functionals Through Higher-Order Rewriting and Tuple Interpretations."
Logical Methods in Computer Science, 2025.
Successfully copied to clipboard
Copying to clipboard failed
Warning: These citations may not always be 100% accurate.