@inproceedings{Parys:FSTTCS:2017,
Address = {Dagstuhl, Germany},
Annote = {Keywords: diagonal problem, higher-order recursion schemes, intersection types, downward closure},
Author = {Parys, Pawel},
BookTitle = {Proc. of FSTTCS'17},
Editor = {Lokam, Satya and Ramanujam, R.},
File = {LIPIcs-FSTTCS-2017-45 (0) - a - a - h.pdf},
ISBN = {978-3-95977-055-2},
ISSN = {1868-8969},
Keywords = {diagonal problem and citesme!},
Pages = {45:1--45:14},
Publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
Series = {Leibniz International Proceedings in Informatics (LIPIcs)},
Title = {{The Complexity of the Diagonal Problem for Recursion Schemes}},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/8375},
Volume = {93},
Year = {2017},
bdsk-url-1 = {http://drops.dagstuhl.de/opus/volltexte/2018/8375},
bdsk-url-2 = {https://dx.doi.org/10.4230/LIPIcs.FSTTCS.2017.45},
date-added = {2018-02-17 17:19:34 +0000},
date-modified = {2019-05-07 20:03:40 +0200},
urn = {urn:nbn:de:0030-drops-83757},
doi = {10.4230/LIPIcs.FSTTCS.2017.45}
}
Library Size: 13G (12941 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A