(2017). A Classical Realizability Model arising from a Stable Model of Untyped Lambda Calculus. Logical Methods in Computer Science.
Successfully copied to clipboard
Copying to clipboard failed
Chicago Style (17th ed.) Citation
"A Classical Realizability Model Arising from a Stable Model of Untyped Lambda Calculus."
Logical Methods in Computer Science 2017.
Successfully copied to clipboard
Copying to clipboard failed
MLA (9th ed.) Citation
"A Classical Realizability Model Arising from a Stable Model of Untyped Lambda Calculus."
Logical Methods in Computer Science, 2017.
Successfully copied to clipboard
Copying to clipboard failed
Warning: These citations may not always be 100% accurate.