Guillaume Geoffroy. Classical realizability as a classifier for nondeterminism. In Anuj Dawar, Erich Grädel, editors, Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018, Oxford, UK, July 09-12, 2018. pages 462-471, ACM, 2018. [doi]
@inproceedings{Geoffroy18,
title = {Classical realizability as a classifier for nondeterminism},
author = {Guillaume Geoffroy},
year = {2018},
doi = {10.1145/3209108.3209140},
url = {http://doi.acm.org/10.1145/3209108.3209140},
researchr = {https://researchr.org/publication/Geoffroy18},
cites = {0},
citedby = {0},
pages = {462-471},
booktitle = {Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018, Oxford, UK, July 09-12, 2018},
editor = {Anuj Dawar and Erich Grädel},
publisher = {ACM},
}