Clemente, L., Parys, P., Salvati, S., & Walukiewicz, I. (2016, July 5). The Diagonal Problem for Higher-Order Recursion Schemes is Decidable. Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 96-105. https://doi.org/10.1145/2933575.2934527
Citace podle Chicago (17th ed.)Clemente, Lorenzo, Paweł Parys, Sylvain Salvati, a Igor Walukiewicz. "The Diagonal Problem for Higher-Order Recursion Schemes Is Decidable." Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science 5 Jul. 2016: 96-105. https://doi.org/10.1145/2933575.2934527.
Citace podle MLA (9th ed.)Clemente, Lorenzo, et al. "The Diagonal Problem for Higher-Order Recursion Schemes Is Decidable." Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 5 Jul. 2016, pp. 96-105, https://doi.org/10.1145/2933575.2934527.