Lorenzo Clemente, Pawel Parys, Sylvain Salvati, Igor Walukiewicz. The Diagonal Problem for Higher-Order Recursion Schemes is Decidable. In Martin Grohe, Eric Koskinen, Natarajan Shankar, editors, Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '16, New York, NY, USA, July 5-8, 2016. pages 96-105, ACM, 2016. [doi]
@inproceedings{ClementePSW16,
title = {The Diagonal Problem for Higher-Order Recursion Schemes is Decidable},
author = {Lorenzo Clemente and Pawel Parys and Sylvain Salvati and Igor Walukiewicz},
year = {2016},
doi = {10.1145/2933575.2934527},
url = {http://doi.acm.org/10.1145/2933575.2934527},
researchr = {https://researchr.org/publication/ClementePSW16},
cites = {0},
citedby = {0},
pages = {96-105},
booktitle = {Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '16, New York, NY, USA, July 5-8, 2016},
editor = {Martin Grohe and Eric Koskinen and Natarajan Shankar},
publisher = {ACM},
isbn = {978-1-4503-4391-6},
}